%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL207-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n008.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.54s 5.71s
% Output : Refutation 5.54s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL207-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n008.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 : Mon Jul 4 18:05:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n008.cluster.edu,
% 0.12/0.35 Mon Jul 4 18:05:38 2022
% 0.12/0.35 The command was "./sos". The process ID is 7437.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.12/0.35
% 0.12/0.35 This is a Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix and hyper_res, with positive clauses in
% 0.12/0.35 sos and nonpositive clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: clear(order_hyper).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.20/0.39
% 0.20/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 -------------- Softie stats --------------
% 0.20/0.39
% 0.20/0.39 UPDATE_STOP: 300
% 0.20/0.39 SFINDER_TIME_LIMIT: 2
% 0.20/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.39 number of clauses in intial UL: 3
% 0.20/0.39 number of clauses initially in problem: 11
% 0.20/0.39 percentage of clauses intially in UL: 27
% 0.20/0.39 percentage of distinct symbols occuring in initial UL: 75
% 0.20/0.39 percent of all initial clauses that are short: 100
% 0.20/0.39 absolute distinct symbol count: 8
% 0.20/0.39 distinct predicate count: 3
% 0.20/0.39 distinct function count: 3
% 0.20/0.39 distinct constant count: 2
% 0.20/0.39
% 0.20/0.39 ---------- no more Softie stats ----------
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39 =========== start of search ===========
% 5.44/5.60
% 5.44/5.60
% 5.44/5.60 Changing weight limit from 60 to 58.
% 5.44/5.60
% 5.44/5.60 Model 3 (0.00 seconds, 0 Inserts)
% 5.44/5.60
% 5.44/5.60 Stopped by limit on number of solutions
% 5.44/5.60
% 5.44/5.60 Model 4 (0.00 seconds, 0 Inserts)
% 5.44/5.60
% 5.44/5.60 Stopped by limit on number of solutions
% 5.44/5.60
% 5.44/5.60 Stopped by limit on insertions
% 5.44/5.60
% 5.44/5.60 Model 5 [ 21 0 113 ] (0.00 seconds, 250000 Inserts)
% 5.44/5.60
% 5.44/5.60 Stopped by limit on insertions
% 5.44/5.60
% 5.44/5.60 Model 6 [ 1 1 9359 ] (0.00 seconds, 250000 Inserts)
% 5.44/5.60
% 5.44/5.60 Stopped by limit on insertions
% 5.44/5.60
% 5.44/5.60 Stopped by limit on insertions
% 5.44/5.60
% 5.44/5.60 Model 7 [ 30 1 2244 ] (0.00 seconds, 250000 Inserts)
% 5.44/5.60
% 5.44/5.60 Stopped by limit on insertions
% 5.44/5.60
% 5.44/5.60 Model 8 [ 1 0 100 ] (0.00 seconds, 250000 Inserts)
% 5.44/5.60
% 5.44/5.60 Stopped by limit on insertions
% 5.44/5.60
% 5.44/5.60 Model 9 [ 1 0 688 ] (0.00 seconds, 250000 Inserts)
% 5.44/5.60
% 5.44/5.60 Stopped by limit on insertions
% 5.44/5.60
% 5.44/5.60 Model 10 [ 1 2 28829 ] (0.00 seconds, 250000 Inserts)
% 5.44/5.60
% 5.44/5.60 Stopped by limit on insertions
% 5.44/5.60
% 5.44/5.60 Model 11 [ 2 1 174 ] (0.00 seconds, 250000 Inserts)
% 5.44/5.60
% 5.44/5.60 Stopped by limit on insertions
% 5.44/5.60
% 5.44/5.60 Model 12 [ 2 0 1987 ] (0.00 seconds, 250000 Inserts)
% 5.44/5.60
% 5.44/5.60 Stopped by limit on insertions
% 5.44/5.60
% 5.44/5.60 Model 13 [ 37 2 10915 ] (0.00 seconds, 250000 Inserts)
% 5.44/5.60
% 5.44/5.60 Stopped by limit on insertions
% 5.44/5.60
% 5.44/5.60 Model 14 [ 2 1 728 ] (0.00 seconds, 250000 Inserts)
% 5.44/5.60
% 5.44/5.60 Stopped by limit on insertions
% 5.44/5.60
% 5.44/5.60 Model 15 [ 6 0 1466 ] (0.00 seconds, 250000 Inserts)
% 5.44/5.60
% 5.44/5.60 Stopped by limit on insertions
% 5.44/5.60
% 5.44/5.60 Model 16 [ 36 1 2960 ] (0.00 seconds, 250000 Inserts)
% 5.44/5.60
% 5.44/5.60 Stopped by limit on insertions
% 5.44/5.60
% 5.44/5.60 Model 17 [ 3 1 384 ] (0.00 seconds, 250000 Inserts)
% 5.44/5.60
% 5.44/5.60 Resetting weight limit to 58 after 230 givens.
% 5.44/5.60
% 5.54/5.71
% 5.54/5.71 -------- PROOF --------
% 5.54/5.71 % SZS status Unsatisfiable
% 5.54/5.71 % SZS output start Refutation
% 5.54/5.71
% 5.54/5.71 ----> UNIT CONFLICT at 5.31 sec ----> 5071 [binary,5070.1,3.1] {-} $F.
% 5.54/5.71
% 5.54/5.71 Length of proof is 27. Level of proof is 15.
% 5.54/5.71
% 5.54/5.71 ---------------- PROOF ----------------
% 5.54/5.71 % SZS status Unsatisfiable
% 5.54/5.71 % SZS output start Refutation
% 5.54/5.71
% 5.54/5.71 1 [] {+} theorem(A)| -axiom(A).
% 5.54/5.71 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 5.54/5.71 3 [] {+} -theorem(implies(not(implies(p,q)),implies(q,p))).
% 5.54/5.71 4 [] {+} axiom(implies(or(A,A),A)).
% 5.54/5.71 5 [] {+} axiom(implies(A,or(B,A))).
% 5.54/5.71 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 5.54/5.71 7 [] {-} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 5.54/5.71 8 [] {+} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 5.54/5.71 9 [] {-} implies(A,B)=or(not(A),B).
% 5.54/5.71 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 5.54/5.71 13 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 5.54/5.71 14 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 5.54/5.71 15 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 5.54/5.71 18 [para_from,10.1.1,5.1.1.2] {-} axiom(implies(A,implies(B,A))).
% 5.54/5.71 20 [hyper,7,1] {+} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 5.54/5.71 24 [hyper,18,1] {+} theorem(implies(A,implies(B,A))).
% 5.54/5.71 28 [para_into,15.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 5.54/5.71 29 [para_into,15.1.1.2,10.1.1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 5.54/5.71 30 [hyper,8,1] {+} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 5.54/5.71 59 [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.54/5.71 129 [hyper,28,2,24] {+} theorem(or(implies(A,B),not(B))).
% 5.54/5.71 146 [hyper,129,2,14] {+} theorem(or(A,or(implies(B,C),not(C)))).
% 5.54/5.71 155 [hyper,30,2,29] {-} theorem(implies(or(A,or(B,not(C))),or(A,implies(C,B)))).
% 5.54/5.71 469 [para_into,155.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,not(C))),implies(A,implies(C,B)))).
% 5.54/5.71 521 [hyper,146,2,20] {-} theorem(or(implies(A,B),or(C,not(B)))).
% 5.54/5.71 540 [hyper,469,2,14] {+} theorem(implies(not(A),implies(A,B))).
% 5.54/5.71 550 [hyper,540,2,30] {-} theorem(implies(or(A,not(B)),or(A,implies(B,C)))).
% 5.54/5.71 801 [hyper,521,2,155] {+} theorem(or(implies(A,B),implies(B,C))).
% 5.54/5.71 825 [hyper,801,2,13] {+} theorem(implies(A,A)).
% 5.54/5.71 920 [hyper,825,2,28] {+} theorem(or(A,not(A))).
% 5.54/5.71 1546 [hyper,550,2,920] {+} theorem(or(A,implies(A,B))).
% 5.54/5.71 1617 [para_into,1546.1.1,10.1.1] {+} theorem(implies(A,implies(not(A),B))).
% 5.54/5.71 1638 [hyper,1617,2,30] {-} theorem(implies(or(A,B),or(A,implies(not(B),C)))).
% 5.54/5.71 4965 [hyper,1638,2,1546] {-} theorem(or(A,implies(not(implies(A,B)),C))).
% 5.54/5.71 5011 [hyper,4965,2,59] {-} theorem(implies(not(implies(A,B)),or(A,C))).
% 5.54/5.71 5070 [hyper,5011,2,469] {-} theorem(implies(not(implies(A,B)),implies(C,A))).
% 5.54/5.71 5071 [binary,5070.1,3.1] {-} $F.
% 5.54/5.71
% 5.54/5.71 % SZS output end Refutation
% 5.54/5.71 ------------ end of proof -------------
% 5.54/5.71
% 5.54/5.71
% 5.54/5.71 Search stopped by max_proofs option.
% 5.54/5.71
% 5.54/5.71
% 5.54/5.71 Search stopped by max_proofs option.
% 5.54/5.71
% 5.54/5.71 ============ end of search ============
% 5.54/5.71
% 5.54/5.71 ----------- soft-scott stats ----------
% 5.54/5.71
% 5.54/5.71 true clauses given 72 (27.9%)
% 5.54/5.71 false clauses given 186
% 5.54/5.71
% 5.54/5.71 FALSE TRUE
% 5.54/5.71 8 0 36
% 5.54/5.71 9 1 68
% 5.54/5.71 10 1 183
% 5.54/5.71 11 91 190
% 5.54/5.71 12 133 219
% 5.54/5.71 13 284 176
% 5.54/5.71 14 362 114
% 5.54/5.71 15 369 65
% 5.54/5.71 16 327 78
% 5.54/5.71 17 224 37
% 5.54/5.71 18 151 65
% 5.54/5.71 19 57 45
% 5.54/5.71 20 85 73
% 5.54/5.71 21 41 18
% 5.54/5.71 22 106 73
% 5.54/5.71 23 31 26
% 5.54/5.71 24 139 28
% 5.54/5.71 25 60 0
% 5.54/5.71 26 76 23
% 5.54/5.71 27 0 4
% 5.54/5.71 28 1 9
% 5.54/5.71 29 0 4
% 5.54/5.71 30 1 15
% 5.54/5.71 31 1 9
% 5.54/5.71 32 2 11
% 5.54/5.71 34 2 10
% 5.54/5.71 38 0 4
% 5.54/5.71 39 0 4
% 5.54/5.71 40 0 8
% 5.54/5.71 42 0 8
% 5.54/5.71 54 0 1
% 5.54/5.71 55 0 1
% 5.54/5.71 56 0 2
% 5.54/5.71 58 0 2
% 5.54/5.71 tot: 2545 1609 (38.7% true)
% 5.54/5.71
% 5.54/5.71
% 5.54/5.71 Model 17 [ 3 1 384 ] (0.00 seconds, 250000 Inserts)
% 5.54/5.71
% 5.54/5.71 That finishes the proof of the theorem.
% 5.54/5.71
% 5.54/5.71 Process 7437 finished Mon Jul 4 18:05:43 2022
%------------------------------------------------------------------------------