TSTP Solution File: BOO006-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : BOO006-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n022.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:12 EDT 2022
% Result : Unsatisfiable 0.45s 0.63s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : BOO006-2 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n022.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 : Wed Jun 1 20:40:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.35 ----- Otter 3.2, August 2001 -----
% 0.18/0.35 The process was started by sandbox on n022.cluster.edu,
% 0.18/0.35 Wed Jun 1 20:40:37 2022
% 0.18/0.35 The command was "./sos". The process ID is 19849.
% 0.18/0.35
% 0.18/0.35 set(prolog_style_variables).
% 0.18/0.35 set(auto).
% 0.18/0.35 dependent: set(auto1).
% 0.18/0.35 dependent: set(process_input).
% 0.18/0.35 dependent: clear(print_kept).
% 0.18/0.35 dependent: clear(print_new_demod).
% 0.18/0.35 dependent: clear(print_back_demod).
% 0.18/0.35 dependent: clear(print_back_sub).
% 0.18/0.35 dependent: set(control_memory).
% 0.18/0.35 dependent: assign(max_mem, 12000).
% 0.18/0.35 dependent: assign(pick_given_ratio, 4).
% 0.18/0.35 dependent: assign(stats_level, 1).
% 0.18/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.35 dependent: assign(sos_limit, 5000).
% 0.18/0.35 dependent: assign(max_weight, 60).
% 0.18/0.35 clear(print_given).
% 0.18/0.35
% 0.18/0.35 list(usable).
% 0.18/0.35
% 0.18/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.18/0.35
% 0.18/0.35 All clauses are units, and equality is present; the
% 0.18/0.35 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.18/0.35
% 0.18/0.35 dependent: set(knuth_bendix).
% 0.18/0.35 dependent: set(para_from).
% 0.18/0.35 dependent: set(para_into).
% 0.18/0.35 dependent: clear(para_from_right).
% 0.18/0.35 dependent: clear(para_into_right).
% 0.18/0.35 dependent: set(para_from_vars).
% 0.18/0.35 dependent: set(eq_units_both_ways).
% 0.18/0.35 dependent: set(dynamic_demod_all).
% 0.18/0.35 dependent: set(dynamic_demod).
% 0.18/0.35 dependent: set(order_eq).
% 0.18/0.35 dependent: set(back_demod).
% 0.18/0.35 dependent: set(lrpo).
% 0.18/0.35
% 0.18/0.35 ------------> process usable:
% 0.18/0.35
% 0.18/0.35 ------------> process sos:
% 0.18/0.35 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] {-} add(A,B)=add(B,A).
% 0.18/0.35 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] {-} multiply(A,B)=multiply(B,A).
% 0.18/0.35 Following clause subsumed by 30 during input processing: 0 [copy,30,flip.1] {-} A=A.
% 0.18/0.35
% 0.18/0.35 ======= end of input processing =======
% 0.18/0.39
% 0.18/0.39 Model 1 (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
% 0.18/0.39 -------------- Softie stats --------------
% 0.18/0.39
% 0.18/0.39 UPDATE_STOP: 300
% 0.18/0.39 SFINDER_TIME_LIMIT: 2
% 0.18/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.39 number of clauses in intial UL: 1
% 0.18/0.39 number of clauses initially in problem: 28
% 0.18/0.39 percentage of clauses intially in UL: 3
% 0.18/0.39 percentage of distinct symbols occuring in initial UL: 57
% 0.18/0.39 percent of all initial clauses that are short: 100
% 0.18/0.39 absolute distinct symbol count: 7
% 0.18/0.39 distinct predicate count: 1
% 0.18/0.39 distinct function count: 3
% 0.18/0.39 distinct constant count: 3
% 0.18/0.39
% 0.18/0.39 ---------- no more Softie stats ----------
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 Model 2 (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 =========== start of search ===========
% 0.45/0.63
% 0.45/0.63 -------- PROOF --------
% 0.45/0.63 % SZS status Unsatisfiable
% 0.45/0.63 % SZS output start Refutation
% 0.45/0.63
% 0.45/0.63 Model 3 (0.00 seconds, 0 Inserts)
% 0.45/0.63
% 0.45/0.63 Stopped by limit on number of solutions
% 0.45/0.63
% 0.45/0.63 Model 4 (0.00 seconds, 0 Inserts)
% 0.45/0.63
% 0.45/0.63 Stopped by limit on number of solutions
% 0.45/0.63
% 0.45/0.63 Model 5 (0.00 seconds, 0 Inserts)
% 0.45/0.63
% 0.45/0.63 Stopped by limit on number of solutions
% 0.45/0.63
% 0.45/0.63 Model 6 (0.00 seconds, 0 Inserts)
% 0.45/0.63
% 0.45/0.63 Stopped by limit on number of solutions
% 0.45/0.63
% 0.45/0.63 Model 7 (0.00 seconds, 0 Inserts)
% 0.45/0.63
% 0.45/0.63 Stopped by limit on number of solutions
% 0.45/0.63
% 0.45/0.63 Model 8 (0.00 seconds, 0 Inserts)
% 0.45/0.63
% 0.45/0.63 Stopped by limit on number of solutions
% 0.45/0.63
% 0.45/0.63 Model 9 (0.00 seconds, 0 Inserts)
% 0.45/0.63
% 0.45/0.63 Stopped by limit on number of solutions
% 0.45/0.63
% 0.45/0.63 Model 10 (0.00 seconds, 0 Inserts)
% 0.45/0.63
% 0.45/0.63 Stopped by limit on number of solutions
% 0.45/0.63
% 0.45/0.63 Model 11 [ 1 2 36996 ] (0.00 seconds, 62119 Inserts)
% 0.45/0.63
% 0.45/0.63 Stopped by limit on insertions
% 0.45/0.63
% 0.45/0.63 Model 12 [ 2 1 8416 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.63
% 0.45/0.63 ----> UNIT CONFLICT at 0.26 sec ----> 116 [binary,114.1,35.1] {+} $F.
% 0.45/0.63
% 0.45/0.63 Length of proof is 3. Level of proof is 2.
% 0.45/0.63
% 0.45/0.63 ---------------- PROOF ----------------
% 0.45/0.63 % SZS status Unsatisfiable
% 0.45/0.63 % SZS output start Refutation
% 0.45/0.63
% 0.45/0.63 1 [] {+} multiply(a,additive_identity)!=additive_identity.
% 0.45/0.63 3 [] {+} multiply(A,B)=multiply(B,A).
% 0.45/0.63 10 [] {-} multiply(add(A,B),C)=add(multiply(A,C),multiply(B,C)).
% 0.45/0.63 21,20 [] {+} multiply(inverse(A),A)=additive_identity.
% 0.45/0.63 26 [] {+} add(A,additive_identity)=A.
% 0.45/0.63 29,28 [] {+} add(additive_identity,A)=A.
% 0.45/0.63 35 [para_from,3.1.1,1.1.1] {+} multiply(additive_identity,a)!=additive_identity.
% 0.45/0.63 38 [para_into,10.1.1.1,26.1.1,flip.1] {-} add(multiply(A,B),multiply(additive_identity,B))=multiply(A,B).
% 0.45/0.63 114 [para_from,20.1.1,38.1.1.1,demod,29,21] {-} multiply(additive_identity,A)=additive_identity.
% 0.45/0.63 116 [binary,114.1,35.1] {+} $F.
% 0.45/0.63
% 0.45/0.63 % SZS output end Refutation
% 0.45/0.63 ------------ end of proof -------------
% 0.45/0.63
% 0.45/0.63
% 0.45/0.63 Search stopped by max_proofs option.
% 0.45/0.63
% 0.45/0.63
% 0.45/0.63 Search stopped by max_proofs option.
% 0.45/0.63
% 0.45/0.63 ============ end of search ============
% 0.45/0.63
% 0.45/0.63 ----------- soft-scott stats ----------
% 0.45/0.63
% 0.45/0.63 true clauses given 5 (25.0%)
% 0.45/0.63 false clauses given 15
% 0.45/0.63
% 0.45/0.63 FALSE TRUE
% 0.45/0.63 5 0 2
% 0.45/0.63 6 0 1
% 0.45/0.63 7 0 2
% 0.45/0.63 9 1 0
% 0.45/0.63 10 5 0
% 0.45/0.63 11 6 0
% 0.45/0.63 13 2 0
% 0.45/0.63 15 1 3
% 0.45/0.63 16 3 0
% 0.45/0.63 17 2 0
% 0.45/0.63 19 1 0
% 0.45/0.63 21 3 0
% 0.45/0.63 23 1 0
% 0.45/0.63 31 2 0
% 0.45/0.63 tot: 27 8 (22.9% true)
% 0.45/0.63
% 0.45/0.63
% 0.45/0.63 Model 12 [ 2 1 8416 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.63
% 0.45/0.63 That finishes the proof of the theorem.
% 0.45/0.63
% 0.45/0.63 Process 19849 finished Wed Jun 1 20:40:37 2022
%------------------------------------------------------------------------------