TSTP Solution File: KLE005+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KLE005+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n014.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:03 EDT 2022
% Result : Theorem 0.64s 0.82s
% Output : Refutation 0.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KLE005+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 08:25:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n014.cluster.edu,
% 0.13/0.36 Thu Jun 16 08:25:05 2022
% 0.13/0.36 The command was "./sos". The process ID is 31367.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 formula_list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] {-} addition(A,B)=addition(B,A).
% 0.13/0.36 Following clause subsumed by 37 during input processing: 0 [copy,37,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.20/0.39
% 0.20/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 -------------- Softie stats --------------
% 0.20/0.39
% 0.20/0.39 UPDATE_STOP: 300
% 0.20/0.39 SFINDER_TIME_LIMIT: 2
% 0.20/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.39 number of clauses in intial UL: 11
% 0.20/0.39 number of clauses initially in problem: 35
% 0.20/0.39 percentage of clauses intially in UL: 31
% 0.20/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.39 percent of all initial clauses that are short: 100
% 0.20/0.39 absolute distinct symbol count: 10
% 0.20/0.39 distinct predicate count: 4
% 0.20/0.39 distinct function count: 4
% 0.20/0.39 distinct constant count: 2
% 0.20/0.39
% 0.20/0.39 ---------- no more Softie stats ----------
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39 =========== start of search ===========
% 0.64/0.82
% 0.64/0.82 -------- PROOF --------
% 0.64/0.82 % SZS status Theorem
% 0.64/0.82 % SZS output start Refutation
% 0.64/0.82
% 0.64/0.82 Model 3 (0.00 seconds, 0 Inserts)
% 0.64/0.82
% 0.64/0.82 Stopped by limit on number of solutions
% 0.64/0.82
% 0.64/0.82 Model 4 (0.00 seconds, 0 Inserts)
% 0.64/0.82
% 0.64/0.82 Stopped by limit on number of solutions
% 0.64/0.82
% 0.64/0.82 Model 5 (0.00 seconds, 0 Inserts)
% 0.64/0.82
% 0.64/0.82 Stopped by limit on number of solutions
% 0.64/0.82
% 0.64/0.82 Stopped by limit on insertions
% 0.64/0.82
% 0.64/0.82 Model 6 [ 5 6 93425 ] (0.00 seconds, 250000 Inserts)
% 0.64/0.82
% 0.64/0.82 Stopped by limit on insertions
% 0.64/0.82
% 0.64/0.82 Model 7 [ 1 1 10407 ] (0.00 seconds, 250000 Inserts)
% 0.64/0.82
% 0.64/0.82 Model 8 [ 4 0 1489 ] (0.00 seconds, 7814 Inserts)
% 0.64/0.82
% 0.64/0.82 Stopped by limit on insertions
% 0.64/0.82
% 0.64/0.82 Model 9 [ 7 0 273 ] (0.00 seconds, 250000 Inserts)
% 0.64/0.82
% 0.64/0.82 Model 10 [ 4 0 1095 ] (0.00 seconds, 26753 Inserts)
% 0.64/0.82
% 0.64/0.82 ----> UNIT CONFLICT at 0.44 sec ----> 91 [binary,89.1,11.1] {-} $F.
% 0.64/0.82
% 0.64/0.82 Length of proof is 4. Level of proof is 4.
% 0.64/0.82
% 0.64/0.82 ---------------- PROOF ----------------
% 0.64/0.82 % SZS status Theorem
% 0.64/0.82 % SZS output start Refutation
% 0.64/0.82
% 0.64/0.82 4 [] {+} test(A)| -complement(B,A).
% 0.64/0.82 6 [] {+} -complement(A,B)|multiplication(A,B)=zero.
% 0.64/0.82 8 [] {+} complement(A,B)|multiplication(B,A)!=zero|multiplication(A,B)!=zero|addition(B,A)!=one.
% 0.64/0.82 9 [] {+} -test(A)|c(A)!=B|complement(A,B).
% 0.64/0.82 11 [] {+} c(one)!=zero.
% 0.64/0.82 17 [] {+} addition(A,zero)=A.
% 0.64/0.82 24 [] {+} multiplication(A,one)=A.
% 0.64/0.82 27,26 [] {+} multiplication(one,A)=A.
% 0.64/0.82 37 [] {+} A=A.
% 0.64/0.82 74 [hyper,26,8,24,17] {+} complement(zero,one).
% 0.64/0.82 75 [hyper,74,4] {+} test(one).
% 0.64/0.82 85 [hyper,75,9,37] {+} complement(one,c(one)).
% 0.64/0.82 89 [hyper,85,6,demod,27] {-} c(one)=zero.
% 0.64/0.82 91 [binary,89.1,11.1] {-} $F.
% 0.64/0.82
% 0.64/0.82 % SZS output end Refutation
% 0.64/0.82 ------------ end of proof -------------
% 0.64/0.82
% 0.64/0.82
% 0.64/0.82 Search stopped by max_proofs option.
% 0.64/0.82
% 0.64/0.82
% 0.64/0.82 Search stopped by max_proofs option.
% 0.64/0.82
% 0.64/0.82 ============ end of search ============
% 0.64/0.82
% 0.64/0.82 ----------- soft-scott stats ----------
% 0.64/0.82
% 0.64/0.82 true clauses given 3 (23.1%)
% 0.64/0.82 false clauses given 10
% 0.64/0.82
% 0.64/0.82 FALSE TRUE
% 0.64/0.82 4 0 1
% 0.64/0.82 5 2 0
% 0.64/0.82 6 9 5
% 0.64/0.82 8 0 3
% 0.64/0.82 9 1 0
% 0.64/0.82 10 2 0
% 0.64/0.82 11 4 3
% 0.64/0.82 12 2 5
% 0.64/0.82 13 2 0
% 0.64/0.82 18 0 1
% 0.64/0.82 19 0 2
% 0.64/0.82 26 0 2
% 0.64/0.82 30 0 1
% 0.64/0.82 tot: 22 23 (51.1% true)
% 0.64/0.82
% 0.64/0.82
% 0.64/0.82 Model 10 [ 4 0 1095 ] (0.00 seconds, 26753 Inserts)
% 0.64/0.82
% 0.64/0.82 That finishes the proof of the theorem.
% 0.64/0.82
% 0.64/0.82 Process 31367 finished Thu Jun 16 08:25:05 2022
%------------------------------------------------------------------------------