TSTP Solution File: ROB009-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : ROB009-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n032.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.12s 0.32s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.08 % Problem : ROB009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.09 % Command : sos-script %s
% 0.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 600
% 0.08/0.28 % DateTime : Thu Jun 9 14:32:07 EDT 2022
% 0.08/0.28 % CPUTime :
% 0.08/0.29 ----- Otter 3.2, August 2001 -----
% 0.08/0.29 The process was started by sandbox on n032.cluster.edu,
% 0.08/0.29 Thu Jun 9 14:32:07 2022
% 0.08/0.29 The command was "./sos". The process ID is 32671.
% 0.08/0.29
% 0.08/0.29 set(prolog_style_variables).
% 0.08/0.29 set(auto).
% 0.08/0.29 dependent: set(auto1).
% 0.08/0.29 dependent: set(process_input).
% 0.08/0.29 dependent: clear(print_kept).
% 0.08/0.29 dependent: clear(print_new_demod).
% 0.08/0.29 dependent: clear(print_back_demod).
% 0.08/0.29 dependent: clear(print_back_sub).
% 0.08/0.29 dependent: set(control_memory).
% 0.08/0.29 dependent: assign(max_mem, 12000).
% 0.08/0.29 dependent: assign(pick_given_ratio, 4).
% 0.08/0.29 dependent: assign(stats_level, 1).
% 0.08/0.29 dependent: assign(pick_semantic_ratio, 3).
% 0.08/0.29 dependent: assign(sos_limit, 5000).
% 0.08/0.29 dependent: assign(max_weight, 60).
% 0.08/0.29 clear(print_given).
% 0.08/0.29
% 0.08/0.29 list(usable).
% 0.08/0.29
% 0.08/0.29 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.08/0.29
% 0.08/0.29 All clauses are units, and equality is present; the
% 0.08/0.29 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.08/0.29
% 0.08/0.29 dependent: set(knuth_bendix).
% 0.08/0.29 dependent: set(para_from).
% 0.08/0.29 dependent: set(para_into).
% 0.08/0.29 dependent: clear(para_from_right).
% 0.08/0.29 dependent: clear(para_into_right).
% 0.08/0.29 dependent: set(para_from_vars).
% 0.08/0.29 dependent: set(eq_units_both_ways).
% 0.08/0.29 dependent: set(dynamic_demod_all).
% 0.08/0.29 dependent: set(dynamic_demod).
% 0.08/0.29 dependent: set(order_eq).
% 0.08/0.29 dependent: set(back_demod).
% 0.08/0.29 dependent: set(lrpo).
% 0.08/0.29
% 0.08/0.29 ------------> process usable:
% 0.08/0.29
% 0.08/0.29 ------------> process sos:
% 0.08/0.29 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] {-} add(A,B)=add(B,A).
% 0.08/0.29 Following clause subsumed by 10 during input processing: 0 [copy,10,flip.1] {-} A=A.
% 0.08/0.29
% 0.08/0.29 ======= end of input processing =======
% 0.12/0.32
% 0.12/0.32 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.32
% 0.12/0.32 Stopped by limit on number of solutions
% 0.12/0.32
% 0.12/0.32
% 0.12/0.32 -------------- Softie stats --------------
% 0.12/0.32
% 0.12/0.32 UPDATE_STOP: 300
% 0.12/0.32 SFINDER_TIME_LIMIT: 2
% 0.12/0.32 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.32 number of clauses in intial UL: 1
% 0.12/0.32 number of clauses initially in problem: 9
% 0.12/0.32 percentage of clauses intially in UL: 11
% 0.12/0.32 percentage of distinct symbols occuring in initial UL: 50
% 0.12/0.32 percent of all initial clauses that are short: 100
% 0.12/0.32 absolute distinct symbol count: 6
% 0.12/0.32 distinct predicate count: 1
% 0.12/0.32 distinct function count: 2
% 0.12/0.32 distinct constant count: 3
% 0.12/0.32
% 0.12/0.32 ---------- no more Softie stats ----------
% 0.12/0.32
% 0.12/0.32
% 0.12/0.32
% 0.12/0.32 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.32
% 0.12/0.32 Stopped by limit on number of solutions
% 0.12/0.32
% 0.12/0.32 =========== start of search ===========
% 0.12/0.32
% 0.12/0.32 -------- PROOF --------
% 0.12/0.32 % SZS status Unsatisfiable
% 0.12/0.32 % SZS output start Refutation
% 0.12/0.32
% 0.12/0.32 ----> UNIT CONFLICT at 0.01 sec ----> 100 [binary,98.1,2.1] {-} $F.
% 0.12/0.32
% 0.12/0.32 Length of proof is 6. Level of proof is 4.
% 0.12/0.32
% 0.12/0.32 ---------------- PROOF ----------------
% 0.12/0.32 % SZS status Unsatisfiable
% 0.12/0.32 % SZS output start Refutation
% 0.12/0.32
% 0.12/0.32 1 [] {-} a!=b.
% 0.12/0.32 2 [copy,1,flip.1] {+} b!=a.
% 0.12/0.32 3 [] {+} add(A,B)=add(B,A).
% 0.12/0.32 5,4 [] {-} add(add(A,B),C)=add(A,add(B,C)).
% 0.12/0.32 6 [] {-} negate(add(negate(add(A,B)),negate(add(A,negate(B)))))=A.
% 0.12/0.32 8 [] {-} negate(add(a,negate(add(b,c))))=negate(add(b,negate(add(a,c)))).
% 0.12/0.32 11 [para_into,4.1.1.1,3.1.1,demod,5] {-} add(A,add(B,C))=add(B,add(A,C)).
% 0.12/0.32 16 [para_into,11.1.1,3.1.1,demod,5] {+} add(A,add(B,C))=add(A,add(C,B)).
% 0.12/0.32 30 [para_into,6.1.1.1.1.1,3.1.1] {-} negate(add(negate(add(A,B)),negate(add(B,negate(A)))))=B.
% 0.12/0.32 61,60 [para_from,16.1.1,6.1.1.1.1.1] {-} negate(add(negate(add(A,add(B,C))),negate(add(A,negate(add(C,B))))))=A.
% 0.12/0.32 98 [para_from,8.1.1,30.1.1.1.2,demod,5,61] {-} b=a.
% 0.12/0.32 100 [binary,98.1,2.1] {-} $F.
% 0.12/0.32
% 0.12/0.32 % SZS output end Refutation
% 0.12/0.32 ------------ end of proof -------------
% 0.12/0.32
% 0.12/0.32
% 0.12/0.32 Search stopped by max_proofs option.
% 0.12/0.32
% 0.12/0.32
% 0.12/0.32 Search stopped by max_proofs option.
% 0.12/0.32
% 0.12/0.32 ============ end of search ============
% 0.12/0.32
% 0.12/0.32 ----------- soft-scott stats ----------
% 0.12/0.32
% 0.12/0.32 true clauses given 2 (18.2%)
% 0.12/0.32 false clauses given 9
% 0.12/0.32
% 0.12/0.32 FALSE TRUE
% 0.12/0.32 13 4 0
% 0.12/0.32 15 21 1
% 0.12/0.32 17 5 0
% 0.12/0.32 18 4 0
% 0.12/0.32 19 6 0
% 0.12/0.32 20 2 0
% 0.12/0.32 21 6 0
% 0.12/0.32 tot: 48 1 (2.0% true)
% 0.12/0.32
% 0.12/0.32
% 0.12/0.32 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.32
% 0.12/0.32 That finishes the proof of the theorem.
% 0.12/0.32
% 0.12/0.32 Process 32671 finished Thu Jun 9 14:32:07 2022
%------------------------------------------------------------------------------