%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL047-1 : TPTP v8.1.0. Released v1.0.0.
% 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:27:34 EDT 2022
% Result : Unsatisfiable 1.62s 1.81s
% Output : Refutation 1.62s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL047-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jul 4 11:13:36 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 n026.cluster.edu,
% 0.14/0.38 Mon Jul 4 11:13:36 2022
% 0.14/0.38 The command was "./sos". The process ID is 31017.
% 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 list(usable).
% 0.14/0.38
% 0.14/0.38 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.14/0.38
% 0.14/0.38 This is a Horn set without equality. The strategy will
% 0.14/0.38 be hyperresolution, with satellites in sos and nuclei
% 0.14/0.38 in usable.
% 0.14/0.38
% 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
% 0.14/0.38 ======= end of input processing =======
% 0.14/0.40
% 0.14/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.40
% 0.14/0.40 Stopped by limit on number of solutions
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40 -------------- Softie stats --------------
% 0.14/0.40
% 0.14/0.40 UPDATE_STOP: 300
% 0.14/0.40 SFINDER_TIME_LIMIT: 2
% 0.14/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.40 number of clauses in intial UL: 2
% 0.14/0.40 number of clauses initially in problem: 5
% 0.14/0.40 percentage of clauses intially in UL: 40
% 0.14/0.40 percentage of distinct symbols occuring in initial UL: 80
% 0.14/0.40 percent of all initial clauses that are short: 100
% 0.14/0.40 absolute distinct symbol count: 5
% 0.14/0.40 distinct predicate count: 1
% 0.14/0.40 distinct function count: 2
% 0.14/0.40 distinct constant count: 2
% 0.14/0.40
% 0.14/0.40 ---------- no more Softie stats ----------
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40 =========== start of search ===========
% 1.62/1.81
% 1.62/1.81 -------- PROOF --------
% 1.62/1.81 % SZS status Unsatisfiable
% 1.62/1.81 % SZS output start Refutation
% 1.62/1.81
% 1.62/1.81 Model 2 (0.00 seconds, 0 Inserts)
% 1.62/1.81
% 1.62/1.81 Stopped by limit on number of solutions
% 1.62/1.81
% 1.62/1.81 Model 3 (0.00 seconds, 0 Inserts)
% 1.62/1.81
% 1.62/1.81 Stopped by limit on number of solutions
% 1.62/1.81
% 1.62/1.81 Stopped by limit on insertions
% 1.62/1.81
% 1.62/1.81 Model 4 [ 1 1 147 ] (0.00 seconds, 250000 Inserts)
% 1.62/1.81
% 1.62/1.81 Model 5 [ 1 0 113 ] (0.00 seconds, 64902 Inserts)
% 1.62/1.81
% 1.62/1.81 Model 6 [ 1 0 243 ] (0.00 seconds, 90021 Inserts)
% 1.62/1.81
% 1.62/1.81 Model 7 [ 1 0 194 ] (0.00 seconds, 96679 Inserts)
% 1.62/1.81
% 1.62/1.81 Model 8 [ 4 1 551 ] (0.00 seconds, 139953 Inserts)
% 1.62/1.81
% 1.62/1.81 Stopped by limit on insertions
% 1.62/1.81
% 1.62/1.81 ----> UNIT CONFLICT at 1.41 sec ----> 689 [binary,688.1,2.1] {-} $F.
% 1.62/1.81
% 1.62/1.81 Length of proof is 17. Level of proof is 11.
% 1.62/1.81
% 1.62/1.81 ---------------- PROOF ----------------
% 1.62/1.81 % SZS status Unsatisfiable
% 1.62/1.81 % SZS output start Refutation
% 1.62/1.81
% 1.62/1.81 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.62/1.81 2 [] {+} -is_a_theorem(implies(a,implies(b,a))).
% 1.62/1.81 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 1.62/1.81 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 1.62/1.81 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 1.62/1.81 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 1.62/1.81 7 [hyper,4,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 1.62/1.81 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 1.62/1.81 12 [hyper,7,1,7] {+} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(not(A),A),B))).
% 1.62/1.81 29 [hyper,9,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 1.62/1.81 34 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 1.62/1.81 36 [hyper,34,1,5] {+} is_a_theorem(implies(not(implies(A,A)),B)).
% 1.62/1.81 64 [hyper,29,1,9] {-} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 1.62/1.81 69 [hyper,29,1,36] {-} is_a_theorem(implies(A,implies(not(implies(B,B)),C))).
% 1.62/1.81 78 [hyper,64,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 1.62/1.81 95 [hyper,69,1,3] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 1.62/1.81 326 [hyper,95,1,12] {-} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 1.62/1.81 423 [hyper,326,1,3] {-} is_a_theorem(implies(implies(implies(implies(not(A),A),A),B),implies(C,B))).
% 1.62/1.81 541 [hyper,423,1,6] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 1.62/1.81 606 [hyper,541,1,78] {+} is_a_theorem(implies(A,implies(B,implies(C,A)))).
% 1.62/1.81 624 [hyper,606,1,541] {-} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 1.62/1.81 688 [hyper,624,1,624] {-} is_a_theorem(implies(A,implies(B,A))).
% 1.62/1.81 689 [binary,688.1,2.1] {-} $F.
% 1.62/1.81
% 1.62/1.81 % SZS output end Refutation
% 1.62/1.81 ------------ end of proof -------------
% 1.62/1.81
% 1.62/1.81
% 1.62/1.81 Search stopped by max_proofs option.
% 1.62/1.81
% 1.62/1.81
% 1.62/1.81 Search stopped by max_proofs option.
% 1.62/1.81
% 1.62/1.81 ============ end of search ============
% 1.62/1.81
% 1.62/1.81 ----------- soft-scott stats ----------
% 1.62/1.81
% 1.62/1.81 true clauses given 15 (24.2%)
% 1.62/1.81 false clauses given 47
% 1.62/1.81
% 1.62/1.81 FALSE TRUE
% 1.62/1.81 10 1 1
% 1.62/1.81 11 1 5
% 1.62/1.81 12 1 9
% 1.62/1.81 13 11 15
% 1.62/1.81 14 10 29
% 1.62/1.81 15 19 36
% 1.62/1.81 16 10 48
% 1.62/1.81 17 23 46
% 1.62/1.81 18 4 45
% 1.62/1.81 19 15 38
% 1.62/1.81 20 10 33
% 1.62/1.81 21 11 44
% 1.62/1.81 22 0 21
% 1.62/1.81 23 12 7
% 1.62/1.81 24 0 9
% 1.62/1.81 25 18 6
% 1.62/1.81 26 1 1
% 1.62/1.81 27 15 4
% 1.62/1.81 28 1 2
% 1.62/1.81 29 13 0
% 1.62/1.81 30 0 1
% 1.62/1.81 31 18 0
% 1.62/1.81 32 0 1
% 1.62/1.81 33 1 1
% 1.62/1.81 35 2 2
% 1.62/1.81 36 0 1
% 1.62/1.81 37 4 0
% 1.62/1.81 39 3 0
% 1.62/1.81 43 2 0
% 1.62/1.81 49 1 0
% 1.62/1.81 51 1 0
% 1.62/1.81 59 1 0
% 1.62/1.81 tot: 209 405 (66.0% true)
% 1.62/1.81
% 1.62/1.81
% 1.62/1.81 Model 8 [ 4 -31 551 ] (0.00 seconds, 139953 Inserts)
% 1.62/1.81
% 1.62/1.81 That finishes the proof of the theorem.
% 1.62/1.81
% 1.62/1.81 Process 31017 finished Mon Jul 4 11:13:38 2022
%------------------------------------------------------------------------------