TSTP Solution File: BOO005-4 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : BOO005-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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 : Thu Jul 14 23:49:11 EDT 2022
% Result : Unsatisfiable 0.19s 0.53s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : BOO005-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.04/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 : Wed Jun 1 21:16:42 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 sandbox on n017.cluster.edu,
% 0.12/0.35 Wed Jun 1 21:16:42 2022
% 0.12/0.35 The command was "./sos". The process ID is 2365.
% 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 3 during input processing: 0 [copy,3,flip.1] {-} multiply(A,B)=multiply(B,A).
% 0.12/0.35 Following clause subsumed by 17 during input processing: 0 [copy,17,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.19/0.40
% 0.19/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 -------------- Softie stats --------------
% 0.19/0.40
% 0.19/0.40 UPDATE_STOP: 300
% 0.19/0.40 SFINDER_TIME_LIMIT: 2
% 0.19/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.40 number of clauses in intial UL: 1
% 0.19/0.40 number of clauses initially in problem: 16
% 0.19/0.40 percentage of clauses intially in UL: 6
% 0.19/0.40 percentage of distinct symbols occuring in initial UL: 57
% 0.19/0.40 percent of all initial clauses that are short: 100
% 0.19/0.40 absolute distinct symbol count: 7
% 0.19/0.40 distinct predicate count: 1
% 0.19/0.40 distinct function count: 3
% 0.19/0.40 distinct constant count: 3
% 0.19/0.40
% 0.19/0.40 ---------- no more Softie stats ----------
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40 =========== start of search ===========
% 0.19/0.53
% 0.19/0.53 -------- PROOF --------
% 0.19/0.53 % SZS status Unsatisfiable
% 0.19/0.53 % SZS output start Refutation
% 0.19/0.53
% 0.19/0.53 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.53
% 0.19/0.53 Stopped by limit on number of solutions
% 0.19/0.53
% 0.19/0.53 Model 4 (0.00 seconds, 0 Inserts)
% 0.19/0.53
% 0.19/0.53 Stopped by limit on number of solutions
% 0.19/0.53
% 0.19/0.53 Stopped by limit on insertions
% 0.19/0.53
% 0.19/0.53 Model 5 [ 1 0 114 ] (0.00 seconds, 250000 Inserts)
% 0.19/0.53
% 0.19/0.53 Model 6 (0.00 seconds, 250000 Inserts)
% 0.19/0.53
% 0.19/0.53 Stopped by limit on number of solutions
% 0.19/0.53
% 0.19/0.53 Model 7 (0.00 seconds, 250000 Inserts)
% 0.19/0.53
% 0.19/0.53 Stopped by limit on number of solutions
% 0.19/0.53
% 0.19/0.53 Model 8 (0.00 seconds, 250000 Inserts)
% 0.19/0.53
% 0.19/0.53 Stopped by limit on number of solutions
% 0.19/0.53
% 0.19/0.53 Model 9 (0.00 seconds, 250000 Inserts)
% 0.19/0.53
% 0.19/0.53 Stopped by limit on number of solutions
% 0.19/0.53
% 0.19/0.53 ----> UNIT CONFLICT at 0.14 sec ----> 127 [binary,125.1,1.1] {+} $F.
% 0.19/0.53
% 0.19/0.53 Length of proof is 5. Level of proof is 4.
% 0.19/0.53
% 0.19/0.53 ---------------- PROOF ----------------
% 0.19/0.53 % SZS status Unsatisfiable
% 0.19/0.53 % SZS output start Refutation
% 0.19/0.53
% 0.19/0.53 1 [] {+} add(a,multiplicative_identity)!=multiplicative_identity.
% 0.19/0.53 3 [] {+} multiply(A,B)=multiply(B,A).
% 0.19/0.53 4 [] {-} add(A,multiply(B,C))=multiply(add(A,B),add(A,C)).
% 0.19/0.53 5 [copy,4,flip.1] {-} multiply(add(A,B),add(A,C))=add(A,multiply(B,C)).
% 0.19/0.53 8,7 [] {-} multiply(A,add(B,C))=add(multiply(A,B),multiply(A,C)).
% 0.19/0.53 11 [] {+} multiply(A,multiplicative_identity)=A.
% 0.19/0.53 14,13 [] {+} add(A,inverse(A))=multiplicative_identity.
% 0.19/0.53 18 [back_demod,5,demod,8] {-} add(multiply(add(A,B),A),multiply(add(A,B),C))=add(A,multiply(B,C)).
% 0.19/0.53 26,25 [para_into,3.1.1,11.1.1,flip.1] {+} multiply(multiplicative_identity,A)=A.
% 0.19/0.53 55 [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.19/0.53 125 [para_into,55.1.1.2,11.1.1,demod,14,flip.1] {-} add(A,multiplicative_identity)=multiplicative_identity.
% 0.19/0.53 127 [binary,125.1,1.1] {+} $F.
% 0.19/0.53
% 0.19/0.53 % SZS output end Refutation
% 0.19/0.53 ------------ end of proof -------------
% 0.19/0.53
% 0.19/0.53
% 0.19/0.53 Search stopped by max_proofs option.
% 0.19/0.53
% 0.19/0.53
% 0.19/0.53 Search stopped by max_proofs option.
% 0.19/0.53
% 0.19/0.53 ============ end of search ============
% 0.19/0.53
% 0.19/0.53 ----------- soft-scott stats ----------
% 0.19/0.53
% 0.19/0.53 true clauses given 5 (26.3%)
% 0.19/0.53 false clauses given 14
% 0.19/0.53
% 0.19/0.53 FALSE TRUE
% 0.19/0.53 5 0 1
% 0.19/0.53 6 0 3
% 0.19/0.53 7 0 3
% 0.19/0.53 8 0 3
% 0.19/0.53 10 1 3
% 0.19/0.53 11 5 1
% 0.19/0.53 13 4 1
% 0.19/0.53 14 1 4
% 0.19/0.53 15 1 0
% 0.19/0.53 16 1 1
% 0.19/0.53 17 4 1
% 0.19/0.53 19 2 0
% 0.19/0.53 20 1 0
% 0.19/0.53 25 1 0
% 0.19/0.53 27 1 0
% 0.19/0.53 31 1 0
% 0.19/0.53 33 1 0
% 0.19/0.53 tot: 24 21 (46.7% true)
% 0.19/0.53
% 0.19/0.53
% 0.19/0.53 Model 9 (0.00 seconds, 250000 Inserts)
% 0.19/0.53
% 0.19/0.53 That finishes the proof of the theorem.
% 0.19/0.53
% 0.19/0.53 Process 2365 finished Wed Jun 1 21:16:42 2022
%------------------------------------------------------------------------------