TSTP Solution File: BOO010-4 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : BOO010-4 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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 : Thu Jul 14 23:49:13 EDT 2022
% Result : Unsatisfiable 0.20s 0.49s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : BOO010-4 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 2 00:22:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n020.cluster.edu,
% 0.12/0.36 Thu Jun 2 00:22:23 2022
% 0.12/0.36 The command was "./sos". The process ID is 14057.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.12/0.36
% 0.12/0.36 All clauses are units, and equality is present; the
% 0.12/0.36 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] {-} add(A,B)=add(B,A).
% 0.12/0.36 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] {-} multiply(A,B)=multiply(B,A).
% 0.12/0.36 Following clause subsumed by 17 during input processing: 0 [copy,17,flip.1] {-} A=A.
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.12/0.40
% 0.12/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.40
% 0.12/0.40 Stopped by limit on number of solutions
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 -------------- Softie stats --------------
% 0.12/0.40
% 0.12/0.40 UPDATE_STOP: 300
% 0.12/0.40 SFINDER_TIME_LIMIT: 2
% 0.12/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.40 number of clauses in intial UL: 1
% 0.12/0.40 number of clauses initially in problem: 16
% 0.12/0.40 percentage of clauses intially in UL: 6
% 0.12/0.40 percentage of distinct symbols occuring in initial UL: 62
% 0.12/0.40 percent of all initial clauses that are short: 100
% 0.12/0.40 absolute distinct symbol count: 8
% 0.12/0.40 distinct predicate count: 1
% 0.12/0.40 distinct function count: 3
% 0.12/0.40 distinct constant count: 4
% 0.12/0.40
% 0.12/0.40 ---------- no more Softie stats ----------
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.40
% 0.12/0.40 Stopped by limit on number of solutions
% 0.12/0.40
% 0.12/0.40 =========== start of search ===========
% 0.20/0.49
% 0.20/0.49 -------- PROOF --------
% 0.20/0.49 % SZS status Unsatisfiable
% 0.20/0.49 % SZS output start Refutation
% 0.20/0.49
% 0.20/0.49 Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.49
% 0.20/0.49 Stopped by limit on number of solutions
% 0.20/0.49
% 0.20/0.49 Model 4 (0.00 seconds, 0 Inserts)
% 0.20/0.49
% 0.20/0.49 Stopped by limit on number of solutions
% 0.20/0.49
% 0.20/0.49 Model 5 (0.00 seconds, 0 Inserts)
% 0.20/0.49
% 0.20/0.49 Stopped by limit on number of solutions
% 0.20/0.49
% 0.20/0.49 Model 6 (0.00 seconds, 0 Inserts)
% 0.20/0.49
% 0.20/0.49 Stopped by limit on number of solutions
% 0.20/0.49
% 0.20/0.49 Model 7 (0.00 seconds, 0 Inserts)
% 0.20/0.49
% 0.20/0.49 Stopped by limit on number of solutions
% 0.20/0.49
% 0.20/0.49 Model 8 (0.00 seconds, 0 Inserts)
% 0.20/0.49
% 0.20/0.49 Stopped by limit on number of solutions
% 0.20/0.49
% 0.20/0.49 Model 9 (0.00 seconds, 0 Inserts)
% 0.20/0.49
% 0.20/0.49 Stopped by limit on number of solutions
% 0.20/0.49
% 0.20/0.49 Model 10 [ 1 0 1359 ] (0.00 seconds, 20080 Inserts)
% 0.20/0.49
% 0.20/0.49 ----> UNIT CONFLICT at 0.10 sec ----> 117 [binary,115.1,20.1] {-} $F.
% 0.20/0.49
% 0.20/0.49 Length of proof is 7. Level of proof is 5.
% 0.20/0.49
% 0.20/0.49 ---------------- PROOF ----------------
% 0.20/0.49 % SZS status Unsatisfiable
% 0.20/0.49 % SZS output start Refutation
% 0.20/0.49
% 0.20/0.49 1 [] {+} add(a,multiply(a,b))!=a.
% 0.20/0.49 2 [] {+} add(A,B)=add(B,A).
% 0.20/0.49 3 [] {+} multiply(A,B)=multiply(B,A).
% 0.20/0.49 4 [] {-} add(A,multiply(B,C))=multiply(add(A,B),add(A,C)).
% 0.20/0.49 5 [copy,4,flip.1] {-} multiply(add(A,B),add(A,C))=add(A,multiply(B,C)).
% 0.20/0.49 8,7 [] {-} multiply(A,add(B,C))=add(multiply(A,B),multiply(A,C)).
% 0.20/0.49 12,11 [] {+} multiply(A,multiplicative_identity)=A.
% 0.20/0.49 14,13 [] {+} add(A,inverse(A))=multiplicative_identity.
% 0.20/0.49 18 [back_demod,5,demod,8] {-} add(multiply(add(A,B),A),multiply(add(A,B),C))=add(A,multiply(B,C)).
% 0.20/0.49 20 [para_from,2.1.1,1.1.1] {+} add(multiply(a,b),a)!=a.
% 0.20/0.49 26,25 [para_into,3.1.1,11.1.1,flip.1] {+} multiply(multiplicative_identity,A)=A.
% 0.20/0.49 60 [para_into,18.1.1.1.1,13.1.1,demod,26,14,26,flip.1] {-} add(A,multiply(inverse(A),B))=add(A,B).
% 0.20/0.49 102 [para_into,60.1.1.2,11.1.1,demod,14,flip.1] {+} add(A,multiplicative_identity)=multiplicative_identity.
% 0.20/0.49 115 [para_from,102.1.1,7.1.1.2,demod,12,12,flip.1] {-} add(multiply(A,B),A)=A.
% 0.20/0.49 117 [binary,115.1,20.1] {-} $F.
% 0.20/0.49
% 0.20/0.49 % SZS output end Refutation
% 0.20/0.49 ------------ end of proof -------------
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49 Search stopped by max_proofs option.
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49 Search stopped by max_proofs option.
% 0.20/0.49
% 0.20/0.49 ============ end of search ============
% 0.20/0.49
% 0.20/0.49 ----------- soft-scott stats ----------
% 0.20/0.49
% 0.20/0.49 true clauses given 4 (23.5%)
% 0.20/0.49 false clauses given 13
% 0.20/0.49
% 0.20/0.49 FALSE TRUE
% 0.20/0.49 5 0 1
% 0.20/0.49 6 1 1
% 0.20/0.49 7 1 5
% 0.20/0.49 8 0 1
% 0.20/0.49 10 3 2
% 0.20/0.49 11 3 2
% 0.20/0.49 13 3 2
% 0.20/0.49 14 1 1
% 0.20/0.49 15 0 1
% 0.20/0.49 16 2 0
% 0.20/0.49 17 4 1
% 0.20/0.49 18 1 0
% 0.20/0.49 19 2 0
% 0.20/0.49 20 1 0
% 0.20/0.49 25 1 0
% 0.20/0.49 27 1 0
% 0.20/0.49 31 1 0
% 0.20/0.49 33 1 0
% 0.20/0.49 tot: 26 17 (39.5% true)
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49 Model 10 [ 1 0 1359 ] (0.00 seconds, 20080 Inserts)
% 0.20/0.49
% 0.20/0.49 That finishes the proof of the theorem.
% 0.20/0.49
% 0.20/0.49 Process 14057 finished Thu Jun 2 00:22:23 2022
%------------------------------------------------------------------------------