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