TSTP Solution File: BOO011-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : BOO011-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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.39s 0.56s
% Output : Refutation 0.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : BOO011-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.13/0.14 % Command : sos-script %s
% 0.15/0.35 % Computer : n020.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Wed Jun 1 22:42:08 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.22/0.37 ----- Otter 3.2, August 2001 -----
% 0.22/0.37 The process was started by sandbox2 on n020.cluster.edu,
% 0.22/0.37 Wed Jun 1 22:42:08 2022
% 0.22/0.37 The command was "./sos". The process ID is 30177.
% 0.22/0.37
% 0.22/0.37 set(prolog_style_variables).
% 0.22/0.37 set(auto).
% 0.22/0.37 dependent: set(auto1).
% 0.22/0.37 dependent: set(process_input).
% 0.22/0.37 dependent: clear(print_kept).
% 0.22/0.37 dependent: clear(print_new_demod).
% 0.22/0.37 dependent: clear(print_back_demod).
% 0.22/0.37 dependent: clear(print_back_sub).
% 0.22/0.37 dependent: set(control_memory).
% 0.22/0.37 dependent: assign(max_mem, 12000).
% 0.22/0.37 dependent: assign(pick_given_ratio, 4).
% 0.22/0.37 dependent: assign(stats_level, 1).
% 0.22/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.22/0.37 dependent: assign(sos_limit, 5000).
% 0.22/0.37 dependent: assign(max_weight, 60).
% 0.22/0.37 clear(print_given).
% 0.22/0.37
% 0.22/0.37 list(usable).
% 0.22/0.37
% 0.22/0.37 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.22/0.37
% 0.22/0.37 All clauses are units, and equality is present; the
% 0.22/0.37 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.22/0.37
% 0.22/0.37 dependent: set(knuth_bendix).
% 0.22/0.37 dependent: set(para_from).
% 0.22/0.37 dependent: set(para_into).
% 0.22/0.37 dependent: clear(para_from_right).
% 0.22/0.37 dependent: clear(para_into_right).
% 0.22/0.37 dependent: set(para_from_vars).
% 0.22/0.37 dependent: set(eq_units_both_ways).
% 0.22/0.37 dependent: set(dynamic_demod_all).
% 0.22/0.37 dependent: set(dynamic_demod).
% 0.22/0.37 dependent: set(order_eq).
% 0.22/0.37 dependent: set(back_demod).
% 0.22/0.37 dependent: set(lrpo).
% 0.22/0.37
% 0.22/0.37 ------------> process usable:
% 0.22/0.37
% 0.22/0.37 ------------> process sos:
% 0.22/0.37 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] {-} add(A,B)=add(B,A).
% 0.22/0.37 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] {-} multiply(A,B)=multiply(B,A).
% 0.22/0.37 Following clause subsumed by 30 during input processing: 0 [copy,30,flip.1] {-} A=A.
% 0.22/0.37
% 0.22/0.37 ======= end of input processing =======
% 0.22/0.41
% 0.22/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.22/0.41
% 0.22/0.41 Stopped by limit on number of solutions
% 0.22/0.41
% 0.22/0.41
% 0.22/0.41 -------------- Softie stats --------------
% 0.22/0.41
% 0.22/0.41 UPDATE_STOP: 300
% 0.22/0.41 SFINDER_TIME_LIMIT: 2
% 0.22/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.22/0.41 number of clauses in intial UL: 1
% 0.22/0.41 number of clauses initially in problem: 28
% 0.22/0.41 percentage of clauses intially in UL: 3
% 0.22/0.41 percentage of distinct symbols occuring in initial UL: 66
% 0.22/0.41 percent of all initial clauses that are short: 100
% 0.22/0.41 absolute distinct symbol count: 6
% 0.22/0.41 distinct predicate count: 1
% 0.22/0.41 distinct function count: 3
% 0.22/0.41 distinct constant count: 2
% 0.22/0.41
% 0.22/0.41 ---------- no more Softie stats ----------
% 0.22/0.41
% 0.22/0.41
% 0.22/0.41
% 0.22/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.22/0.41
% 0.22/0.41 Stopped by limit on number of solutions
% 0.22/0.41
% 0.22/0.41 =========== start of search ===========
% 0.39/0.56
% 0.39/0.56 -------- PROOF --------
% 0.39/0.56 % SZS status Unsatisfiable
% 0.39/0.56 % SZS output start Refutation
% 0.39/0.56
% 0.39/0.56 Model 3 (0.00 seconds, 0 Inserts)
% 0.39/0.56
% 0.39/0.56 Stopped by limit on number of solutions
% 0.39/0.56
% 0.39/0.56 Model 4 (0.00 seconds, 0 Inserts)
% 0.39/0.56
% 0.39/0.56 Stopped by limit on number of solutions
% 0.39/0.56
% 0.39/0.56 Model 5 (0.00 seconds, 0 Inserts)
% 0.39/0.56
% 0.39/0.56 Stopped by limit on number of solutions
% 0.39/0.56
% 0.39/0.56 Stopped by limit on insertions
% 0.39/0.56
% 0.39/0.56 Model 6 [ 1 1 150 ] (0.00 seconds, 250000 Inserts)
% 0.39/0.56
% 0.39/0.56 Stopped by limit on insertions
% 0.39/0.56
% 0.39/0.56 Model 7 [ 1 1 241 ] (0.00 seconds, 250000 Inserts)
% 0.39/0.57
% 0.39/0.57 ----> UNIT CONFLICT at 0.17 sec ----> 37 [binary,35.1,1.1] {-} $F.
% 0.39/0.57
% 0.39/0.57 Length of proof is 1. Level of proof is 1.
% 0.39/0.57
% 0.39/0.57 ---------------- PROOF ----------------
% 0.39/0.57 % SZS status Unsatisfiable
% 0.39/0.57 % SZS output start Refutation
% 0.39/0.57
% 0.39/0.57 1 [] {+} inverse(additive_identity)!=multiplicative_identity.
% 0.39/0.57 14 [] {+} add(A,inverse(A))=multiplicative_identity.
% 0.39/0.57 28 [] {+} add(additive_identity,A)=A.
% 0.39/0.57 35 [para_into,28.1.1,14.1.1,flip.1] {-} inverse(additive_identity)=multiplicative_identity.
% 0.39/0.57 37 [binary,35.1,1.1] {-} $F.
% 0.39/0.57
% 0.39/0.57 % SZS output end Refutation
% 0.39/0.57 ------------ end of proof -------------
% 0.39/0.57
% 0.39/0.57
% 0.39/0.57 Search stopped by max_proofs option.
% 0.39/0.57
% 0.39/0.57
% 0.39/0.57 Search stopped by max_proofs option.
% 0.39/0.57
% 0.39/0.57 ============ end of search ============
% 0.39/0.57
% 0.39/0.57 ----------- soft-scott stats ----------
% 0.39/0.57
% 0.39/0.57 true clauses given 2 (25.0%)
% 0.39/0.57 false clauses given 6
% 0.39/0.57
% 0.39/0.57 FALSE TRUE
% 0.39/0.57 6 3 0
% 0.39/0.57 13 2 0
% 0.39/0.57 21 2 0
% 0.39/0.57 tot: 7 0 (0.0% true)
% 0.39/0.57
% 0.39/0.57
% 0.39/0.57 Model 7 [ 1 1 241 ] (0.00 seconds, 250000 Inserts)
% 0.39/0.57
% 0.39/0.57 That finishes the proof of the theorem.
% 0.39/0.57
% 0.39/0.57 Process 30177 finished Wed Jun 1 22:42:08 2022
%------------------------------------------------------------------------------