%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP702-10 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n012.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:44:11 EDT 2022
% Result : Unsatisfiable 0.47s 0.66s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP702-10 : TPTP v8.1.0. Released v8.1.0.
% 0.12/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jun 13 18:44:40 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.37 ----- Otter 3.2, August 2001 -----
% 0.14/0.37 The process was started by sandbox2 on n012.cluster.edu,
% 0.14/0.37 Mon Jun 13 18:44:40 2022
% 0.14/0.37 The command was "./sos". The process ID is 17290.
% 0.14/0.37
% 0.14/0.37 set(prolog_style_variables).
% 0.14/0.37 set(auto).
% 0.14/0.37 dependent: set(auto1).
% 0.14/0.37 dependent: set(process_input).
% 0.14/0.37 dependent: clear(print_kept).
% 0.14/0.37 dependent: clear(print_new_demod).
% 0.14/0.37 dependent: clear(print_back_demod).
% 0.14/0.37 dependent: clear(print_back_sub).
% 0.14/0.37 dependent: set(control_memory).
% 0.14/0.37 dependent: assign(max_mem, 12000).
% 0.14/0.37 dependent: assign(pick_given_ratio, 4).
% 0.14/0.37 dependent: assign(stats_level, 1).
% 0.14/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.37 dependent: assign(sos_limit, 5000).
% 0.14/0.37 dependent: assign(max_weight, 60).
% 0.14/0.37 clear(print_given).
% 0.14/0.37
% 0.14/0.37 list(usable).
% 0.14/0.37
% 0.14/0.37 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.14/0.37
% 0.14/0.37 All clauses are units, and equality is present; the
% 0.14/0.37 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.14/0.37
% 0.14/0.37 dependent: set(knuth_bendix).
% 0.14/0.37 dependent: set(para_from).
% 0.14/0.37 dependent: set(para_into).
% 0.14/0.37 dependent: clear(para_from_right).
% 0.14/0.37 dependent: clear(para_into_right).
% 0.14/0.37 dependent: set(para_from_vars).
% 0.14/0.37 dependent: set(eq_units_both_ways).
% 0.14/0.37 dependent: set(dynamic_demod_all).
% 0.14/0.37 dependent: set(dynamic_demod).
% 0.14/0.37 dependent: set(order_eq).
% 0.14/0.37 dependent: set(back_demod).
% 0.14/0.37 dependent: set(lrpo).
% 0.14/0.37
% 0.14/0.37 ------------> process usable:
% 0.14/0.37
% 0.14/0.37 ------------> process sos:
% 0.14/0.37 Following clause subsumed by 36 during input processing: 0 [copy,36,flip.1] {-} A=A.
% 0.14/0.37
% 0.14/0.37 ======= end of input processing =======
% 0.14/0.40
% 0.14/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.40
% 0.14/0.40 Stopped by limit on number of solutions
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40 -------------- Softie stats --------------
% 0.14/0.40
% 0.14/0.40 UPDATE_STOP: 300
% 0.14/0.40 SFINDER_TIME_LIMIT: 2
% 0.14/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.40 number of clauses in intial UL: 1
% 0.14/0.40 number of clauses initially in problem: 28
% 0.14/0.40 percentage of clauses intially in UL: 3
% 0.14/0.40 percentage of distinct symbols occuring in initial UL: 45
% 0.14/0.40 percent of all initial clauses that are short: 100
% 0.14/0.40 absolute distinct symbol count: 11
% 0.14/0.40 distinct predicate count: 1
% 0.14/0.40 distinct function count: 3
% 0.14/0.40 distinct constant count: 7
% 0.14/0.40
% 0.14/0.40 ---------- no more Softie stats ----------
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.14/0.40
% 0.14/0.40 Stopped by limit on number of solutions
% 0.14/0.40
% 0.14/0.40 =========== start of search ===========
% 0.47/0.66
% 0.47/0.66 -------- PROOF --------
% 0.47/0.66 % SZS status Unsatisfiable
% 0.47/0.66 % SZS output start Refutation
% 0.47/0.66
% 0.47/0.66 Model 3 (0.00 seconds, 0 Inserts)
% 0.47/0.66
% 0.47/0.66 Stopped by limit on number of solutions
% 0.47/0.66
% 0.47/0.66 Stopped by limit on insertions
% 0.47/0.66
% 0.47/0.66 Model 4 [ 1 1 435 ] (0.00 seconds, 250000 Inserts)
% 0.47/0.66
% 0.47/0.66 Model 5 [ 2 1 30017 ] (0.00 seconds, 95833 Inserts)
% 0.47/0.66
% 0.47/0.66 Stopped by limit on insertions
% 0.47/0.66
% 0.47/0.66 Model 6 [ 2 1 52 ] (0.00 seconds, 250000 Inserts)
% 0.47/0.66
% 0.47/0.66 Model 7 [ 2 0 13282 ] (0.00 seconds, 80692 Inserts)
% 0.47/0.66
% 0.47/0.66 Model 8 [ 2 0 12265 ] (0.00 seconds, 24126 Inserts)
% 0.47/0.66
% 0.47/0.66 ----> UNIT CONFLICT at 0.27 sec ----> 76 [binary,75.1,36.1] {+} $F.
% 0.47/0.66
% 0.47/0.66 Length of proof is 6. Level of proof is 3.
% 0.47/0.66
% 0.47/0.66 ---------------- PROOF ----------------
% 0.47/0.66 % SZS status Unsatisfiable
% 0.47/0.66 % SZS output start Refutation
% 0.47/0.66
% 0.47/0.66 1 [] {-} mult(op_d,mult(x0,x1))!=mult(mult(op_d,x0),x1).
% 0.47/0.66 2 [copy,1,flip.1] {+} mult(mult(op_d,x0),x1)!=mult(op_d,mult(x0,x1)).
% 0.47/0.66 3 [] {+} mult(A,ld(A,B))=B.
% 0.47/0.66 11 [] {+} mult(A,unit)=A.
% 0.47/0.66 13 [] {+} mult(unit,A)=A.
% 0.47/0.66 18 [] {-} mult(op_c,mult(A,B))=mult(mult(op_c,A),B).
% 0.47/0.66 20,19 [copy,18,flip.1] {-} mult(mult(op_c,A),B)=mult(op_c,mult(A,B)).
% 0.47/0.66 27 [] {-} op_d=ld(A,mult(op_c,A)).
% 0.47/0.66 28 [copy,27,flip.1] {-} ld(A,mult(op_c,A))=op_d.
% 0.47/0.66 36 [] {+} A=A.
% 0.47/0.66 38,37 [para_into,13.1.1,3.1.1,flip.1] {+} ld(unit,A)=A.
% 0.47/0.66 70,69 [para_into,28.1.1.2,11.1.1,demod,38,flip.1] {-} op_d=op_c.
% 0.47/0.66 75 [back_demod,2,demod,70,20,70] {-} mult(op_c,mult(x0,x1))!=mult(op_c,mult(x0,x1)).
% 0.47/0.66 76 [binary,75.1,36.1] {+} $F.
% 0.47/0.66
% 0.47/0.66 % SZS output end Refutation
% 0.47/0.66 ------------ end of proof -------------
% 0.47/0.66
% 0.47/0.66
% 0.47/0.66 Search stopped by max_proofs option.
% 0.47/0.66
% 0.47/0.66
% 0.47/0.66 Search stopped by max_proofs option.
% 0.47/0.66
% 0.47/0.66 ============ end of search ============
% 0.47/0.66
% 0.47/0.66 ----------- soft-scott stats ----------
% 0.47/0.66
% 0.47/0.66 true clauses given 3 (25.0%)
% 0.47/0.66 false clauses given 9
% 0.47/0.66
% 0.47/0.66 FALSE TRUE
% 0.47/0.66 5 0 1
% 0.47/0.66 7 2 0
% 0.47/0.66 11 6 1
% 0.47/0.66 15 5 0
% 0.47/0.66 19 2 0
% 0.47/0.66 23 1 0
% 0.47/0.66 tot: 16 2 (11.1% true)
% 0.47/0.66
% 0.47/0.66
% 0.47/0.66 Model 8 [ 2 0 12265 ] (0.00 seconds, 24126 Inserts)
% 0.47/0.66
% 0.47/0.66 That finishes the proof of the theorem.
% 0.47/0.66
% 0.47/0.66 Process 17290 finished Mon Jun 13 18:44:41 2022
%------------------------------------------------------------------------------