TSTP Solution File: ROB002-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : ROB002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n017.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:04 EDT 2022
% Result : Unsatisfiable 0.18s 0.39s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : ROB002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n017.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 15:27:34 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 n017.cluster.edu,
% 0.12/0.35 Thu Jun 9 15:27:34 2022
% 0.12/0.35 The command was "./sos". The process ID is 27047.
% 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=1.
% 0.12/0.35
% 0.12/0.35 All clauses are units, and equality is present; the
% 0.12/0.35 strategy will be Knuth-Bendix with positive clauses in sos.
% 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
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] {-} add(A,B)=add(B,A).
% 0.12/0.35 Following clause subsumed by 9 during input processing: 0 [copy,9,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: 1
% 0.12/0.38 number of clauses initially in problem: 9
% 0.12/0.38 percentage of clauses intially in UL: 11
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 5
% 0.12/0.38 distinct predicate count: 1
% 0.12/0.38 distinct function count: 2
% 0.12/0.38 distinct constant count: 2
% 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.39
% 0.18/0.39 -------- PROOF --------
% 0.18/0.39 % SZS status Unsatisfiable
% 0.18/0.39 % SZS output start Refutation
% 0.18/0.39
% 0.18/0.39 Model 3 (0.00 seconds, 0 Inserts)
% 0.18/0.39
% 0.18/0.39 Stopped by limit on number of solutions
% 0.18/0.39
% 0.18/0.39 ----> UNIT CONFLICT at 0.02 sec ----> 77 [binary,76.1,9.1] {-} $F.
% 0.18/0.39
% 0.18/0.39 Length of proof is 4. Level of proof is 3.
% 0.18/0.39
% 0.18/0.39 ---------------- PROOF ----------------
% 0.18/0.39 % SZS status Unsatisfiable
% 0.18/0.39 % SZS output start Refutation
% 0.18/0.39
% 0.18/0.39 1 [] {+} add(negate(add(a,negate(b))),negate(add(negate(a),negate(b))))!=b.
% 0.18/0.39 2 [] {+} add(A,B)=add(B,A).
% 0.18/0.39 5 [] {-} negate(add(negate(add(A,B)),negate(add(A,negate(B)))))=A.
% 0.18/0.39 8,7 [] {+} negate(negate(A))=A.
% 0.18/0.39 9 [] {+} A=A.
% 0.18/0.39 11 [para_from,2.1.1,1.1.1.2.1] {+} add(negate(add(a,negate(b))),negate(add(negate(b),negate(a))))!=b.
% 0.18/0.39 23 [para_into,5.1.1.1.1.1,2.1.1] {-} negate(add(negate(add(A,B)),negate(add(B,negate(A)))))=B.
% 0.18/0.39 75,74 [para_from,23.1.1,7.1.1.1,flip.1] {-} add(negate(add(A,B)),negate(add(B,negate(A))))=negate(B).
% 0.18/0.39 76 [back_demod,11,demod,75,8] {-} b!=b.
% 0.18/0.39 77 [binary,76.1,9.1] {-} $F.
% 0.18/0.39
% 0.18/0.39 % SZS output end Refutation
% 0.18/0.39 ------------ end of proof -------------
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 Search stopped by max_proofs option.
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 Search stopped by max_proofs option.
% 0.18/0.39
% 0.18/0.39 ============ end of search ============
% 0.18/0.39
% 0.18/0.39 ----------- soft-scott stats ----------
% 0.18/0.39
% 0.18/0.39 true clauses given 1 (10.0%)
% 0.18/0.39 false clauses given 9
% 0.18/0.39
% 0.18/0.39 FALSE TRUE
% 0.18/0.39 11 0 1
% 0.18/0.39 13 3 0
% 0.18/0.39 14 0 3
% 0.18/0.39 15 16 0
% 0.18/0.39 17 1 0
% 0.18/0.39 18 2 0
% 0.18/0.39 19 1 0
% 0.18/0.39 21 1 0
% 0.18/0.39 tot: 24 4 (14.3% true)
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 Model 3 (0.00 seconds, 0 Inserts)
% 0.18/0.39
% 0.18/0.39 That finishes the proof of the theorem.
% 0.18/0.39
% 0.18/0.39 Process 27047 finished Thu Jun 9 15:27:34 2022
%------------------------------------------------------------------------------