%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO085+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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:18:00 EDT 2022
% Result : Theorem 0.95s 1.14s
% Output : Refutation 0.95s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GEO085+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 18 10:17:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n026.cluster.edu,
% 0.12/0.35 Sat Jun 18 10:17:54 2022
% 0.12/0.35 The command was "./sos". The process ID is 11881.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=12.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 59 during input processing: 0 [copy,59,flip.1] {-} A=A.
% 0.12/0.35 59 back subsumes 52.
% 0.12/0.35 59 back subsumes 51.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.19/0.43
% 0.19/0.43 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 Stopped by limit on number of solutions
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 -------------- Softie stats --------------
% 0.19/0.43
% 0.19/0.43 UPDATE_STOP: 300
% 0.19/0.43 SFINDER_TIME_LIMIT: 2
% 0.19/0.43 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.43 number of clauses in intial UL: 47
% 0.19/0.43 number of clauses initially in problem: 58
% 0.19/0.43 percentage of clauses intially in UL: 81
% 0.19/0.43 percentage of distinct symbols occuring in initial UL: 91
% 0.19/0.43 percent of all initial clauses that are short: 100
% 0.19/0.43 absolute distinct symbol count: 23
% 0.19/0.43 distinct predicate count: 8
% 0.19/0.43 distinct function count: 14
% 0.19/0.43 distinct constant count: 1
% 0.19/0.43
% 0.19/0.43 ---------- no more Softie stats ----------
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 =========== start of search ===========
% 0.95/1.14
% 0.95/1.14 -------- PROOF --------
% 0.95/1.14 % SZS status Theorem
% 0.95/1.14 % SZS output start Refutation
% 0.95/1.14
% 0.95/1.14 Model 2 [ 8 1 10927 ] (0.00 seconds, 24581 Inserts)
% 0.95/1.14
% 0.95/1.14 Stopped by limit on insertions
% 0.95/1.14
% 0.95/1.14 Model 3 [ 8 3 16325 ] (0.00 seconds, 250000 Inserts)
% 0.95/1.14
% 0.95/1.14 Stopped by limit on insertions
% 0.95/1.14
% 0.95/1.14 Model 4 [ 8 3 18985 ] (0.00 seconds, 250000 Inserts)
% 0.95/1.14
% 0.95/1.14 Stopped by limit on insertions
% 0.95/1.14
% 0.95/1.14 Model 5 [ 18 1 2342 ] (0.00 seconds, 250000 Inserts)
% 0.95/1.14
% 0.95/1.14 -----> EMPTY CLAUSE at 0.76 sec ----> 937 [hyper,858,37,604] {-} $F.
% 0.95/1.14
% 0.95/1.14 Length of proof is 6. Level of proof is 4.
% 0.95/1.14
% 0.95/1.14 ---------------- PROOF ----------------
% 0.95/1.14 % SZS status Theorem
% 0.95/1.14 % SZS output start Refutation
% 0.95/1.14
% 0.95/1.14 26 [] {+} -closed(A)| -end_point(B,A).
% 0.95/1.14 27 [] {+} -open(A)|end_point($f7(A),A).
% 0.95/1.14 35 [] {+} -end_point(A,B)|end_point($f11(B,A),B).
% 0.95/1.14 36 [] {-} -end_point(A,B)|A!=$f11(B,A).
% 0.95/1.14 37 [copy,36,flip.2] {+} -end_point(A,B)|$f11(B,A)!=A.
% 0.95/1.14 42 [] {+} A=B| -end_point(A,$c1)| -end_point(B,$c1).
% 0.95/1.14 55 [] {+} closed(A)|end_point($f6(A),A).
% 0.95/1.14 58 [] {-} open($c1).
% 0.95/1.14 75 [hyper,58,27] {-} end_point($f7($c1),$c1).
% 0.95/1.14 100 [hyper,75,35] {-} end_point($f11($c1,$f7($c1)),$c1).
% 0.95/1.14 604 [hyper,55,26,75] {-} end_point($f6($c1),$c1).
% 0.95/1.14 662,661 [hyper,604,42,75] {+} $f7($c1)=$f6($c1).
% 0.95/1.14 858 [hyper,100,42,604,demod,662,flip.1] {-} $f11($c1,$f6($c1))=$f6($c1).
% 0.95/1.14 937 [hyper,858,37,604] {-} $F.
% 0.95/1.14
% 0.95/1.14 % SZS output end Refutation
% 0.95/1.14 ------------ end of proof -------------
% 0.95/1.14
% 0.95/1.14
% 0.95/1.14 Search stopped by max_proofs option.
% 0.95/1.14
% 0.95/1.14
% 0.95/1.14 Search stopped by max_proofs option.
% 0.95/1.14
% 0.95/1.14 ============ end of search ============
% 0.95/1.14
% 0.95/1.14 ----------- soft-scott stats ----------
% 0.95/1.14
% 0.95/1.14 true clauses given 2 (13.3%)
% 0.95/1.14 false clauses given 13
% 0.95/1.14
% 0.95/1.14 FALSE TRUE
% 0.95/1.14 4 1 0
% 0.95/1.14 5 0 1
% 0.95/1.14 6 2 6
% 0.95/1.14 8 1 2
% 0.95/1.14 9 1 2
% 0.95/1.14 10 1 21
% 0.95/1.14 11 3 2
% 0.95/1.14 12 10 22
% 0.95/1.14 13 2 0
% 0.95/1.14 14 14 12
% 0.95/1.14 15 12 7
% 0.95/1.14 16 16 8
% 0.95/1.14 17 6 12
% 0.95/1.14 18 23 24
% 0.95/1.14 19 22 21
% 0.95/1.14 20 35 22
% 0.95/1.14 21 15 0
% 0.95/1.14 22 26 10
% 0.95/1.14 23 30 14
% 0.95/1.14 24 5 3
% 0.95/1.14 25 33 12
% 0.95/1.14 26 13 4
% 0.95/1.14 27 19 10
% 0.95/1.14 28 9 0
% 0.95/1.14 29 17 14
% 0.95/1.14 30 8 6
% 0.95/1.14 31 31 18
% 0.95/1.14 32 9 1
% 0.95/1.14 33 6 9
% 0.95/1.14 34 16 3
% 0.95/1.14 35 10 17
% 0.95/1.14 36 4 10
% 0.95/1.14 37 25 19
% 0.95/1.14 38 2 3
% 0.95/1.14 39 12 7
% 0.95/1.14 40 9 10
% 0.95/1.14 41 0 9
% 0.95/1.14 42 3 11
% 0.95/1.14 43 12 3
% 0.95/1.14 45 6 2
% 0.95/1.14 46 6 18
% 0.95/1.14 50 1 1
% 0.95/1.14 51 0 6
% 0.95/1.14 52 6 3
% 0.95/1.14 56 2 0
% 0.95/1.14 tot: 484 385 (44.3% true)
% 0.95/1.14
% 0.95/1.14
% 0.95/1.14 Model 5 [ 18 1 2342 ] (0.00 seconds, 250000 Inserts)
% 0.95/1.14
% 0.95/1.14 That finishes the proof of the theorem.
% 0.95/1.14
% 0.95/1.14 Process 11881 finished Sat Jun 18 10:17:55 2022
%------------------------------------------------------------------------------