TSTP Solution File: KLE086+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KLE086+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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:29 EDT 2022
% Result : Theorem 0.50s 0.70s
% Output : Refutation 0.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE086+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 08:07:35 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n023.cluster.edu,
% 0.12/0.36 Thu Jun 16 08:07:35 2022
% 0.12/0.36 The command was "./sos". The process ID is 2207.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 formula_list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 0.12/0.36
% 0.12/0.36 This is a Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.12/0.36 sos and nonpositive clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: clear(order_hyper).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] {-} addition(A,B)=addition(B,A).
% 0.12/0.36 Following clause subsumed by 43 during input processing: 0 [copy,43,flip.1] {-} A=A.
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.19/0.39
% 0.19/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 -------------- Softie stats --------------
% 0.19/0.39
% 0.19/0.39 UPDATE_STOP: 300
% 0.19/0.39 SFINDER_TIME_LIMIT: 2
% 0.19/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39 number of clauses in intial UL: 2
% 0.19/0.39 number of clauses initially in problem: 41
% 0.19/0.39 percentage of clauses intially in UL: 4
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 30
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 10
% 0.19/0.39 distinct predicate count: 2
% 0.19/0.39 distinct function count: 6
% 0.19/0.39 distinct constant count: 2
% 0.19/0.39
% 0.19/0.39 ---------- no more Softie stats ----------
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39 =========== start of search ===========
% 0.50/0.70
% 0.50/0.70 -------- PROOF --------
% 0.50/0.70 % SZS status Theorem
% 0.50/0.70 % SZS output start Refutation
% 0.50/0.70
% 0.50/0.70 Model 3 (0.00 seconds, 0 Inserts)
% 0.50/0.70
% 0.50/0.70 Stopped by limit on number of solutions
% 0.50/0.70
% 0.50/0.70 Model 4 (0.00 seconds, 0 Inserts)
% 0.50/0.70
% 0.50/0.70 Stopped by limit on number of solutions
% 0.50/0.70
% 0.50/0.70 Model 5 (0.00 seconds, 0 Inserts)
% 0.50/0.70
% 0.50/0.70 Stopped by limit on number of solutions
% 0.50/0.70
% 0.50/0.70 Model 6 (0.00 seconds, 0 Inserts)
% 0.50/0.70
% 0.50/0.70 Stopped by limit on number of solutions
% 0.50/0.70
% 0.50/0.70 Model 7 (0.00 seconds, 0 Inserts)
% 0.50/0.70
% 0.50/0.70 Stopped by limit on number of solutions
% 0.50/0.70
% 0.50/0.70 Stopped by limit on insertions
% 0.50/0.70
% 0.50/0.70 Model 8 [ 8 1 224 ] (0.00 seconds, 250000 Inserts)
% 0.50/0.70
% 0.50/0.70 Stopped by limit on insertions
% 0.50/0.70
% 0.50/0.70 Model 9 [ 10 0 234 ] (0.00 seconds, 250000 Inserts)
% 0.50/0.70
% 0.50/0.70 Stopped by limit on insertions
% 0.50/0.70
% 0.50/0.70 Model 10 [ 8 1 169 ] (0.00 seconds, 250000 Inserts)
% 0.50/0.70
% 0.50/0.70 Stopped by limit on insertions
% 0.50/0.70
% 0.50/0.70 Model 11 [ 13 0 291 ] (0.00 seconds, 250000 Inserts)
% 0.50/0.70
% 0.50/0.70 Model 12 (0.00 seconds, 250000 Inserts)
% 0.50/0.70
% 0.50/0.70 Stopped by limit on number of solutions
% 0.50/0.70
% 0.50/0.70 Model 13 (0.00 seconds, 250000 Inserts)
% 0.50/0.70
% 0.50/0.70 Stopped by limit on number of solutions
% 0.50/0.70
% 0.50/0.70 Model 14 (0.00 seconds, 250000 Inserts)
% 0.50/0.70
% 0.50/0.70 Stopped by limit on number of solutions
% 0.50/0.70
% 0.50/0.70 ----> UNIT CONFLICT at 0.32 sec ----> 123 [binary,122.1,43.1] {-} $F.
% 0.50/0.70
% 0.50/0.70 Length of proof is 6. Level of proof is 3.
% 0.50/0.70
% 0.50/0.70 ---------------- PROOF ----------------
% 0.50/0.70 % SZS status Theorem
% 0.50/0.70 % SZS output start Refutation
% 0.50/0.70
% 0.50/0.70 3 [] {-} domain(zero)!=zero.
% 0.50/0.70 4 [] {+} addition(A,B)=addition(B,A).
% 0.50/0.70 8 [] {+} addition(A,zero)=A.
% 0.50/0.70 15 [] {+} multiplication(A,one)=A.
% 0.50/0.70 27 [] {+} multiplication(antidomain(A),A)=zero.
% 0.50/0.70 31 [] {-} addition(antidomain(antidomain(A)),antidomain(A))=one.
% 0.50/0.70 34,33 [] {+} domain(A)=antidomain(antidomain(A)).
% 0.50/0.70 43 [] {+} A=A.
% 0.50/0.70 44 [back_demod,3,demod,34] {+} antidomain(antidomain(zero))!=zero.
% 0.50/0.70 49,48 [para_into,8.1.1,4.1.1] {+} addition(zero,A)=A.
% 0.50/0.70 69,68 [para_into,27.1.1,15.1.1] {+} antidomain(one)=zero.
% 0.50/0.70 72 [para_into,31.1.1,4.1.1] {-} addition(antidomain(A),antidomain(antidomain(A)))=one.
% 0.50/0.70 121,120 [para_from,68.1.1,72.1.1.1,demod,69,49] {-} antidomain(zero)=one.
% 0.50/0.70 122 [back_demod,44,demod,121,69] {-} zero!=zero.
% 0.50/0.70 123 [binary,122.1,43.1] {-} $F.
% 0.50/0.70
% 0.50/0.70 % SZS output end Refutation
% 0.50/0.70 ------------ end of proof -------------
% 0.50/0.70
% 0.50/0.70
% 0.50/0.70 Search stopped by max_proofs option.
% 0.50/0.70
% 0.50/0.70
% 0.50/0.70 Search stopped by max_proofs option.
% 0.50/0.70
% 0.50/0.70 ============ end of search ============
% 0.50/0.70
% 0.50/0.70 ----------- soft-scott stats ----------
% 0.50/0.70
% 0.50/0.70 true clauses given 5 (20.0%)
% 0.50/0.70 false clauses given 20
% 0.50/0.70
% 0.50/0.70 FALSE TRUE
% 0.50/0.70 5 0 1
% 0.50/0.70 6 1 5
% 0.50/0.70 8 0 3
% 0.50/0.70 9 0 1
% 0.50/0.70 10 2 2
% 0.50/0.70 11 2 6
% 0.50/0.70 12 12 3
% 0.50/0.70 14 0 2
% 0.50/0.70 15 0 2
% 0.50/0.70 18 0 2
% 0.50/0.70 31 0 2
% 0.50/0.70 tot: 17 29 (63.0% true)
% 0.50/0.70
% 0.50/0.70
% 0.50/0.70 Model 14 (0.00 seconds, 250000 Inserts)
% 0.50/0.70
% 0.50/0.70 That finishes the proof of the theorem.
% 0.50/0.70
% 0.50/0.70 Process 2207 finished Thu Jun 16 08:07:35 2022
%------------------------------------------------------------------------------