%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO057-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n005.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.35s 2.54s
% Output : Refutation 2.35s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GEO057-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.15/0.35 % Computer : n005.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Sat Jun 18 05:04:53 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.21/0.37 ----- Otter 3.2, August 2001 -----
% 0.21/0.37 The process was started by sandbox2 on n005.cluster.edu,
% 0.21/0.37 Sat Jun 18 05:04:53 2022
% 0.21/0.37 The command was "./sos". The process ID is 1008.
% 0.21/0.37
% 0.21/0.37 set(prolog_style_variables).
% 0.21/0.37 set(auto).
% 0.21/0.37 dependent: set(auto1).
% 0.21/0.37 dependent: set(process_input).
% 0.21/0.37 dependent: clear(print_kept).
% 0.21/0.37 dependent: clear(print_new_demod).
% 0.21/0.37 dependent: clear(print_back_demod).
% 0.21/0.37 dependent: clear(print_back_sub).
% 0.21/0.37 dependent: set(control_memory).
% 0.21/0.37 dependent: assign(max_mem, 12000).
% 0.21/0.37 dependent: assign(pick_given_ratio, 4).
% 0.21/0.37 dependent: assign(stats_level, 1).
% 0.21/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.21/0.37 dependent: assign(sos_limit, 5000).
% 0.21/0.37 dependent: assign(max_weight, 60).
% 0.21/0.37 clear(print_given).
% 0.21/0.37
% 0.21/0.37 list(usable).
% 0.21/0.37
% 0.21/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.21/0.37
% 0.21/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.21/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.21/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.21/0.37 clauses in usable.
% 0.21/0.37
% 0.21/0.37 dependent: set(knuth_bendix).
% 0.21/0.37 dependent: set(para_from).
% 0.21/0.37 dependent: set(para_into).
% 0.21/0.37 dependent: clear(para_from_right).
% 0.21/0.37 dependent: clear(para_into_right).
% 0.21/0.37 dependent: set(para_from_vars).
% 0.21/0.37 dependent: set(eq_units_both_ways).
% 0.21/0.37 dependent: set(dynamic_demod_all).
% 0.21/0.37 dependent: set(dynamic_demod).
% 0.21/0.37 dependent: set(order_eq).
% 0.21/0.37 dependent: set(back_demod).
% 0.21/0.37 dependent: set(lrpo).
% 0.21/0.37 dependent: set(hyper_res).
% 0.21/0.37 dependent: set(unit_deletion).
% 0.21/0.37 dependent: set(factor).
% 0.21/0.37
% 0.21/0.37 ------------> process usable:
% 0.21/0.37
% 0.21/0.37 ------------> process sos:
% 0.21/0.37 36 back subsumes 33.
% 0.21/0.37 Following clause subsumed by 41 during input processing: 0 [copy,41,flip.1] {-} A=A.
% 0.21/0.37
% 0.21/0.37 ======= end of input processing =======
% 0.79/0.99
% 0.79/0.99 Model 1 (0.00 seconds, 0 Inserts)
% 0.79/0.99
% 0.79/0.99 Stopped by limit on number of solutions
% 0.79/0.99
% 0.79/0.99
% 0.79/0.99 -------------- Softie stats --------------
% 0.79/0.99
% 0.79/0.99 UPDATE_STOP: 300
% 0.79/0.99 SFINDER_TIME_LIMIT: 2
% 0.79/0.99 SHORT_CLAUSE_CUTOFF: 4
% 0.79/0.99 number of clauses in intial UL: 32
% 0.79/0.99 number of clauses initially in problem: 39
% 0.79/0.99 percentage of clauses intially in UL: 82
% 0.79/0.99 percentage of distinct symbols occuring in initial UL: 76
% 0.79/0.99 percent of all initial clauses that are short: 100
% 0.79/0.99 absolute distinct symbol count: 13
% 0.79/0.99 distinct predicate count: 3
% 0.79/0.99 distinct function count: 6
% 0.79/0.99 distinct constant count: 4
% 0.79/0.99
% 0.79/0.99 ---------- no more Softie stats ----------
% 0.79/0.99
% 0.79/0.99
% 0.79/0.99
% 0.79/0.99 Model 2 (0.00 seconds, 0 Inserts)
% 0.79/0.99
% 0.79/0.99 Stopped by limit on number of solutions
% 0.79/0.99
% 0.79/0.99 =========== start of search ===========
% 2.35/2.54
% 2.35/2.54 -------- PROOF --------
% 2.35/2.54 % SZS status Unsatisfiable
% 2.35/2.54 % SZS output start Refutation
% 2.35/2.54
% 2.35/2.54 Stopped by limit on insertions
% 2.35/2.54
% 2.35/2.54 Stopped by limit on insertions
% 2.35/2.54
% 2.35/2.54 Model 3 [ 36 61 197365 ] (0.00 seconds, 250000 Inserts)
% 2.35/2.54
% 2.35/2.54 ----> UNIT CONFLICT at 2.15 sec ----> 76 [binary,74.1,42.1] {-} $F.
% 2.35/2.54
% 2.35/2.54 Length of proof is 3. Level of proof is 2.
% 2.35/2.54
% 2.35/2.54 ---------------- PROOF ----------------
% 2.35/2.54 % SZS status Unsatisfiable
% 2.35/2.54 % SZS output start Refutation
% 2.35/2.54
% 2.35/2.54 2 [] {+} -equidistant(A,B,C,C)|A=B.
% 2.35/2.54 16 [] {-} u!=reflection(u,u).
% 2.35/2.54 17 [copy,16,flip.1] {-} reflection(u,u)!=u.
% 2.35/2.54 38 [] {+} equidistant(A,extension(B,A,C,D),C,D).
% 2.35/2.54 40,39 [] {-} reflection(A,B)=extension(A,B,A,B).
% 2.35/2.54 42 [back_demod,17,demod,40] {-} extension(u,u,u,u)!=u.
% 2.35/2.54 74 [hyper,38,2,flip.1] {-} extension(A,B,C,C)=B.
% 2.35/2.54 76 [binary,74.1,42.1] {-} $F.
% 2.35/2.54
% 2.35/2.54 % SZS output end Refutation
% 2.35/2.54 ------------ end of proof -------------
% 2.35/2.54
% 2.35/2.54
% 2.35/2.54 Search stopped by max_proofs option.
% 2.35/2.54
% 2.35/2.54
% 2.35/2.54 Search stopped by max_proofs option.
% 2.35/2.54
% 2.35/2.54 ============ end of search ============
% 2.35/2.54
% 2.35/2.54 ----------- soft-scott stats ----------
% 2.35/2.54
% 2.35/2.54 true clauses given 0 (0.0%)
% 2.35/2.54 false clauses given 3
% 2.35/2.54
% 2.35/2.54 FALSE TRUE
% 2.35/2.54 3 0 1
% 2.35/2.54 5 0 1
% 2.35/2.54 7 1 0
% 2.35/2.54 9 1 0
% 2.35/2.54 13 2 1
% 2.35/2.54 16 1 0
% 2.35/2.54 17 0 1
% 2.35/2.54 20 1 0
% 2.35/2.54 24 1 0
% 2.35/2.54 30 0 3
% 2.35/2.54 33 3 0
% 2.35/2.54 34 0 1
% 2.35/2.54 35 1 0
% 2.35/2.54 37 1 1
% 2.35/2.54 38 1 0
% 2.35/2.54 39 1 0
% 2.35/2.54 40 0 1
% 2.35/2.54 42 1 0
% 2.35/2.54 43 1 0
% 2.35/2.54 44 0 1
% 2.35/2.54 49 1 0
% 2.35/2.54 tot: 17 11 (39.3% true)
% 2.35/2.54
% 2.35/2.54
% 2.35/2.54 Model 3 [ 36 61 197365 ] (0.00 seconds, 250000 Inserts)
% 2.35/2.54
% 2.35/2.54 That finishes the proof of the theorem.
% 2.35/2.54
% 2.35/2.54 Process 1008 finished Sat Jun 18 05:04:55 2022
%------------------------------------------------------------------------------