TSTP Solution File: KLE061+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KLE061+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n006.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:23 EDT 2022
% Result : Theorem 0.23s 0.55s
% Output : Refutation 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : KLE061+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : sos-script %s
% 0.15/0.36 % Computer : n006.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Thu Jun 16 12:02:26 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.23/0.38 ----- Otter 3.2, August 2001 -----
% 0.23/0.38 The process was started by sandbox2 on n006.cluster.edu,
% 0.23/0.38 Thu Jun 16 12:02:26 2022
% 0.23/0.38 The command was "./sos". The process ID is 30405.
% 0.23/0.38
% 0.23/0.38 set(prolog_style_variables).
% 0.23/0.38 set(auto).
% 0.23/0.38 dependent: set(auto1).
% 0.23/0.38 dependent: set(process_input).
% 0.23/0.38 dependent: clear(print_kept).
% 0.23/0.38 dependent: clear(print_new_demod).
% 0.23/0.38 dependent: clear(print_back_demod).
% 0.23/0.38 dependent: clear(print_back_sub).
% 0.23/0.38 dependent: set(control_memory).
% 0.23/0.38 dependent: assign(max_mem, 12000).
% 0.23/0.38 dependent: assign(pick_given_ratio, 4).
% 0.23/0.38 dependent: assign(stats_level, 1).
% 0.23/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.23/0.38 dependent: assign(sos_limit, 5000).
% 0.23/0.38 dependent: assign(max_weight, 60).
% 0.23/0.38 clear(print_given).
% 0.23/0.38
% 0.23/0.38 formula_list(usable).
% 0.23/0.38
% 0.23/0.38 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 0.23/0.38
% 0.23/0.38 This is a Horn set with equality. The strategy will be
% 0.23/0.38 Knuth-Bendix and hyper_res, with positive clauses in
% 0.23/0.38 sos and nonpositive clauses in usable.
% 0.23/0.38
% 0.23/0.38 dependent: set(knuth_bendix).
% 0.23/0.38 dependent: set(para_from).
% 0.23/0.38 dependent: set(para_into).
% 0.23/0.38 dependent: clear(para_from_right).
% 0.23/0.38 dependent: clear(para_into_right).
% 0.23/0.38 dependent: set(para_from_vars).
% 0.23/0.38 dependent: set(eq_units_both_ways).
% 0.23/0.38 dependent: set(dynamic_demod_all).
% 0.23/0.38 dependent: set(dynamic_demod).
% 0.23/0.38 dependent: set(order_eq).
% 0.23/0.38 dependent: set(back_demod).
% 0.23/0.38 dependent: set(lrpo).
% 0.23/0.38 dependent: set(hyper_res).
% 0.23/0.38 dependent: clear(order_hyper).
% 0.23/0.38
% 0.23/0.38 ------------> process usable:
% 0.23/0.38
% 0.23/0.38 ------------> process sos:
% 0.23/0.38 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] {-} addition(A,B)=addition(B,A).
% 0.23/0.38 Following clause subsumed by 38 during input processing: 0 [copy,38,flip.1] {-} A=A.
% 0.23/0.38
% 0.23/0.38 ======= end of input processing =======
% 0.23/0.42
% 0.23/0.42 Model 1 (0.00 seconds, 0 Inserts)
% 0.23/0.42
% 0.23/0.42 Stopped by limit on number of solutions
% 0.23/0.42
% 0.23/0.42
% 0.23/0.42 -------------- Softie stats --------------
% 0.23/0.42
% 0.23/0.42 UPDATE_STOP: 300
% 0.23/0.42 SFINDER_TIME_LIMIT: 2
% 0.23/0.42 SHORT_CLAUSE_CUTOFF: 4
% 0.23/0.42 number of clauses in intial UL: 3
% 0.23/0.42 number of clauses initially in problem: 35
% 0.23/0.42 percentage of clauses intially in UL: 8
% 0.23/0.42 percentage of distinct symbols occuring in initial UL: 75
% 0.23/0.42 percent of all initial clauses that are short: 100
% 0.23/0.42 absolute distinct symbol count: 8
% 0.23/0.42 distinct predicate count: 2
% 0.23/0.42 distinct function count: 3
% 0.23/0.42 distinct constant count: 3
% 0.23/0.42
% 0.23/0.42 ---------- no more Softie stats ----------
% 0.23/0.42
% 0.23/0.42
% 0.23/0.42
% 0.23/0.42 Model 2 (0.00 seconds, 0 Inserts)
% 0.23/0.42
% 0.23/0.42 Stopped by limit on number of solutions
% 0.23/0.42
% 0.23/0.42 =========== start of search ===========
% 0.23/0.55
% 0.23/0.55 -------- PROOF --------
% 0.23/0.55 % SZS status Theorem
% 0.23/0.55 % SZS output start Refutation
% 0.23/0.55
% 0.23/0.55 Model 3 (0.00 seconds, 0 Inserts)
% 0.23/0.55
% 0.23/0.55 Stopped by limit on number of solutions
% 0.23/0.55
% 0.23/0.55 Model 4 (0.00 seconds, 0 Inserts)
% 0.23/0.55
% 0.23/0.55 Stopped by limit on number of solutions
% 0.23/0.55
% 0.23/0.55 Model 5 (0.00 seconds, 0 Inserts)
% 0.23/0.55
% 0.23/0.55 Stopped by limit on number of solutions
% 0.23/0.55
% 0.23/0.55 Model 6 (0.00 seconds, 0 Inserts)
% 0.23/0.55
% 0.23/0.55 Stopped by limit on number of solutions
% 0.23/0.55
% 0.23/0.55 Model 7 (0.00 seconds, 0 Inserts)
% 0.23/0.55
% 0.23/0.55 Stopped by limit on number of solutions
% 0.23/0.55
% 0.23/0.55 Model 8 (0.00 seconds, 0 Inserts)
% 0.23/0.55
% 0.23/0.55 Stopped by limit on number of solutions
% 0.23/0.55
% 0.23/0.55 Model 9 (0.00 seconds, 0 Inserts)
% 0.23/0.55
% 0.23/0.55 Stopped by limit on number of solutions
% 0.23/0.55
% 0.23/0.55 Model 10 (0.00 seconds, 0 Inserts)
% 0.23/0.55
% 0.23/0.55 Stopped by limit on number of solutions
% 0.23/0.55
% 0.23/0.55 Model 11 (0.00 seconds, 0 Inserts)
% 0.23/0.55
% 0.23/0.55 Stopped by limit on number of solutions
% 0.23/0.55
% 0.23/0.55 Model 12 [ 1 2 23101 ] (0.00 seconds, 24710 Inserts)
% 0.23/0.55
% 0.23/0.55 Model 13 [ 1 3 41331 ] (0.00 seconds, 42767 Inserts)
% 0.23/0.55
% 0.23/0.55 ----> UNIT CONFLICT at 0.14 sec ----> 93 [binary,91.1,3.1] {-} $F.
% 0.23/0.55
% 0.23/0.55 Length of proof is 5. Level of proof is 3.
% 0.23/0.55
% 0.23/0.55 ---------------- PROOF ----------------
% 0.23/0.55 % SZS status Theorem
% 0.23/0.55 % SZS output start Refutation
% 0.23/0.55
% 0.23/0.55 3 [] {+} multiplication(domain($c1),domain($c1))!=domain($c1).
% 0.23/0.55 4 [] {+} addition(A,B)=addition(B,A).
% 0.23/0.55 16,15 [] {+} multiplication(A,one)=A.
% 0.23/0.55 18,17 [] {+} multiplication(one,A)=A.
% 0.23/0.55 19 [] {-} multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 0.23/0.55 27 [] {+} addition(A,multiplication(domain(A),A))=multiplication(domain(A),A).
% 0.23/0.55 29 [] {-} domain(multiplication(A,B))=domain(multiplication(A,domain(B))).
% 0.23/0.55 30 [copy,29,flip.1] {-} domain(multiplication(A,domain(B)))=domain(multiplication(A,B)).
% 0.23/0.55 32 [] {+} addition(domain(A),one)=one.
% 0.23/0.55 73 [para_into,19.1.1.2,32.1.1,demod,16,16,flip.1] {+} addition(multiplication(A,domain(B)),A)=A.
% 0.23/0.55 82,81 [para_into,73.1.1,4.1.1] {-} addition(A,multiplication(A,domain(B)))=A.
% 0.23/0.55 88,87 [para_into,30.1.1.1,17.1.1,demod,18] {+} domain(domain(A))=domain(A).
% 0.23/0.55 91 [para_from,87.1.1,27.1.1.2.1,demod,82,88,flip.1] {-} multiplication(domain(A),domain(A))=domain(A).
% 0.23/0.55 93 [binary,91.1,3.1] {-} $F.
% 0.23/0.55
% 0.23/0.55 % SZS output end Refutation
% 0.23/0.55 ------------ end of proof -------------
% 0.23/0.55
% 0.23/0.55
% 0.23/0.55 Search stopped by max_proofs option.
% 0.23/0.55
% 0.23/0.55
% 0.23/0.55 Search stopped by max_proofs option.
% 0.23/0.55
% 0.23/0.55 ============ end of search ============
% 0.23/0.55
% 0.23/0.55 ----------- soft-scott stats ----------
% 0.23/0.55
% 0.23/0.55 true clauses given 5 (25.0%)
% 0.23/0.55 false clauses given 15
% 0.23/0.55
% 0.23/0.55 FALSE TRUE
% 0.23/0.55 4 0 2
% 0.23/0.55 6 1 5
% 0.23/0.55 8 1 2
% 0.23/0.55 9 0 1
% 0.23/0.55 10 0 2
% 0.23/0.55 11 0 5
% 0.23/0.55 12 1 3
% 0.23/0.55 13 1 0
% 0.23/0.55 14 2 1
% 0.23/0.55 15 0 1
% 0.23/0.55 17 1 0
% 0.23/0.55 24 0 1
% 0.23/0.55 43 0 1
% 0.23/0.55 tot: 7 24 (77.4% true)
% 0.23/0.55
% 0.23/0.55
% 0.23/0.55 Model 13 [ 1 3 41331 ] (0.00 seconds, 42767 Inserts)
% 0.23/0.55
% 0.23/0.55 That finishes the proof of the theorem.
% 0.23/0.55
% 0.23/0.55 Process 30405 finished Thu Jun 16 12:02:26 2022
%------------------------------------------------------------------------------