%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP154-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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 11:41:57 EDT 2022
% Result : Unsatisfiable 0.45s 0.67s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP154-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 09:29:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox2 on n026.cluster.edu,
% 0.13/0.36 Mon Jun 13 09:29:36 2022
% 0.13/0.36 The command was "./sos". The process ID is 12315.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.13/0.36
% 0.13/0.36 All clauses are units, and equality is present; the
% 0.13/0.36 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] {-} greatest_lower_bound(A,B)=greatest_lower_bound(B,A).
% 0.13/0.36 Following clause subsumed by 9 during input processing: 0 [copy,9,flip.1] {-} least_upper_bound(A,B)=least_upper_bound(B,A).
% 0.13/0.36 Following clause subsumed by 34 during input processing: 0 [copy,34,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.19/0.40
% 0.19/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 -------------- Softie stats --------------
% 0.19/0.40
% 0.19/0.40 UPDATE_STOP: 300
% 0.19/0.40 SFINDER_TIME_LIMIT: 2
% 0.19/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.40 number of clauses in intial UL: 1
% 0.19/0.40 number of clauses initially in problem: 32
% 0.19/0.40 percentage of clauses intially in UL: 3
% 0.19/0.40 percentage of distinct symbols occuring in initial UL: 66
% 0.19/0.40 percent of all initial clauses that are short: 100
% 0.19/0.40 absolute distinct symbol count: 9
% 0.19/0.40 distinct predicate count: 1
% 0.19/0.40 distinct function count: 4
% 0.19/0.40 distinct constant count: 4
% 0.19/0.40
% 0.19/0.40 ---------- no more Softie stats ----------
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40 =========== start of search ===========
% 0.45/0.67
% 0.45/0.67 -------- PROOF --------
% 0.45/0.67 % SZS status Unsatisfiable
% 0.45/0.67 % SZS output start Refutation
% 0.45/0.67
% 0.45/0.67 Model 3 (0.00 seconds, 0 Inserts)
% 0.45/0.67
% 0.45/0.67 Stopped by limit on number of solutions
% 0.45/0.67
% 0.45/0.67 Model 4 (0.00 seconds, 0 Inserts)
% 0.45/0.67
% 0.45/0.67 Stopped by limit on number of solutions
% 0.45/0.67
% 0.45/0.67 Stopped by limit on insertions
% 0.45/0.67
% 0.45/0.67 Model 5 [ 3 1 124 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.67
% 0.45/0.67 Stopped by limit on insertions
% 0.45/0.67
% 0.45/0.67 Model 6 [ 2 0 157 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.67
% 0.45/0.67 Stopped by limit on insertions
% 0.45/0.67
% 0.45/0.67 Model 7 [ 1 0 178 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.67
% 0.45/0.67 Stopped by limit on insertions
% 0.45/0.67
% 0.45/0.67 Model 8 [ 1 0 115 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.67
% 0.45/0.67 Stopped by limit on insertions
% 0.45/0.67
% 0.45/0.67 Model 9 [ 1 4 216807 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.67
% 0.45/0.67 Model 10 (0.00 seconds, 250000 Inserts)
% 0.45/0.67
% 0.45/0.67 Stopped by limit on number of solutions
% 0.45/0.67
% 0.45/0.67 ----> UNIT CONFLICT at 0.28 sec ----> 108 [binary,106.1,37.1] {-} $F.
% 0.45/0.67
% 0.45/0.67 Length of proof is 3. Level of proof is 2.
% 0.45/0.67
% 0.45/0.67 ---------------- PROOF ----------------
% 0.45/0.67 % SZS status Unsatisfiable
% 0.45/0.67 % SZS output start Refutation
% 0.45/0.67
% 0.45/0.67 1 [] {+} least_upper_bound(multiply(a,c),multiply(b,c))!=multiply(b,c).
% 0.45/0.67 9 [] {+} least_upper_bound(A,B)=least_upper_bound(B,A).
% 0.45/0.67 28 [] {-} multiply(least_upper_bound(A,B),C)=least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.45/0.67 32 [] {+} least_upper_bound(a,b)=b.
% 0.45/0.67 37 [para_from,9.1.1,1.1.1] {+} least_upper_bound(multiply(b,c),multiply(a,c))!=multiply(b,c).
% 0.45/0.67 38 [para_into,32.1.1,9.1.1] {+} least_upper_bound(b,a)=b.
% 0.45/0.67 106 [para_into,28.1.1.1,38.1.1,flip.1] {-} least_upper_bound(multiply(b,A),multiply(a,A))=multiply(b,A).
% 0.45/0.67 108 [binary,106.1,37.1] {-} $F.
% 0.45/0.67
% 0.45/0.67 % SZS output end Refutation
% 0.45/0.67 ------------ end of proof -------------
% 0.45/0.67
% 0.45/0.67
% 0.45/0.67 Search stopped by max_proofs option.
% 0.45/0.67
% 0.45/0.67
% 0.45/0.67 Search stopped by max_proofs option.
% 0.45/0.67
% 0.45/0.67 ============ end of search ============
% 0.45/0.67
% 0.45/0.67 ----------- soft-scott stats ----------
% 0.45/0.67
% 0.45/0.67 true clauses given 5 (25.0%)
% 0.45/0.67 false clauses given 15
% 0.45/0.67
% 0.45/0.67 FALSE TRUE
% 0.45/0.67 4 0 1
% 0.45/0.67 6 0 1
% 0.45/0.67 7 0 3
% 0.45/0.67 8 0 2
% 0.45/0.67 9 0 5
% 0.45/0.67 11 0 12
% 0.45/0.67 12 0 1
% 0.45/0.67 13 1 2
% 0.45/0.67 15 4 0
% 0.45/0.67 17 2 0
% 0.45/0.67 tot: 7 27 (79.4% true)
% 0.45/0.67
% 0.45/0.67
% 0.45/0.67 Model 10 (0.00 seconds, 250000 Inserts)
% 0.45/0.67
% 0.45/0.67 That finishes the proof of the theorem.
% 0.45/0.67
% 0.45/0.67 Process 12315 finished Mon Jun 13 09:29:36 2022
%------------------------------------------------------------------------------