TSTP Solution File: ROB011-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : ROB011-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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 : Mon Jul 18 20:56:06 EDT 2022
% Result : Unsatisfiable 0.18s 0.49s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ROB011-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n027.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 : Thu Jun 9 16:19:58 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 n027.cluster.edu,
% 0.12/0.35 Thu Jun 9 16:19:58 2022
% 0.12/0.35 The command was "./sos". The process ID is 27397.
% 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 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 0.12/0.35
% 0.12/0.35 This is a Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix and hyper_res, with positive clauses in
% 0.12/0.35 sos and nonpositive 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: clear(order_hyper).
% 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 4 during input processing: 0 [copy,4,flip.1] {-} add(A,B)=add(B,A).
% 0.12/0.35 Following clause subsumed by 14 during input processing: 0 [copy,14,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.38
% 0.12/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 -------------- Softie stats --------------
% 0.12/0.38
% 0.12/0.38 UPDATE_STOP: 300
% 0.12/0.38 SFINDER_TIME_LIMIT: 2
% 0.12/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38 number of clauses in intial UL: 2
% 0.12/0.38 number of clauses initially in problem: 14
% 0.12/0.38 percentage of clauses intially in UL: 14
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 50
% 0.12/0.38 percent of all initial clauses that are short: 92
% 0.12/0.38 absolute distinct symbol count: 10
% 0.12/0.38 distinct predicate count: 2
% 0.12/0.38 distinct function count: 4
% 0.12/0.38 distinct constant count: 4
% 0.12/0.38
% 0.12/0.38 ---------- no more Softie stats ----------
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38 =========== start of search ===========
% 0.18/0.49
% 0.18/0.49 -------- PROOF --------
% 0.18/0.49 % SZS status Unsatisfiable
% 0.18/0.49 % SZS output start Refutation
% 0.18/0.49
% 0.18/0.49 Model 3 (0.00 seconds, 0 Inserts)
% 0.18/0.49
% 0.18/0.49 Stopped by limit on number of solutions
% 0.18/0.49
% 0.18/0.49 ----> UNIT CONFLICT at 0.11 sec ----> 1416 [binary,1414.1,171.1] {-} $F.
% 0.18/0.49
% 0.18/0.49 Length of proof is 8. Level of proof is 4.
% 0.18/0.49
% 0.18/0.49 ---------------- PROOF ----------------
% 0.18/0.49 % SZS status Unsatisfiable
% 0.18/0.49 % SZS output start Refutation
% 0.18/0.49
% 0.18/0.49 3 [] {-} negate(add(a,negate(add(b,multiply(one,add(a,c))))))!=c.
% 0.18/0.49 4 [] {+} add(A,B)=add(B,A).
% 0.18/0.49 6,5 [] {-} add(add(A,B),C)=add(A,add(B,C)).
% 0.18/0.49 7 [] {-} negate(add(negate(add(A,B)),negate(add(A,negate(B)))))=A.
% 0.18/0.49 10,9 [] {+} multiply(one,A)=A.
% 0.18/0.49 12 [] {-} negate(add(a,negate(b)))=c.
% 0.18/0.49 15 [back_demod,3,demod,10] {+} negate(add(a,negate(add(b,add(a,c)))))!=c.
% 0.18/0.49 21 [para_into,5.1.1.1,4.1.1,demod,6] {-} add(A,add(B,C))=add(B,add(A,C)).
% 0.18/0.49 46 [para_into,7.1.1.1.1.1,4.1.1] {-} negate(add(negate(add(A,B)),negate(add(B,negate(A)))))=B.
% 0.18/0.49 62 [para_into,7.1.1.1.2,12.1.1] {+} negate(add(negate(add(a,b)),c))=a.
% 0.18/0.49 97 [para_into,46.1.1.1.2.1,4.1.1] {-} negate(add(negate(add(A,B)),negate(add(negate(A),B))))=B.
% 0.18/0.49 171 [para_into,15.1.1.1.2.1,21.1.1] {+} negate(add(a,negate(add(a,add(b,c)))))!=c.
% 0.18/0.49 268 [para_into,97.1.1.1,4.1.1] {-} negate(add(negate(add(negate(A),B)),negate(add(A,B))))=B.
% 0.18/0.49 1414 [para_from,62.1.1,268.1.1.1.1,demod,6] {-} negate(add(a,negate(add(a,add(b,c)))))=c.
% 0.18/0.49 1416 [binary,1414.1,171.1] {-} $F.
% 0.18/0.49
% 0.18/0.49 % SZS output end Refutation
% 0.18/0.49 ------------ end of proof -------------
% 0.18/0.49
% 0.18/0.49
% 0.18/0.49 Search stopped by max_proofs option.
% 0.18/0.49
% 0.18/0.49
% 0.18/0.49 Search stopped by max_proofs option.
% 0.18/0.49
% 0.18/0.49 ============ end of search ============
% 0.18/0.49
% 0.18/0.49 ----------- soft-scott stats ----------
% 0.18/0.49
% 0.18/0.49 true clauses given 12 (26.7%)
% 0.18/0.49 false clauses given 33
% 0.18/0.49
% 0.18/0.49 FALSE TRUE
% 0.18/0.49 9 0 4
% 0.18/0.49 11 0 10
% 0.18/0.49 12 0 4
% 0.18/0.49 13 0 1
% 0.18/0.49 15 24 1
% 0.18/0.49 16 0 1
% 0.18/0.49 17 19 0
% 0.18/0.49 18 20 0
% 0.18/0.49 19 155 2
% 0.18/0.49 20 16 8
% 0.18/0.49 21 148 0
% 0.18/0.49 22 0 9
% 0.18/0.49 23 289 0
% 0.18/0.49 24 5 0
% 0.18/0.49 25 139 1
% 0.18/0.49 26 4 0
% 0.18/0.49 27 4 0
% 0.18/0.49 28 0 1
% 0.18/0.49 tot: 823 42 (4.9% true)
% 0.18/0.49
% 0.18/0.49
% 0.18/0.49 Model 3 (0.00 seconds, 0 Inserts)
% 0.18/0.49
% 0.18/0.49 That finishes the proof of the theorem.
% 0.18/0.49
% 0.18/0.49 Process 27397 finished Thu Jun 9 16:19:58 2022
%------------------------------------------------------------------------------