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