%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL256-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n014.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:29:10 EDT 2022
% Result : Unsatisfiable 0.81s 1.00s
% Output : Refutation 0.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : LCL256-1 : TPTP v8.1.0. Released v1.1.0.
% 0.08/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 4 20:14:53 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 n014.cluster.edu,
% 0.12/0.35 Mon Jul 4 20:14:53 2022
% 0.12/0.35 The command was "./sos". The process ID is 1126.
% 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=0, symmetry=0, max_lits=3.
% 0.12/0.35
% 0.12/0.35 This is a Horn set without equality. The strategy will
% 0.12/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.35 in usable.
% 0.12/0.35
% 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
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.38
% 0.12/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 -------------- Softie stats --------------
% 0.12/0.38
% 0.12/0.38 UPDATE_STOP: 300
% 0.12/0.38 SFINDER_TIME_LIMIT: 2
% 0.12/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38 number of clauses in intial UL: 2
% 0.12/0.38 number of clauses initially in problem: 5
% 0.12/0.38 percentage of clauses intially in UL: 40
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 4
% 0.12/0.38 distinct predicate count: 1
% 0.12/0.38 distinct function count: 2
% 0.12/0.38 distinct constant count: 1
% 0.12/0.38
% 0.12/0.38 ---------- no more Softie stats ----------
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 =========== start of search ===========
% 0.81/1.00
% 0.81/1.00 -------- PROOF --------
% 0.81/1.00 % SZS status Unsatisfiable
% 0.81/1.00 % SZS output start Refutation
% 0.81/1.00
% 0.81/1.00 Model 2 (0.00 seconds, 0 Inserts)
% 0.81/1.00
% 0.81/1.00 Stopped by limit on number of solutions
% 0.81/1.00
% 0.81/1.00 Model 3 (0.00 seconds, 0 Inserts)
% 0.81/1.00
% 0.81/1.00 Stopped by limit on number of solutions
% 0.81/1.00
% 0.81/1.00 Model 4 (0.00 seconds, 0 Inserts)
% 0.81/1.00
% 0.81/1.00 Stopped by limit on number of solutions
% 0.81/1.00
% 0.81/1.00 Stopped by limit on insertions
% 0.81/1.00
% 0.81/1.00 Model 5 [ 1 0 147 ] (0.00 seconds, 250000 Inserts)
% 0.81/1.00
% 0.81/1.00 Model 6 [ 1 1 52 ] (0.00 seconds, 168022 Inserts)
% 0.81/1.00
% 0.81/1.00 ----> UNIT CONFLICT at 0.62 sec ----> 1805 [binary,1804.1,2.1] {-} $F.
% 0.81/1.00
% 0.81/1.00 Length of proof is 30. Level of proof is 15.
% 0.81/1.00
% 0.81/1.00 ---------------- PROOF ----------------
% 0.81/1.00 % SZS status Unsatisfiable
% 0.81/1.00 % SZS output start Refutation
% 0.81/1.00
% 0.81/1.00 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 0.81/1.00 2 [] {+} -is_a_theorem(not(not(implies(p,p)))).
% 0.81/1.00 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 0.81/1.00 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 0.81/1.00 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 0.81/1.00 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 0.81/1.00 7 [hyper,4,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 0.81/1.00 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 0.81/1.00 12 [hyper,7,1,7] {+} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(not(A),A),B))).
% 0.81/1.00 16 [hyper,7,1,4] {+} is_a_theorem(implies(implies(not(implies(not(A),A)),implies(not(A),A)),A)).
% 0.81/1.00 17 [hyper,7,1,3] {-} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(B,C),implies(A,C)))).
% 0.81/1.00 29 [hyper,9,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 0.81/1.00 34 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 0.81/1.00 40 [hyper,29,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 0.81/1.00 43 [hyper,29,1,3] {+} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).
% 0.81/1.00 57 [hyper,40,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 0.81/1.00 73 [hyper,57,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 0.81/1.00 85 [hyper,73,1,34] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 0.81/1.00 113 [hyper,85,1,4] {+} is_a_theorem(implies(A,implies(B,B))).
% 0.81/1.00 138 [hyper,12,1,85] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 0.81/1.00 183 [hyper,113,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 0.81/1.00 195 [hyper,183,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(D,D),B),C))).
% 0.81/1.00 249 [hyper,138,1,3] {-} is_a_theorem(implies(implies(implies(implies(not(A),A),A),B),implies(C,B))).
% 0.81/1.00 281 [hyper,249,1,6] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 0.81/1.00 580 [hyper,195,1,16] {-} is_a_theorem(implies(implies(implies(A,A),implies(not(B),B)),B)).
% 0.81/1.00 832 [hyper,281,1,281] {-} is_a_theorem(implies(A,implies(implies(B,implies(not(C),C)),implies(B,C)))).
% 0.81/1.00 839 [hyper,281,1,57] {+} is_a_theorem(implies(A,implies(B,implies(C,A)))).
% 0.81/1.00 878 [hyper,839,1,281] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 0.81/1.00 1033 [hyper,878,1,17] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 0.81/1.00 1199 [hyper,832,1,832] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))).
% 0.81/1.00 1214 [hyper,1199,1,1199] {-} is_a_theorem(implies(implies(not(A),implies(not(A),A)),A)).
% 0.81/1.00 1585 [hyper,43,1,1214] {-} is_a_theorem(implies(implies(not(A),not(not(A))),A)).
% 0.81/1.00 1593 [hyper,43,1,580] {-} is_a_theorem(implies(implies(not(A),not(implies(B,B))),A)).
% 0.81/1.00 1754 [hyper,1033,1,1585] {+} is_a_theorem(implies(not(not(A)),A)).
% 0.81/1.00 1804 [hyper,1754,1,1593] {-} is_a_theorem(not(not(implies(A,A)))).
% 0.81/1.00 1805 [binary,1804.1,2.1] {-} $F.
% 0.81/1.00
% 0.81/1.00 % SZS output end Refutation
% 0.81/1.00 ------------ end of proof -------------
% 0.81/1.00
% 0.81/1.00
% 0.81/1.00 Search stopped by max_proofs option.
% 0.81/1.00
% 0.81/1.00
% 0.81/1.00 Search stopped by max_proofs option.
% 0.81/1.00
% 0.81/1.00 ============ end of search ============
% 0.81/1.00
% 0.81/1.00 ----------- soft-scott stats ----------
% 0.81/1.00
% 0.81/1.00 true clauses given 36 (31.9%)
% 0.81/1.00 false clauses given 77
% 0.81/1.00
% 0.81/1.00 FALSE TRUE
% 0.81/1.00 7 0 1
% 0.81/1.00 8 0 1
% 0.81/1.00 9 0 3
% 0.81/1.00 10 0 5
% 0.81/1.00 11 0 20
% 0.81/1.00 12 1 33
% 0.81/1.00 13 25 37
% 0.81/1.00 14 34 62
% 0.81/1.00 15 68 65
% 0.81/1.00 16 51 82
% 0.81/1.00 17 67 78
% 0.81/1.00 18 48 84
% 0.81/1.00 19 74 66
% 0.81/1.00 20 50 59
% 0.81/1.00 21 62 37
% 0.81/1.00 22 32 39
% 0.81/1.00 23 39 28
% 0.81/1.00 24 24 27
% 0.81/1.00 25 45 13
% 0.81/1.00 26 13 18
% 0.81/1.00 27 35 2
% 0.81/1.00 28 13 17
% 0.81/1.00 29 31 1
% 0.81/1.00 30 13 8
% 0.81/1.00 31 36 0
% 0.81/1.00 32 9 9
% 0.81/1.00 33 14 0
% 0.81/1.00 34 10 12
% 0.81/1.00 35 8 0
% 0.81/1.00 36 2 9
% 0.81/1.00 37 8 0
% 0.81/1.00 38 2 4
% 0.81/1.00 39 7 0
% 0.81/1.00 40 4 3
% 0.81/1.00 42 1 2
% 0.81/1.00 43 4 0
% 0.81/1.00 45 1 0
% 0.81/1.00 46 3 1
% 0.81/1.00 48 0 1
% 0.81/1.00 49 1 0
% 0.81/1.00 51 1 0
% 0.81/1.00 52 1 0
% 0.81/1.00 59 1 0
% 0.81/1.00 tot: 838 827 (49.7% true)
% 0.81/1.00
% 0.81/1.00
% 0.81/1.00 Model 6 [ 1 1 52 ] (0.00 seconds, 168022 Inserts)
% 0.81/1.00
% 0.81/1.00 That finishes the proof of the theorem.
% 0.81/1.00
% 0.81/1.00 Process 1126 finished Mon Jul 4 20:14:54 2022
%------------------------------------------------------------------------------