%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP149-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n029.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 11:41:56 EDT 2022
% Result : Unsatisfiable 0.76s 0.93s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : GRP149-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.08/0.09 % Command : sos-script %s
% 0.08/0.29 % Computer : n029.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 600
% 0.08/0.29 % DateTime : Mon Jun 13 23:52:25 EDT 2022
% 0.08/0.29 % CPUTime :
% 0.08/0.30 ----- Otter 3.2, August 2001 -----
% 0.08/0.30 The process was started by sandbox on n029.cluster.edu,
% 0.08/0.30 Mon Jun 13 23:52:25 2022
% 0.08/0.30 The command was "./sos". The process ID is 30227.
% 0.08/0.30
% 0.08/0.30 set(prolog_style_variables).
% 0.08/0.30 set(auto).
% 0.08/0.30 dependent: set(auto1).
% 0.08/0.30 dependent: set(process_input).
% 0.08/0.30 dependent: clear(print_kept).
% 0.08/0.30 dependent: clear(print_new_demod).
% 0.08/0.30 dependent: clear(print_back_demod).
% 0.08/0.30 dependent: clear(print_back_sub).
% 0.08/0.30 dependent: set(control_memory).
% 0.08/0.30 dependent: assign(max_mem, 12000).
% 0.08/0.30 dependent: assign(pick_given_ratio, 4).
% 0.08/0.30 dependent: assign(stats_level, 1).
% 0.08/0.30 dependent: assign(pick_semantic_ratio, 3).
% 0.08/0.30 dependent: assign(sos_limit, 5000).
% 0.08/0.30 dependent: assign(max_weight, 60).
% 0.08/0.30 clear(print_given).
% 0.08/0.30
% 0.08/0.30 list(usable).
% 0.08/0.30
% 0.08/0.30 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.08/0.30
% 0.08/0.30 All clauses are units, and equality is present; the
% 0.08/0.30 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.08/0.30
% 0.08/0.30 dependent: set(knuth_bendix).
% 0.08/0.30 dependent: set(para_from).
% 0.08/0.30 dependent: set(para_into).
% 0.08/0.30 dependent: clear(para_from_right).
% 0.08/0.30 dependent: clear(para_into_right).
% 0.08/0.30 dependent: set(para_from_vars).
% 0.08/0.30 dependent: set(eq_units_both_ways).
% 0.08/0.30 dependent: set(dynamic_demod_all).
% 0.08/0.30 dependent: set(dynamic_demod).
% 0.08/0.30 dependent: set(order_eq).
% 0.08/0.30 dependent: set(back_demod).
% 0.08/0.30 dependent: set(lrpo).
% 0.08/0.30
% 0.08/0.30 ------------> process usable:
% 0.08/0.30
% 0.08/0.30 ------------> process sos:
% 0.08/0.30 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] {-} greatest_lower_bound(A,B)=greatest_lower_bound(B,A).
% 0.08/0.30 Following clause subsumed by 9 during input processing: 0 [copy,9,flip.1] {-} least_upper_bound(A,B)=least_upper_bound(B,A).
% 0.08/0.30 Following clause subsumed by 36 during input processing: 0 [copy,36,flip.1] {-} A=A.
% 0.08/0.30
% 0.08/0.30 ======= end of input processing =======
% 0.14/0.33
% 0.14/0.33 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.33
% 0.14/0.33 Stopped by limit on number of solutions
% 0.14/0.33
% 0.14/0.33
% 0.14/0.33 -------------- Softie stats --------------
% 0.14/0.33
% 0.14/0.33 UPDATE_STOP: 300
% 0.14/0.33 SFINDER_TIME_LIMIT: 2
% 0.14/0.33 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.33 number of clauses in intial UL: 0
% 0.14/0.33 number of clauses initially in problem: 34
% 0.14/0.33 percentage of clauses intially in UL: 0
% 0.14/0.33 percentage of distinct symbols occuring in initial UL: 0
% 0.14/0.33 percent of all initial clauses that are short: 100
% 0.14/0.33 absolute distinct symbol count: 9
% 0.14/0.33 distinct predicate count: 1
% 0.14/0.33 distinct function count: 4
% 0.14/0.33 distinct constant count: 4
% 0.14/0.33
% 0.14/0.33 ---------- no more Softie stats ----------
% 0.14/0.33
% 0.14/0.33
% 0.14/0.33
% 0.14/0.33 Model 2 (0.00 seconds, 0 Inserts)
% 0.14/0.33
% 0.14/0.33 Stopped by limit on number of solutions
% 0.14/0.33
% 0.14/0.33 =========== start of search ===========
% 0.76/0.93
% 0.76/0.93 -------- PROOF --------
% 0.76/0.93 % SZS status Unsatisfiable
% 0.76/0.93 % SZS output start Refutation
% 0.76/0.93
% 0.76/0.93 Model 3 (0.00 seconds, 0 Inserts)
% 0.76/0.93
% 0.76/0.93 Stopped by limit on number of solutions
% 0.76/0.93
% 0.76/0.93 Model 4 (0.00 seconds, 0 Inserts)
% 0.76/0.93
% 0.76/0.93 Stopped by limit on number of solutions
% 0.76/0.93
% 0.76/0.93 Model 5 (0.00 seconds, 0 Inserts)
% 0.76/0.93
% 0.76/0.93 Stopped by limit on number of solutions
% 0.76/0.93
% 0.76/0.93 Model 6 (0.00 seconds, 0 Inserts)
% 0.76/0.93
% 0.76/0.93 Stopped by limit on number of solutions
% 0.76/0.93
% 0.76/0.93 Stopped by limit on insertions
% 0.76/0.93
% 0.76/0.93 Model 7 [ 2 1 116 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.93
% 0.76/0.93 Stopped by limit on insertions
% 0.76/0.93
% 0.76/0.93 Model 8 [ 1 0 119 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.93
% 0.76/0.93 Stopped by limit on insertions
% 0.76/0.93
% 0.76/0.93 Model 9 [ 2 1 177 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.93
% 0.76/0.93 Model 10 (0.00 seconds, 250000 Inserts)
% 0.76/0.93
% 0.76/0.93 Stopped by limit on number of solutions
% 0.76/0.93
% 0.76/0.93 Model 11 (0.00 seconds, 250000 Inserts)
% 0.76/0.93
% 0.76/0.93 Stopped by limit on number of solutions
% 0.76/0.93
% 0.76/0.93 Stopped by limit on insertions
% 0.76/0.93
% 0.76/0.93 Model 12 [ 1 12 197907 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.93
% 0.76/0.93 Stopped by limit on insertions
% 0.76/0.93
% 0.76/0.93 Model 13 [ 1 8 136566 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.93
% 0.76/0.93 ----> UNIT CONFLICT at 0.61 sec ----> 91 [binary,89.1,88.1] {-} $F.
% 0.76/0.93
% 0.76/0.93 Length of proof is 8. Level of proof is 4.
% 0.76/0.93
% 0.76/0.93 ---------------- PROOF ----------------
% 0.76/0.93 % SZS status Unsatisfiable
% 0.76/0.93 % SZS output start Refutation
% 0.76/0.93
% 0.76/0.93 1 [] {-} least_upper_bound(least_upper_bound(a,b),c)!=c.
% 0.76/0.93 8 [] {+} greatest_lower_bound(A,B)=greatest_lower_bound(B,A).
% 0.76/0.93 9 [] {+} least_upper_bound(A,B)=least_upper_bound(B,A).
% 0.76/0.93 13 [] {-} least_upper_bound(A,least_upper_bound(B,C))=least_upper_bound(least_upper_bound(A,B),C).
% 0.76/0.93 15,14 [copy,13,flip.1] {-} least_upper_bound(least_upper_bound(A,B),C)=least_upper_bound(A,least_upper_bound(B,C)).
% 0.76/0.93 20 [] {+} least_upper_bound(A,greatest_lower_bound(A,B))=A.
% 0.76/0.93 32 [] {+} greatest_lower_bound(a,c)=a.
% 0.76/0.93 34 [] {+} greatest_lower_bound(b,c)=b.
% 0.76/0.93 37 [back_demod,1,demod,15] {-} least_upper_bound(a,least_upper_bound(b,c))!=c.
% 0.76/0.93 40 [para_into,8.1.1,34.1.1,flip.1] {+} greatest_lower_bound(c,b)=b.
% 0.76/0.93 42 [para_into,8.1.1,32.1.1,flip.1] {+} greatest_lower_bound(c,a)=a.
% 0.76/0.93 62,61 [para_from,40.1.1,20.1.1.2] {+} least_upper_bound(c,b)=c.
% 0.76/0.93 73 [para_into,37.1.1.2,9.1.1,demod,62] {+} least_upper_bound(a,c)!=c.
% 0.76/0.93 88 [para_into,73.1.1,9.1.1] {-} least_upper_bound(c,a)!=c.
% 0.76/0.93 89 [para_from,42.1.1,20.1.1.2] {-} least_upper_bound(c,a)=c.
% 0.76/0.93 91 [binary,89.1,88.1] {-} $F.
% 0.76/0.93
% 0.76/0.93 % SZS output end Refutation
% 0.76/0.93 ------------ end of proof -------------
% 0.76/0.93
% 0.76/0.93
% 0.76/0.93 Search stopped by max_proofs option.
% 0.76/0.93
% 0.76/0.93
% 0.76/0.93 Search stopped by max_proofs option.
% 0.76/0.93
% 0.76/0.93 ============ end of search ============
% 0.76/0.93
% 0.76/0.93 ----------- soft-scott stats ----------
% 0.76/0.93
% 0.76/0.93 true clauses given 2 (11.1%)
% 0.76/0.93 false clauses given 16
% 0.76/0.93
% 0.76/0.93 FALSE TRUE
% 0.76/0.93 5 1 1
% 0.76/0.93 7 1 4
% 0.76/0.93 8 1 0
% 0.76/0.93 9 1 4
% 0.76/0.93 11 8 2
% 0.76/0.93 13 6 2
% 0.76/0.93 tot: 18 13 (41.9% true)
% 0.76/0.93
% 0.76/0.93
% 0.76/0.93 Model 13 [ 1 8 136566 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.93
% 0.76/0.93 That finishes the proof of the theorem.
% 0.76/0.93
% 0.76/0.93 Process 30227 finished Mon Jun 13 23:52:26 2022
%------------------------------------------------------------------------------