%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL206-3 : TPTP v8.1.0. Bugfixed v2.4.1.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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:40 EDT 2022
% Result : Unsatisfiable 5.27s 5.49s
% Output : Refutation 5.27s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL206-3 : TPTP v8.1.0. Bugfixed v2.4.1.
% 0.03/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jul 3 03:13:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox2 on n026.cluster.edu,
% 0.13/0.35 Sun Jul 3 03:13:06 2022
% 0.13/0.35 The command was "./sos". The process ID is 32421.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.13/0.35
% 0.13/0.35 This is a Horn set with equality. The strategy will be
% 0.13/0.35 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.35 sos and nonpositive clauses in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(knuth_bendix).
% 0.13/0.35 dependent: set(para_from).
% 0.13/0.35 dependent: set(para_into).
% 0.13/0.35 dependent: clear(para_from_right).
% 0.13/0.35 dependent: clear(para_into_right).
% 0.13/0.35 dependent: set(para_from_vars).
% 0.13/0.35 dependent: set(eq_units_both_ways).
% 0.13/0.35 dependent: set(dynamic_demod_all).
% 0.13/0.35 dependent: set(dynamic_demod).
% 0.13/0.35 dependent: set(order_eq).
% 0.13/0.35 dependent: set(back_demod).
% 0.13/0.35 dependent: set(lrpo).
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: clear(order_hyper).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.18/0.39
% 0.18/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.39
% 0.18/0.39 Stopped by limit on number of solutions
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 -------------- Softie stats --------------
% 0.18/0.39
% 0.18/0.39 UPDATE_STOP: 300
% 0.18/0.39 SFINDER_TIME_LIMIT: 2
% 0.18/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.39 number of clauses in intial UL: 3
% 0.18/0.39 number of clauses initially in problem: 11
% 0.18/0.39 percentage of clauses intially in UL: 27
% 0.18/0.39 percentage of distinct symbols occuring in initial UL: 75
% 0.18/0.39 percent of all initial clauses that are short: 100
% 0.18/0.39 absolute distinct symbol count: 8
% 0.18/0.39 distinct predicate count: 3
% 0.18/0.39 distinct function count: 3
% 0.18/0.39 distinct constant count: 2
% 0.18/0.39
% 0.18/0.39 ---------- no more Softie stats ----------
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.39
% 0.18/0.39 Stopped by limit on number of solutions
% 0.18/0.39
% 0.18/0.39 =========== start of search ===========
% 4.44/4.64
% 4.44/4.64
% 4.44/4.64 Changing weight limit from 60 to 30.
% 4.44/4.64
% 4.44/4.64 Model 3 (0.00 seconds, 0 Inserts)
% 4.44/4.64
% 4.44/4.64 Stopped by limit on number of solutions
% 4.44/4.64
% 4.44/4.64 Model 4 (0.00 seconds, 0 Inserts)
% 4.44/4.64
% 4.44/4.64 Stopped by limit on number of solutions
% 4.44/4.64
% 4.44/4.64 Stopped by limit on insertions
% 4.44/4.64
% 4.44/4.64 Model 5 [ 1 1 3585 ] (0.00 seconds, 250000 Inserts)
% 4.44/4.64
% 4.44/4.64 Stopped by limit on insertions
% 4.44/4.64
% 4.44/4.64 Model 6 [ 1 1 15854 ] (0.00 seconds, 250000 Inserts)
% 4.44/4.64
% 4.44/4.64 Stopped by limit on insertions
% 4.44/4.64
% 4.44/4.64 Model 7 [ 1 3 49997 ] (0.00 seconds, 250000 Inserts)
% 4.44/4.64
% 4.44/4.64 Stopped by limit on insertions
% 4.44/4.64
% 4.44/4.64 Model 8 [ 1 1 1469 ] (0.00 seconds, 250000 Inserts)
% 4.44/4.64
% 4.44/4.64 Stopped by limit on insertions
% 4.44/4.64
% 4.44/4.64 Model 9 [ 1 0 262 ] (0.00 seconds, 250000 Inserts)
% 4.44/4.64
% 4.44/4.64 Stopped by limit on insertions
% 4.44/4.64
% 4.44/4.64 Model 10 [ 1 14 176711 ] (0.00 seconds, 250000 Inserts)
% 4.44/4.64
% 4.44/4.64 Stopped by limit on insertions
% 4.44/4.64
% 4.44/4.64 Model 11 [ 2 0 5280 ] (0.00 seconds, 250000 Inserts)
% 4.44/4.64
% 4.44/4.64 Stopped by limit on insertions
% 4.44/4.64
% 4.44/4.64 Model 12 [ 2 0 324 ] (0.00 seconds, 250000 Inserts)
% 4.44/4.64
% 4.44/4.64 Stopped by limit on insertions
% 4.44/4.64
% 4.44/4.64 Stopped by limit on insertions
% 4.44/4.64
% 4.44/4.64 Stopped by limit on insertions
% 4.44/4.64
% 4.44/4.64 Model 13 [ 3 16 77269 ] (0.00 seconds, 250000 Inserts)
% 4.44/4.64
% 4.44/4.64 Resetting weight limit to 30 after 245 givens.
% 4.44/4.64
% 5.27/5.49
% 5.27/5.49 -------- PROOF --------
% 5.27/5.49 % SZS status Unsatisfiable
% 5.27/5.49 % SZS output start Refutation
% 5.27/5.49
% 5.27/5.49 Modelling stopped after 300 given clauses and 0.00 seconds
% 5.27/5.49
% 5.27/5.49
% 5.27/5.49 ----> UNIT CONFLICT at 5.09 sec ----> 11621 [binary,11620.1,3.1] {-} $F.
% 5.27/5.49
% 5.27/5.49 Length of proof is 31. Level of proof is 13.
% 5.27/5.49
% 5.27/5.49 ---------------- PROOF ----------------
% 5.27/5.49 % SZS status Unsatisfiable
% 5.27/5.49 % SZS output start Refutation
% 5.27/5.49
% 5.27/5.49 1 [] {+} theorem(A)| -axiom(A).
% 5.27/5.49 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 5.27/5.49 3 [] {+} -theorem(implies(not(implies(p,q)),implies(not(p),not(q)))).
% 5.27/5.49 4 [] {+} axiom(implies(or(A,A),A)).
% 5.27/5.49 5 [] {+} axiom(implies(A,or(B,A))).
% 5.27/5.49 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 5.27/5.49 8 [] {-} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 5.27/5.49 9 [] {-} implies(A,B)=or(not(A),B).
% 5.27/5.49 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 5.27/5.49 13 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 5.27/5.49 14 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 5.27/5.49 15 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 5.27/5.49 16 [para_from,10.1.1,6.1.1.1] {-} axiom(implies(implies(A,B),or(B,not(A)))).
% 5.27/5.49 18 [para_from,10.1.1,5.1.1.2] {+} axiom(implies(A,implies(B,A))).
% 5.27/5.49 24 [hyper,18,1] {+} theorem(implies(A,implies(B,A))).
% 5.27/5.49 27 [hyper,8,1] {+} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 5.27/5.49 29 [hyper,16,1] {-} theorem(implies(implies(A,B),or(B,not(A)))).
% 5.27/5.49 39 [hyper,29,2,14] {+} theorem(or(or(A,B),not(B))).
% 5.27/5.49 47 [para_into,15.1.1.2,10.1.1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 5.27/5.49 111 [hyper,27,2,47] {-} theorem(implies(or(A,or(B,not(C))),or(A,implies(C,B)))).
% 5.27/5.49 115 [hyper,27,2,24] {-} theorem(implies(or(A,B),or(A,implies(C,B)))).
% 5.27/5.49 119 [hyper,27,2,14] {-} theorem(implies(or(A,B),or(A,or(C,B)))).
% 5.27/5.49 138 [para_into,111.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,not(C))),implies(A,implies(C,B)))).
% 5.27/5.49 149 [hyper,138,2,14] {+} theorem(implies(not(A),implies(A,B))).
% 5.27/5.49 155 [hyper,149,2,27] {-} theorem(implies(or(A,not(B)),or(A,implies(B,C)))).
% 5.27/5.49 205 [hyper,115,2,39] {-} theorem(or(or(A,B),implies(C,not(B)))).
% 5.27/5.49 211 [hyper,205,2,15] {-} theorem(or(implies(A,not(B)),or(C,B))).
% 5.27/5.49 226 [hyper,211,2,111] {-} theorem(or(implies(A,not(not(B))),implies(B,C))).
% 5.27/5.49 250 [hyper,119,2,39] {-} theorem(or(or(A,B),or(C,not(B)))).
% 5.27/5.49 256 [hyper,250,2,111] {+} theorem(or(or(A,B),implies(B,C))).
% 5.27/5.49 267 [para_into,256.1.1.1,10.1.1] {+} theorem(or(implies(A,B),implies(B,C))).
% 5.27/5.49 315 [hyper,226,2,13] {+} theorem(implies(A,not(not(A)))).
% 5.27/5.49 396 [para_into,155.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,not(B)),implies(A,implies(B,C)))).
% 5.27/5.49 476 [hyper,396,2,315] {-} theorem(implies(A,implies(not(A),B))).
% 5.27/5.49 483 [hyper,476,2,27] {-} theorem(implies(or(A,B),or(A,implies(not(B),C)))).
% 5.27/5.49 1948 [hyper,483,2,267] {-} theorem(or(implies(A,B),implies(not(implies(B,C)),D))).
% 5.27/5.49 1966 [para_into,483.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,B),implies(A,implies(not(B),C)))).
% 5.27/5.49 10226 [hyper,1948,2,13] {-} theorem(implies(not(implies(A,B)),A)).
% 5.27/5.49 11620 [hyper,1966,2,10226] {-} theorem(implies(not(implies(A,B)),implies(not(A),C))).
% 5.27/5.49 11621 [binary,11620.1,3.1] {-} $F.
% 5.27/5.49
% 5.27/5.49 % SZS output end Refutation
% 5.27/5.49 ------------ end of proof -------------
% 5.27/5.49
% 5.27/5.49
% 5.27/5.49 Search stopped by max_proofs option.
% 5.27/5.49
% 5.27/5.49
% 5.27/5.49 Search stopped by max_proofs option.
% 5.27/5.49
% 5.27/5.49 ============ end of search ============
% 5.27/5.49
% 5.27/5.49 ----------- soft-scott stats ----------
% 5.27/5.49
% 5.27/5.49 true clauses given 145 (30.9%)
% 5.27/5.49 false clauses given 325
% 5.27/5.49
% 5.27/5.49 FALSE TRUE
% 5.27/5.49 8 0 16
% 5.27/5.49 9 0 79
% 5.27/5.49 10 0 338
% 5.27/5.49 11 164 216
% 5.27/5.49 12 265 724
% 5.27/5.49 13 1193 187
% 5.27/5.49 14 878 291
% 5.27/5.49 15 0 55
% 5.27/5.49 16 0 95
% 5.27/5.49 17 0 29
% 5.27/5.49 18 0 60
% 5.27/5.49 19 0 6
% 5.27/5.49 20 0 32
% 5.27/5.49 21 0 2
% 5.27/5.49 22 0 14
% 5.27/5.49 23 0 1
% 5.27/5.49 24 0 7
% 5.27/5.49 26 0 8
% 5.27/5.49 28 0 3
% 5.27/5.49 29 0 1
% 5.27/5.49 30 0 3
% 5.27/5.49 tot: 2500 2167 (46.4% true)
% 5.27/5.49
% 5.27/5.49
% 5.27/5.49 Model 13 [ 3 16 77269 ] (0.00 seconds, 250000 Inserts)
% 5.27/5.49
% 5.27/5.49 That finishes the proof of the theorem.
% 5.27/5.49
% 5.27/5.49 Process 32421 finished Sun Jul 3 03:13:11 2022
%------------------------------------------------------------------------------