%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL196-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n004.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 14:28:34 EDT 2022
% Result : Unsatisfiable 5.92s 6.10s
% Output : Refutation 5.92s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL196-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n004.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 : Sun Jul 3 22:46:08 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 sandbox2 on n004.cluster.edu,
% 0.12/0.36 Sun Jul 3 22:46:08 2022
% 0.12/0.36 The command was "./sos". The process ID is 1370.
% 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 list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 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 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.12/0.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 -------------- Softie stats --------------
% 0.12/0.39
% 0.12/0.39 UPDATE_STOP: 300
% 0.12/0.39 SFINDER_TIME_LIMIT: 2
% 0.12/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39 number of clauses in intial UL: 3
% 0.12/0.39 number of clauses initially in problem: 11
% 0.12/0.39 percentage of clauses intially in UL: 27
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 75
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 8
% 0.12/0.39 distinct predicate count: 3
% 0.12/0.39 distinct function count: 3
% 0.12/0.39 distinct constant count: 2
% 0.12/0.39
% 0.12/0.39 ---------- no more Softie stats ----------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39 =========== start of search ===========
% 5.62/5.81
% 5.62/5.81
% 5.62/5.81 Changing weight limit from 60 to 20.
% 5.62/5.81
% 5.62/5.81 Model 3 (0.00 seconds, 0 Inserts)
% 5.62/5.81
% 5.62/5.81 Stopped by limit on number of solutions
% 5.62/5.81
% 5.62/5.81 Model 4 (0.00 seconds, 0 Inserts)
% 5.62/5.81
% 5.62/5.81 Stopped by limit on number of solutions
% 5.62/5.81
% 5.62/5.81 Stopped by limit on insertions
% 5.62/5.81
% 5.62/5.81 Model 5 [ 1 1 6851 ] (0.00 seconds, 250000 Inserts)
% 5.62/5.81
% 5.62/5.81 Stopped by limit on insertions
% 5.62/5.81
% 5.62/5.81 Model 6 [ 22 2 20263 ] (0.00 seconds, 250000 Inserts)
% 5.62/5.81
% 5.62/5.81 Stopped by limit on insertions
% 5.62/5.81
% 5.62/5.81 Model 7 [ 2 2 32536 ] (0.00 seconds, 250000 Inserts)
% 5.62/5.81
% 5.62/5.81 Stopped by limit on insertions
% 5.62/5.81
% 5.62/5.81 Model 8 [ 22 11 186917 ] (0.00 seconds, 250000 Inserts)
% 5.62/5.81
% 5.62/5.81 Stopped by limit on insertions
% 5.62/5.81
% 5.62/5.81 Stopped by limit on insertions
% 5.62/5.81
% 5.62/5.81 Model 9 [ 24 10 57182 ] (0.00 seconds, 250000 Inserts)
% 5.62/5.81
% 5.62/5.81 Stopped by limit on insertions
% 5.62/5.81
% 5.62/5.81 Model 10 [ 1 0 773 ] (0.00 seconds, 250000 Inserts)
% 5.62/5.81
% 5.62/5.81 Stopped by limit on insertions
% 5.62/5.81
% 5.62/5.81 Stopped by limit on insertions
% 5.62/5.81
% 5.62/5.81 Model 11 [ 1 25 155162 ] (0.00 seconds, 250000 Inserts)
% 5.62/5.81
% 5.62/5.81 Stopped by limit on insertions
% 5.62/5.81
% 5.62/5.81 Model 12 [ 30 1 1834 ] (0.00 seconds, 250000 Inserts)
% 5.62/5.81
% 5.62/5.81 Stopped by limit on insertions
% 5.62/5.81
% 5.62/5.81 Model 13 [ 1 46 150248 ] (0.00 seconds, 250000 Inserts)
% 5.62/5.81
% 5.62/5.81 Stopped by limit on insertions
% 5.62/5.81
% 5.62/5.81 Model 14 [ 4 1 638 ] (0.00 seconds, 250000 Inserts)
% 5.62/5.81
% 5.62/5.81 Stopped by limit on insertions
% 5.62/5.81
% 5.62/5.81 Model 15 [ 2 1 570 ] (0.00 seconds, 250000 Inserts)
% 5.62/5.81
% 5.62/5.81 Resetting weight limit to 20 after 220 givens.
% 5.62/5.81
% 5.65/5.84
% 5.65/5.84
% 5.65/5.84 Changing weight limit from 20 to 19.
% 5.65/5.84
% 5.65/5.84 Resetting weight limit to 19 after 225 givens.
% 5.65/5.84
% 5.65/5.86
% 5.65/5.86
% 5.65/5.86 Changing weight limit from 19 to 18.
% 5.65/5.86
% 5.65/5.86 Resetting weight limit to 18 after 230 givens.
% 5.65/5.86
% 5.92/6.10
% 5.92/6.10 -------- PROOF --------
% 5.92/6.10 % SZS status Unsatisfiable
% 5.92/6.10 % SZS output start Refutation
% 5.92/6.10
% 5.92/6.10 ----> UNIT CONFLICT at 5.72 sec ----> 6018 [binary,6017.1,3.1] {-} $F.
% 5.92/6.10
% 5.92/6.10 Length of proof is 27. Level of proof is 13.
% 5.92/6.10
% 5.92/6.10 ---------------- PROOF ----------------
% 5.92/6.10 % SZS status Unsatisfiable
% 5.92/6.10 % SZS output start Refutation
% 5.92/6.10
% 5.92/6.10 1 [] {+} theorem(A)| -axiom(A).
% 5.92/6.10 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 5.92/6.10 3 [] {+} -theorem(implies(or(p,or(p,q)),or(p,q))).
% 5.92/6.10 4 [] {+} axiom(implies(or(A,A),A)).
% 5.92/6.10 5 [] {+} axiom(implies(A,or(B,A))).
% 5.92/6.10 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 5.92/6.10 7 [] {-} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 5.92/6.10 8 [] {-} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 5.92/6.10 9 [] {-} implies(A,B)=or(not(A),B).
% 5.92/6.10 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 5.92/6.10 13 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 5.92/6.10 14 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 5.92/6.10 15 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 5.92/6.10 20 [hyper,7,1] {-} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 5.92/6.10 30 [hyper,8,1] {-} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 5.92/6.10 38 [para_into,15.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 5.92/6.10 39 [para_into,15.1.1.2,10.1.1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 5.92/6.10 57 [para_into,20.1.1.1.2,10.1.1,demod,11] {-} theorem(implies(or(A,implies(B,C)),implies(B,or(A,C)))).
% 5.92/6.10 58 [para_into,20.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 5.92/6.10 69 [hyper,30,2,30] {-} theorem(implies(or(A,implies(B,C)),or(A,implies(or(D,B),or(D,C))))).
% 5.92/6.10 72 [hyper,30,2,39] {-} theorem(implies(or(A,or(B,not(C))),or(A,implies(C,B)))).
% 5.92/6.10 77 [hyper,30,2,14] {-} theorem(implies(or(A,B),or(A,or(C,B)))).
% 5.92/6.10 78 [hyper,30,2,13] {-} theorem(implies(or(A,or(B,B)),or(A,B))).
% 5.92/6.10 97 [para_into,78.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,or(B,B)),implies(A,B))).
% 5.92/6.10 199 [hyper,58,2,14] {+} theorem(or(A,implies(B,B))).
% 5.92/6.10 216 [hyper,199,2,13] {+} theorem(implies(A,A)).
% 5.92/6.10 219 [hyper,216,2,58] {+} theorem(or(A,implies(or(A,B),B))).
% 5.92/6.10 430 [hyper,38,2,216] {+} theorem(or(A,not(A))).
% 5.92/6.10 479 [hyper,430,2,77] {+} theorem(or(A,or(B,not(A)))).
% 5.92/6.10 2868 [hyper,72,2,479] {+} theorem(or(A,implies(A,B))).
% 5.92/6.10 3100 [hyper,2868,2,69] {-} theorem(or(A,implies(or(B,A),or(B,C)))).
% 5.92/6.10 3145 [hyper,3100,2,57] {-} theorem(implies(or(A,B),or(B,or(A,C)))).
% 5.92/6.10 3205 [hyper,3145,2,219] {-} theorem(or(implies(or(A,B),B),or(A,C))).
% 5.92/6.10 3465 [hyper,3205,2,15] {-} theorem(or(or(A,B),implies(or(A,C),C))).
% 5.92/6.10 3886 [hyper,3465,2,57] {-} theorem(implies(or(A,B),or(or(A,C),B))).
% 5.92/6.10 6017 [hyper,97,2,3886] {-} theorem(implies(or(A,or(A,B)),or(A,B))).
% 5.92/6.10 6018 [binary,6017.1,3.1] {-} $F.
% 5.92/6.10
% 5.92/6.10 % SZS output end Refutation
% 5.92/6.10 ------------ end of proof -------------
% 5.92/6.10
% 5.92/6.10
% 5.92/6.10 Search stopped by max_proofs option.
% 5.92/6.10
% 5.92/6.10
% 5.92/6.10 Search stopped by max_proofs option.
% 5.92/6.10
% 5.92/6.10 ============ end of search ============
% 5.92/6.10
% 5.92/6.10 ----------- soft-scott stats ----------
% 5.92/6.10
% 5.92/6.10 true clauses given 90 (32.0%)
% 5.92/6.10 false clauses given 191
% 5.92/6.10
% 5.92/6.10 FALSE TRUE
% 5.92/6.10 8 0 57
% 5.92/6.10 9 0 133
% 5.92/6.10 10 0 263
% 5.92/6.10 11 35 223
% 5.92/6.10 12 584 520
% 5.92/6.10 13 529 48
% 5.92/6.10 14 804 204
% 5.92/6.10 15 613 26
% 5.92/6.10 16 8 105
% 5.92/6.10 17 81 2
% 5.92/6.10 18 63 42
% 5.92/6.10 tot: 2717 1623 (37.4% true)
% 5.92/6.10
% 5.92/6.10
% 5.92/6.10 Model 15 [ 2 1 570 ] (0.00 seconds, 250000 Inserts)
% 5.92/6.10
% 5.92/6.10 That finishes the proof of the theorem.
% 5.92/6.10
% 5.92/6.10 Process 1370 finished Sun Jul 3 22:46:13 2022
%------------------------------------------------------------------------------