%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KLE058+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n029.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.22s 0.50s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : KLE058+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.14 % Command : sos-script %s
% 0.14/0.36 % Computer : n029.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Thu Jun 16 14:31:57 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.38 ----- Otter 3.2, August 2001 -----
% 0.14/0.38 The process was started by sandbox on n029.cluster.edu,
% 0.14/0.38 Thu Jun 16 14:31:57 2022
% 0.14/0.38 The command was "./sos". The process ID is 25885.
% 0.14/0.38
% 0.14/0.38 set(prolog_style_variables).
% 0.14/0.38 set(auto).
% 0.14/0.38 dependent: set(auto1).
% 0.14/0.38 dependent: set(process_input).
% 0.14/0.38 dependent: clear(print_kept).
% 0.14/0.38 dependent: clear(print_new_demod).
% 0.14/0.38 dependent: clear(print_back_demod).
% 0.14/0.38 dependent: clear(print_back_sub).
% 0.14/0.38 dependent: set(control_memory).
% 0.14/0.38 dependent: assign(max_mem, 12000).
% 0.14/0.38 dependent: assign(pick_given_ratio, 4).
% 0.14/0.38 dependent: assign(stats_level, 1).
% 0.14/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.38 dependent: assign(sos_limit, 5000).
% 0.14/0.38 dependent: assign(max_weight, 60).
% 0.14/0.38 clear(print_given).
% 0.14/0.38
% 0.14/0.38 formula_list(usable).
% 0.14/0.38
% 0.14/0.38 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 0.14/0.38
% 0.14/0.38 This is a Horn set with equality. The strategy will be
% 0.14/0.38 Knuth-Bendix and hyper_res, with positive clauses in
% 0.14/0.38 sos and nonpositive clauses in usable.
% 0.14/0.38
% 0.14/0.38 dependent: set(knuth_bendix).
% 0.14/0.38 dependent: set(para_from).
% 0.14/0.38 dependent: set(para_into).
% 0.14/0.38 dependent: clear(para_from_right).
% 0.14/0.38 dependent: clear(para_into_right).
% 0.14/0.38 dependent: set(para_from_vars).
% 0.14/0.38 dependent: set(eq_units_both_ways).
% 0.14/0.38 dependent: set(dynamic_demod_all).
% 0.14/0.38 dependent: set(dynamic_demod).
% 0.14/0.38 dependent: set(order_eq).
% 0.14/0.38 dependent: set(back_demod).
% 0.14/0.38 dependent: set(lrpo).
% 0.14/0.38 dependent: set(hyper_res).
% 0.14/0.38 dependent: clear(order_hyper).
% 0.14/0.38
% 0.14/0.38 ------------> process usable:
% 0.14/0.38
% 0.14/0.38 ------------> process sos:
% 0.14/0.38 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] {-} addition(A,B)=addition(B,A).
% 0.14/0.38 Following clause subsumed by 38 during input processing: 0 [copy,38,flip.1] {-} A=A.
% 0.14/0.38
% 0.14/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: 71
% 0.22/0.42 percent of all initial clauses that are short: 100
% 0.22/0.42 absolute distinct symbol count: 7
% 0.22/0.42 distinct predicate count: 2
% 0.22/0.42 distinct function count: 3
% 0.22/0.42 distinct constant count: 2
% 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.50
% 0.22/0.50 -------- PROOF --------
% 0.22/0.50 % SZS status Theorem
% 0.22/0.50 % SZS output start Refutation
% 0.22/0.50
% 0.22/0.50 Model 3 (0.00 seconds, 0 Inserts)
% 0.22/0.50
% 0.22/0.50 Stopped by limit on number of solutions
% 0.22/0.50
% 0.22/0.50 Model 4 (0.00 seconds, 0 Inserts)
% 0.22/0.50
% 0.22/0.50 Stopped by limit on number of solutions
% 0.22/0.50
% 0.22/0.50 Model 5 (0.00 seconds, 0 Inserts)
% 0.22/0.50
% 0.22/0.50 Stopped by limit on number of solutions
% 0.22/0.50
% 0.22/0.50 Model 6 (0.00 seconds, 0 Inserts)
% 0.22/0.50
% 0.22/0.50 Stopped by limit on number of solutions
% 0.22/0.50
% 0.22/0.50 Model 7 (0.00 seconds, 0 Inserts)
% 0.22/0.50
% 0.22/0.50 Stopped by limit on number of solutions
% 0.22/0.50
% 0.22/0.50 Model 8 (0.00 seconds, 0 Inserts)
% 0.22/0.50
% 0.22/0.50 Stopped by limit on number of solutions
% 0.22/0.50
% 0.22/0.50 Model 9 (0.00 seconds, 0 Inserts)
% 0.22/0.50
% 0.22/0.50 Stopped by limit on number of solutions
% 0.22/0.50
% 0.22/0.50 Model 10 (0.00 seconds, 0 Inserts)
% 0.22/0.50
% 0.22/0.50 Stopped by limit on number of solutions
% 0.22/0.50
% 0.22/0.50 Model 11 (0.00 seconds, 0 Inserts)
% 0.22/0.50
% 0.22/0.50 Stopped by limit on number of solutions
% 0.22/0.50
% 0.22/0.50 Model 12 [ 1 1 11240 ] (0.00 seconds, 11895 Inserts)
% 0.22/0.50
% 0.22/0.50 ----> UNIT CONFLICT at 0.09 sec ----> 96 [binary,94.1,3.1] {-} $F.
% 0.22/0.50
% 0.22/0.50 Length of proof is 2. Level of proof is 2.
% 0.22/0.50
% 0.22/0.50 ---------------- PROOF ----------------
% 0.22/0.50 % SZS status Theorem
% 0.22/0.50 % SZS output start Refutation
% 0.22/0.50
% 0.22/0.50 3 [] {+} domain(one)!=one.
% 0.22/0.50 4 [] {+} addition(A,B)=addition(B,A).
% 0.22/0.50 16,15 [] {+} multiplication(A,one)=A.
% 0.22/0.50 27 [] {+} addition(A,multiplication(domain(A),A))=multiplication(domain(A),A).
% 0.22/0.50 32 [] {+} addition(domain(A),one)=one.
% 0.22/0.50 61,60 [para_into,32.1.1,4.1.1] {-} addition(one,domain(A))=one.
% 0.22/0.50 94 [para_into,27.1.1.2,15.1.1,demod,61,16,flip.1] {-} domain(one)=one.
% 0.22/0.50 96 [binary,94.1,3.1] {-} $F.
% 0.22/0.50
% 0.22/0.50 % SZS output end Refutation
% 0.22/0.50 ------------ end of proof -------------
% 0.22/0.50
% 0.22/0.50
% 0.22/0.50 Search stopped by max_proofs option.
% 0.22/0.50
% 0.22/0.50
% 0.22/0.50 Search stopped by max_proofs option.
% 0.22/0.50
% 0.22/0.50 ============ end of search ============
% 0.22/0.50
% 0.22/0.50 ----------- soft-scott stats ----------
% 0.22/0.50
% 0.22/0.50 true clauses given 7 (31.8%)
% 0.22/0.50 false clauses given 15
% 0.22/0.50
% 0.22/0.50 FALSE TRUE
% 0.22/0.50 4 1 0
% 0.22/0.50 6 2 3
% 0.22/0.50 8 2 4
% 0.22/0.50 9 0 1
% 0.22/0.50 10 1 0
% 0.22/0.50 11 1 4
% 0.22/0.50 12 0 4
% 0.22/0.50 14 5 0
% 0.22/0.50 31 0 2
% 0.22/0.50 tot: 12 18 (60.0% true)
% 0.22/0.50
% 0.22/0.50
% 0.22/0.50 Model 12 [ 1 1 11240 ] (0.00 seconds, 11895 Inserts)
% 0.22/0.50
% 0.22/0.50 That finishes the proof of the theorem.
% 0.22/0.50
% 0.22/0.50 Process 25885 finished Thu Jun 16 14:31:57 2022
%------------------------------------------------------------------------------