TSTP Solution File: KLE021+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KLE021+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n018.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 : Sun Jul 17 02:27:09 EDT 2022
% Result : Theorem 0.76s 1.00s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : KLE021+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n018.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 : Thu Jun 16 15:17:01 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 sandbox2 on n018.cluster.edu,
% 0.12/0.35 Thu Jun 16 15:17:01 2022
% 0.12/0.35 The command was "./sos". The process ID is 29809.
% 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 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 clauses in usable.
% 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 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 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 14 during input processing: 0 [copy,14,flip.1] {-} addition(A,B)=addition(B,A).
% 0.12/0.35 Following clause subsumed by 39 during input processing: 0 [copy,39,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 -------------- Softie stats --------------
% 0.12/0.39
% 0.12/0.39 UPDATE_STOP: 300
% 0.12/0.39 SFINDER_TIME_LIMIT: 2
% 0.12/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39 number of clauses in intial UL: 11
% 0.12/0.39 number of clauses initially in problem: 36
% 0.12/0.39 percentage of clauses intially in UL: 30
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 12
% 0.12/0.39 distinct predicate count: 4
% 0.12/0.39 distinct function count: 4
% 0.12/0.39 distinct constant count: 4
% 0.12/0.39
% 0.12/0.39 ---------- no more Softie stats ----------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39 =========== start of search ===========
% 0.76/1.00
% 0.76/1.00 -------- PROOF --------
% 0.76/1.00 % SZS status Theorem
% 0.76/1.00 % SZS output start Refutation
% 0.76/1.00
% 0.76/1.00 Model 3 (0.00 seconds, 0 Inserts)
% 0.76/1.00
% 0.76/1.00 Stopped by limit on number of solutions
% 0.76/1.00
% 0.76/1.00 Model 4 (0.00 seconds, 0 Inserts)
% 0.76/1.00
% 0.76/1.00 Stopped by limit on number of solutions
% 0.76/1.00
% 0.76/1.00 Model 5 (0.00 seconds, 0 Inserts)
% 0.76/1.00
% 0.76/1.00 Stopped by limit on number of solutions
% 0.76/1.00
% 0.76/1.00 Model 6 (0.00 seconds, 0 Inserts)
% 0.76/1.00
% 0.76/1.00 Stopped by limit on number of solutions
% 0.76/1.00
% 0.76/1.00 Stopped by limit on insertions
% 0.76/1.00
% 0.76/1.00 Model 7 [ 1 1 678 ] (0.00 seconds, 250000 Inserts)
% 0.76/1.00
% 0.76/1.00 Stopped by limit on insertions
% 0.76/1.00
% 0.76/1.00 Model 8 [ 7 2 89404 ] (0.00 seconds, 250000 Inserts)
% 0.76/1.00
% 0.76/1.00 Stopped by limit on insertions
% 0.76/1.00
% 0.76/1.00 Model 9 [ 3 1 1100 ] (0.00 seconds, 250000 Inserts)
% 0.76/1.00
% 0.76/1.00 Model 10 (0.00 seconds, 250000 Inserts)
% 0.76/1.00
% 0.76/1.00 Stopped by limit on number of solutions
% 0.76/1.00
% 0.76/1.00 Model 11 [ 1 5 115542 ] (0.00 seconds, 187025 Inserts)
% 0.76/1.00
% 0.76/1.00 Stopped by limit on insertions
% 0.76/1.00
% 0.76/1.00 Model 12 [ 12 1 24929 ] (0.00 seconds, 250000 Inserts)
% 0.76/1.00
% 0.76/1.00 Model 13 [ 1 2 44882 ] (0.00 seconds, 170954 Inserts)
% 0.76/1.00
% 0.76/1.00 Model 14 [ 1 5 147945 ] (0.00 seconds, 170508 Inserts)
% 0.76/1.00
% 0.76/1.00 Stopped by limit on insertions
% 0.76/1.00
% 0.76/1.00 Model 15 [ 13 6 194051 ] (0.00 seconds, 250000 Inserts)
% 0.76/1.00
% 0.76/1.00 Model 16 [ 2 0 3115 ] (0.00 seconds, 23082 Inserts)
% 0.76/1.00
% 0.76/1.00 Model 17 [ 2 1 2159 ] (0.00 seconds, 14574 Inserts)
% 0.76/1.00
% 0.76/1.00 ----> UNIT CONFLICT at 0.63 sec ----> 156 [binary,154.1,43.1] {+} $F.
% 0.76/1.00
% 0.76/1.00 Length of proof is 5. Level of proof is 2.
% 0.76/1.00
% 0.76/1.00 ---------------- PROOF ----------------
% 0.76/1.00 % SZS status Theorem
% 0.76/1.00 % SZS output start Refutation
% 0.76/1.00
% 0.76/1.00 7 [] {+} -complement(A,B)|addition(B,A)=one.
% 0.76/1.00 9 [] {+} -test(A)|c(A)!=B|complement(A,B).
% 0.76/1.00 11 [] {-} $c2!=addition(multiplication($c1,$c2),multiplication(c($c1),$c2)).
% 0.76/1.00 12 [copy,11,flip.1] {+} addition(multiplication($c1,$c2),multiplication(c($c1),$c2))!=$c2.
% 0.76/1.00 14 [] {+} addition(A,B)=addition(B,A).
% 0.76/1.00 28,27 [] {+} multiplication(one,A)=A.
% 0.76/1.00 31 [] {-} multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 0.76/1.00 38 [] {+} test($c1).
% 0.76/1.00 39 [] {+} A=A.
% 0.76/1.00 43 [para_from,14.1.1,12.1.1] {+} addition(multiplication(c($c1),$c2),multiplication($c1,$c2))!=$c2.
% 0.76/1.00 59 [hyper,39,9,38] {+} complement($c1,c($c1)).
% 0.76/1.00 111 [para_into,31.1.1.1,7.2.1,demod,28,flip.1] {-} addition(multiplication(A,B),multiplication(C,B))=B| -complement(C,A).
% 0.76/1.00 154 [hyper,59,111] {-} addition(multiplication(c($c1),A),multiplication($c1,A))=A.
% 0.76/1.00 156 [binary,154.1,43.1] {+} $F.
% 0.76/1.00
% 0.76/1.00 % SZS output end Refutation
% 0.76/1.00 ------------ end of proof -------------
% 0.76/1.00
% 0.76/1.00
% 0.76/1.00 Search stopped by max_proofs option.
% 0.76/1.00
% 0.76/1.00
% 0.76/1.00 Search stopped by max_proofs option.
% 0.76/1.00
% 0.76/1.00 ============ end of search ============
% 0.76/1.00
% 0.76/1.00 ----------- soft-scott stats ----------
% 0.76/1.00
% 0.76/1.00 true clauses given 4 (16.7%)
% 0.76/1.00 false clauses given 20
% 0.76/1.00
% 0.76/1.00 FALSE TRUE
% 0.76/1.00 2 0 1
% 0.76/1.00 3 0 3
% 0.76/1.00 4 0 3
% 0.76/1.00 6 0 20
% 0.76/1.00 8 0 11
% 0.76/1.00 9 0 1
% 0.76/1.00 10 1 6
% 0.76/1.00 11 0 10
% 0.76/1.00 12 0 9
% 0.76/1.00 13 0 3
% 0.76/1.00 14 2 4
% 0.76/1.00 15 0 2
% 0.76/1.00 16 0 3
% 0.76/1.00 18 0 4
% 0.76/1.00 19 0 2
% 0.76/1.00 21 0 1
% 0.76/1.00 22 0 2
% 0.76/1.00 26 0 2
% 0.76/1.00 29 0 2
% 0.76/1.00 30 0 2
% 0.76/1.00 31 0 3
% 0.76/1.00 tot: 3 94 (96.9% true)
% 0.76/1.00
% 0.76/1.00
% 0.76/1.00 Model 17 [ 2 1 2159 ] (0.00 seconds, 14574 Inserts)
% 0.76/1.00
% 0.76/1.00 That finishes the proof of the theorem.
% 0.76/1.00
% 0.76/1.00 Process 29809 finished Thu Jun 16 15:17:01 2022
%------------------------------------------------------------------------------