TSTP Solution File: GEO056-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO056-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sat Jul 16 06:17:46 EDT 2022
% Result : Unsatisfiable 2.84s 3.06s
% Output : Refutation 2.84s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO056-2 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n003.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Fri Jun 17 16:54:27 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.36 ----- Otter 3.2, August 2001 -----
% 0.14/0.36 The process was started by sandbox on n003.cluster.edu,
% 0.14/0.36 Fri Jun 17 16:54:27 2022
% 0.14/0.36 The command was "./sos". The process ID is 11788.
% 0.14/0.36
% 0.14/0.36 set(prolog_style_variables).
% 0.14/0.36 set(auto).
% 0.14/0.36 dependent: set(auto1).
% 0.14/0.36 dependent: set(process_input).
% 0.14/0.36 dependent: clear(print_kept).
% 0.14/0.36 dependent: clear(print_new_demod).
% 0.14/0.36 dependent: clear(print_back_demod).
% 0.14/0.36 dependent: clear(print_back_sub).
% 0.14/0.36 dependent: set(control_memory).
% 0.14/0.36 dependent: assign(max_mem, 12000).
% 0.14/0.36 dependent: assign(pick_given_ratio, 4).
% 0.14/0.36 dependent: assign(stats_level, 1).
% 0.14/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36 dependent: assign(sos_limit, 5000).
% 0.14/0.36 dependent: assign(max_weight, 60).
% 0.14/0.36 clear(print_given).
% 0.14/0.36
% 0.14/0.36 list(usable).
% 0.14/0.36
% 0.14/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.14/0.36
% 0.14/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.14/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.36 clauses in usable.
% 0.14/0.36
% 0.14/0.36 dependent: set(knuth_bendix).
% 0.14/0.36 dependent: set(para_from).
% 0.14/0.36 dependent: set(para_into).
% 0.14/0.36 dependent: clear(para_from_right).
% 0.14/0.36 dependent: clear(para_into_right).
% 0.14/0.36 dependent: set(para_from_vars).
% 0.14/0.36 dependent: set(eq_units_both_ways).
% 0.14/0.36 dependent: set(dynamic_demod_all).
% 0.14/0.36 dependent: set(dynamic_demod).
% 0.14/0.36 dependent: set(order_eq).
% 0.14/0.36 dependent: set(back_demod).
% 0.14/0.36 dependent: set(lrpo).
% 0.14/0.36 dependent: set(hyper_res).
% 0.14/0.36 dependent: set(unit_deletion).
% 0.14/0.36 dependent: set(factor).
% 0.14/0.36
% 0.14/0.36 ------------> process usable:
% 0.14/0.36
% 0.14/0.36 ------------> process sos:
% 0.14/0.36 36 back subsumes 33.
% 0.14/0.36 Following clause subsumed by 44 during input processing: 0 [copy,44,flip.1] {-} A=A.
% 0.14/0.36
% 0.14/0.36 ======= end of input processing =======
% 0.76/0.94
% 0.76/0.94 Model 1 (0.00 seconds, 0 Inserts)
% 0.76/0.94
% 0.76/0.94 Stopped by limit on number of solutions
% 0.76/0.94
% 0.76/0.94
% 0.76/0.94 -------------- Softie stats --------------
% 0.76/0.94
% 0.76/0.94 UPDATE_STOP: 300
% 0.76/0.94 SFINDER_TIME_LIMIT: 2
% 0.76/0.94 SHORT_CLAUSE_CUTOFF: 4
% 0.76/0.94 number of clauses in intial UL: 32
% 0.76/0.94 number of clauses initially in problem: 41
% 0.76/0.94 percentage of clauses intially in UL: 78
% 0.76/0.94 percentage of distinct symbols occuring in initial UL: 71
% 0.76/0.94 percent of all initial clauses that are short: 100
% 0.76/0.94 absolute distinct symbol count: 14
% 0.76/0.94 distinct predicate count: 3
% 0.76/0.94 distinct function count: 6
% 0.76/0.94 distinct constant count: 5
% 0.76/0.94
% 0.76/0.94 ---------- no more Softie stats ----------
% 0.76/0.94
% 0.76/0.94
% 0.76/0.94
% 0.76/0.94 Model 2 (0.00 seconds, 0 Inserts)
% 0.76/0.94
% 0.76/0.94 Stopped by limit on number of solutions
% 0.76/0.94
% 0.76/0.94 =========== start of search ===========
% 2.84/3.06
% 2.84/3.06 -------- PROOF --------
% 2.84/3.06 % SZS status Unsatisfiable
% 2.84/3.06 % SZS output start Refutation
% 2.84/3.06
% 2.84/3.06 Model 3 (0.00 seconds, 0 Inserts)
% 2.84/3.06
% 2.84/3.06 Stopped by limit on number of solutions
% 2.84/3.06
% 2.84/3.06 Stopped by limit on insertions
% 2.84/3.06
% 2.84/3.06 Stopped by limit on insertions
% 2.84/3.06
% 2.84/3.06 Model 4 [ 38 69 221228 ] (0.00 seconds, 250000 Inserts)
% 2.84/3.06
% 2.84/3.06 ----> UNIT CONFLICT at 2.67 sec ----> 94 [binary,92.1,45.1] {-} $F.
% 2.84/3.06
% 2.84/3.06 Length of proof is 4. Level of proof is 2.
% 2.84/3.06
% 2.84/3.06 ---------------- PROOF ----------------
% 2.84/3.06 % SZS status Unsatisfiable
% 2.84/3.06 % SZS output start Refutation
% 2.84/3.06
% 2.84/3.06 2 [] {+} -equidistant(A,B,C,C)|A=B.
% 2.84/3.06 16 [] {-} v!=reflection(u,v).
% 2.84/3.06 17 [copy,16,flip.1] {-} reflection(u,v)!=v.
% 2.84/3.06 38 [] {+} equidistant(A,extension(B,A,C,D),C,D).
% 2.84/3.06 40,39 [] {-} reflection(A,B)=extension(A,B,A,B).
% 2.84/3.06 41 [] {-} u=v.
% 2.84/3.06 43,42 [copy,41,flip.1] {+} v=u.
% 2.84/3.06 45 [back_demod,17,demod,43,40,43] {-} extension(u,u,u,u)!=u.
% 2.84/3.06 92 [hyper,38,2,flip.1] {-} extension(A,B,C,C)=B.
% 2.84/3.06 94 [binary,92.1,45.1] {-} $F.
% 2.84/3.06
% 2.84/3.06 % SZS output end Refutation
% 2.84/3.06 ------------ end of proof -------------
% 2.84/3.06
% 2.84/3.06
% 2.84/3.06 Search stopped by max_proofs option.
% 2.84/3.06
% 2.84/3.06
% 2.84/3.06 Search stopped by max_proofs option.
% 2.84/3.06
% 2.84/3.06 ============ end of search ============
% 2.84/3.06
% 2.84/3.06 ----------- soft-scott stats ----------
% 2.84/3.06
% 2.84/3.06 true clauses given 0 (0.0%)
% 2.84/3.06 false clauses given 4
% 2.84/3.06
% 2.84/3.06 FALSE TRUE
% 2.84/3.06 3 0 1
% 2.84/3.06 5 0 1
% 2.84/3.06 7 1 1
% 2.84/3.06 8 0 1
% 2.84/3.06 9 1 0
% 2.84/3.06 12 0 1
% 2.84/3.06 13 2 1
% 2.84/3.06 16 1 2
% 2.84/3.06 17 0 1
% 2.84/3.06 20 1 2
% 2.84/3.06 21 0 1
% 2.84/3.06 22 0 1
% 2.84/3.06 24 1 0
% 2.84/3.06 25 0 2
% 2.84/3.06 30 0 4
% 2.84/3.06 31 0 2
% 2.84/3.06 33 3 0
% 2.84/3.06 34 0 1
% 2.84/3.06 35 0 1
% 2.84/3.06 36 0 1
% 2.84/3.06 37 1 1
% 2.84/3.06 38 1 0
% 2.84/3.06 39 1 0
% 2.84/3.06 40 1 0
% 2.84/3.06 42 1 0
% 2.84/3.06 43 1 0
% 2.84/3.06 44 0 1
% 2.84/3.06 49 1 0
% 2.84/3.06 tot: 17 26 (60.5% true)
% 2.84/3.06
% 2.84/3.06
% 2.84/3.06 Model 4 [ 38 69 221228 ] (0.00 seconds, 250000 Inserts)
% 2.84/3.06
% 2.84/3.06 That finishes the proof of the theorem.
% 2.84/3.06
% 2.84/3.06 Process 11788 finished Fri Jun 17 16:54:30 2022
%------------------------------------------------------------------------------