TSTP Solution File: KLE070+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KLE070+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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:25 EDT 2022
% Result : Theorem 0.22s 0.49s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : KLE070+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : sos-script %s
% 0.15/0.36 % Computer : n027.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:19:35 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.15/0.38 ----- Otter 3.2, August 2001 -----
% 0.15/0.38 The process was started by sandbox2 on n027.cluster.edu,
% 0.15/0.38 Thu Jun 16 12:19:35 2022
% 0.15/0.38 The command was "./sos". The process ID is 16510.
% 0.15/0.38
% 0.15/0.38 set(prolog_style_variables).
% 0.15/0.38 set(auto).
% 0.15/0.38 dependent: set(auto1).
% 0.15/0.38 dependent: set(process_input).
% 0.15/0.38 dependent: clear(print_kept).
% 0.15/0.38 dependent: clear(print_new_demod).
% 0.15/0.38 dependent: clear(print_back_demod).
% 0.15/0.38 dependent: clear(print_back_sub).
% 0.15/0.38 dependent: set(control_memory).
% 0.15/0.38 dependent: assign(max_mem, 12000).
% 0.15/0.38 dependent: assign(pick_given_ratio, 4).
% 0.15/0.38 dependent: assign(stats_level, 1).
% 0.15/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.15/0.38 dependent: assign(sos_limit, 5000).
% 0.15/0.38 dependent: assign(max_weight, 60).
% 0.15/0.38 clear(print_given).
% 0.15/0.38
% 0.15/0.38 formula_list(usable).
% 0.15/0.38
% 0.15/0.38 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 0.15/0.38
% 0.15/0.38 This is a Horn set with equality. The strategy will be
% 0.15/0.38 Knuth-Bendix and hyper_res, with positive clauses in
% 0.15/0.38 sos and nonpositive clauses in usable.
% 0.15/0.38
% 0.15/0.38 dependent: set(knuth_bendix).
% 0.15/0.38 dependent: set(para_from).
% 0.15/0.38 dependent: set(para_into).
% 0.15/0.38 dependent: clear(para_from_right).
% 0.15/0.38 dependent: clear(para_into_right).
% 0.15/0.38 dependent: set(para_from_vars).
% 0.15/0.38 dependent: set(eq_units_both_ways).
% 0.15/0.38 dependent: set(dynamic_demod_all).
% 0.15/0.38 dependent: set(dynamic_demod).
% 0.15/0.38 dependent: set(order_eq).
% 0.15/0.38 dependent: set(back_demod).
% 0.15/0.38 dependent: set(lrpo).
% 0.15/0.38 dependent: set(hyper_res).
% 0.15/0.38 dependent: clear(order_hyper).
% 0.15/0.38
% 0.15/0.38 ------------> process usable:
% 0.15/0.38
% 0.15/0.38 ------------> process sos:
% 0.15/0.38 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] {-} addition(A,B)=addition(B,A).
% 0.15/0.38 Following clause subsumed by 38 during input processing: 0 [copy,38,flip.1] {-} A=A.
% 0.15/0.38
% 0.15/0.38 ======= end of input processing =======
% 0.22/0.42
% 0.22/0.42 Model 1 (0.00 seconds, 0 Inserts)
% 0.22/0.42
% 0.22/0.42 Stopped by limit on number of solutions
% 0.22/0.42
% 0.22/0.42
% 0.22/0.42 -------------- Softie stats --------------
% 0.22/0.42
% 0.22/0.42 UPDATE_STOP: 300
% 0.22/0.42 SFINDER_TIME_LIMIT: 2
% 0.22/0.42 SHORT_CLAUSE_CUTOFF: 4
% 0.22/0.42 number of clauses in intial UL: 3
% 0.22/0.42 number of clauses initially in problem: 35
% 0.22/0.42 percentage of clauses intially in UL: 8
% 0.22/0.42 percentage of distinct symbols occuring in initial UL: 77
% 0.22/0.42 percent of all initial clauses that are short: 100
% 0.22/0.42 absolute distinct symbol count: 9
% 0.22/0.42 distinct predicate count: 2
% 0.22/0.42 distinct function count: 3
% 0.22/0.42 distinct constant count: 4
% 0.22/0.42
% 0.22/0.42 ---------- no more Softie stats ----------
% 0.22/0.42
% 0.22/0.42
% 0.22/0.42
% 0.22/0.42 Model 2 (0.00 seconds, 0 Inserts)
% 0.22/0.42
% 0.22/0.42 Stopped by limit on number of solutions
% 0.22/0.42
% 0.22/0.42 =========== start of search ===========
% 0.22/0.49
% 0.22/0.49 -------- PROOF --------
% 0.22/0.49 % SZS status Theorem
% 0.22/0.49 % SZS output start Refutation
% 0.22/0.49
% 0.22/0.49 Model 3 (0.00 seconds, 0 Inserts)
% 0.22/0.49
% 0.22/0.49 Stopped by limit on number of solutions
% 0.22/0.49
% 0.22/0.49 Model 4 (0.00 seconds, 0 Inserts)
% 0.22/0.49
% 0.22/0.49 Stopped by limit on number of solutions
% 0.22/0.49
% 0.22/0.49 Model 5 (0.00 seconds, 0 Inserts)
% 0.22/0.49
% 0.22/0.49 Stopped by limit on number of solutions
% 0.22/0.49
% 0.22/0.49 Model 6 (0.00 seconds, 0 Inserts)
% 0.22/0.49
% 0.22/0.49 Stopped by limit on number of solutions
% 0.22/0.49
% 0.22/0.49 Model 7 (0.00 seconds, 0 Inserts)
% 0.22/0.49
% 0.22/0.49 Stopped by limit on number of solutions
% 0.22/0.49
% 0.22/0.49 Model 8 (0.00 seconds, 0 Inserts)
% 0.22/0.49
% 0.22/0.49 Stopped by limit on number of solutions
% 0.22/0.49
% 0.22/0.49 Model 9 (0.00 seconds, 0 Inserts)
% 0.22/0.49
% 0.22/0.49 Stopped by limit on number of solutions
% 0.22/0.49
% 0.22/0.49 Model 10 (0.00 seconds, 0 Inserts)
% 0.22/0.49
% 0.22/0.49 Stopped by limit on number of solutions
% 0.22/0.49
% 0.22/0.49 Model 11 (0.00 seconds, 0 Inserts)
% 0.22/0.49
% 0.22/0.49 Stopped by limit on number of solutions
% 0.22/0.49
% 0.22/0.49 ----> UNIT CONFLICT at 0.08 sec ----> 70 [binary,68.1,40.1] {-} $F.
% 0.22/0.49
% 0.22/0.49 Length of proof is 2. Level of proof is 1.
% 0.22/0.49
% 0.22/0.49 ---------------- PROOF ----------------
% 0.22/0.49 % SZS status Theorem
% 0.22/0.49 % SZS output start Refutation
% 0.22/0.49
% 0.22/0.49 3 [] {+} addition(domain($c2),multiplication(domain($c2),domain($c1)))!=domain($c2).
% 0.22/0.49 4 [] {+} addition(A,B)=addition(B,A).
% 0.22/0.49 16,15 [] {+} multiplication(A,one)=A.
% 0.22/0.49 19 [] {+} multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 0.22/0.49 32 [] {+} addition(domain(A),one)=one.
% 0.22/0.49 40 [para_from,4.1.1,3.1.1] {+} addition(multiplication(domain($c2),domain($c1)),domain($c2))!=domain($c2).
% 0.22/0.49 68 [para_from,32.1.1,19.1.1.2,demod,16,16,flip.1] {-} addition(multiplication(A,domain(B)),A)=A.
% 0.22/0.49 70 [binary,68.1,40.1] {-} $F.
% 0.22/0.49
% 0.22/0.49 % SZS output end Refutation
% 0.22/0.49 ------------ end of proof -------------
% 0.22/0.49
% 0.22/0.49
% 0.22/0.49 Search stopped by max_proofs option.
% 0.22/0.49
% 0.22/0.49
% 0.22/0.49 Search stopped by max_proofs option.
% 0.22/0.49
% 0.22/0.49 ============ end of search ============
% 0.22/0.49
% 0.22/0.49 ----------- soft-scott stats ----------
% 0.22/0.49
% 0.22/0.49 true clauses given 6 (33.3%)
% 0.22/0.49 false clauses given 12
% 0.22/0.49
% 0.22/0.49 FALSE TRUE
% 0.22/0.49 6 0 3
% 0.22/0.49 8 0 2
% 0.22/0.49 9 0 1
% 0.22/0.49 10 1 0
% 0.22/0.49 11 1 5
% 0.22/0.49 12 0 3
% 0.22/0.49 13 1 0
% 0.22/0.49 14 2 0
% 0.22/0.49 tot: 5 14 (73.7% true)
% 0.22/0.49
% 0.22/0.49
% 0.22/0.49 Model 11 (0.00 seconds, 0 Inserts)
% 0.22/0.49
% 0.22/0.49 That finishes the proof of the theorem.
% 0.22/0.49
% 0.22/0.49 Process 16510 finished Thu Jun 16 12:19:35 2022
%------------------------------------------------------------------------------