%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL364-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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:43 EDT 2022
% Result : Unsatisfiable 4.74s 4.92s
% Output : Refutation 4.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL364-1 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n024.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 11:26:59 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.36 ----- Otter 3.2, August 2001 -----
% 0.19/0.36 The process was started by sandbox on n024.cluster.edu,
% 0.19/0.36 Mon Jul 4 11:26:59 2022
% 0.19/0.36 The command was "./sos". The process ID is 32256.
% 0.19/0.36
% 0.19/0.36 set(prolog_style_variables).
% 0.19/0.36 set(auto).
% 0.19/0.36 dependent: set(auto1).
% 0.19/0.36 dependent: set(process_input).
% 0.19/0.36 dependent: clear(print_kept).
% 0.19/0.36 dependent: clear(print_new_demod).
% 0.19/0.36 dependent: clear(print_back_demod).
% 0.19/0.36 dependent: clear(print_back_sub).
% 0.19/0.36 dependent: set(control_memory).
% 0.19/0.36 dependent: assign(max_mem, 12000).
% 0.19/0.36 dependent: assign(pick_given_ratio, 4).
% 0.19/0.36 dependent: assign(stats_level, 1).
% 0.19/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.36 dependent: assign(sos_limit, 5000).
% 0.19/0.36 dependent: assign(max_weight, 60).
% 0.19/0.36 clear(print_given).
% 0.19/0.36
% 0.19/0.36 list(usable).
% 0.19/0.36
% 0.19/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.19/0.36
% 0.19/0.36 This is a Horn set without equality. The strategy will
% 0.19/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.19/0.36 in usable.
% 0.19/0.36
% 0.19/0.36 dependent: set(hyper_res).
% 0.19/0.36 dependent: clear(order_hyper).
% 0.19/0.36
% 0.19/0.36 ------------> process usable:
% 0.19/0.36
% 0.19/0.36 ------------> process sos:
% 0.19/0.36
% 0.19/0.36 ======= end of input processing =======
% 0.19/0.38
% 0.19/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.38
% 0.19/0.38 Stopped by limit on number of solutions
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 -------------- Softie stats --------------
% 0.19/0.38
% 0.19/0.38 UPDATE_STOP: 300
% 0.19/0.38 SFINDER_TIME_LIMIT: 2
% 0.19/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.38 number of clauses in intial UL: 2
% 0.19/0.38 number of clauses initially in problem: 5
% 0.19/0.38 percentage of clauses intially in UL: 40
% 0.19/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.38 percent of all initial clauses that are short: 100
% 0.19/0.38 absolute distinct symbol count: 6
% 0.19/0.38 distinct predicate count: 1
% 0.19/0.38 distinct function count: 2
% 0.19/0.38 distinct constant count: 3
% 0.19/0.38
% 0.19/0.38 ---------- no more Softie stats ----------
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 =========== start of search ===========
% 4.74/4.92
% 4.74/4.92 -------- PROOF --------
% 4.74/4.92 % SZS status Unsatisfiable
% 4.74/4.92 % SZS output start Refutation
% 4.74/4.92
% 4.74/4.92 Model 2 (0.00 seconds, 0 Inserts)
% 4.74/4.92
% 4.74/4.92 Stopped by limit on number of solutions
% 4.74/4.92
% 4.74/4.92 Model 3 (0.00 seconds, 0 Inserts)
% 4.74/4.92
% 4.74/4.92 Stopped by limit on number of solutions
% 4.74/4.92
% 4.74/4.92 Model 4 (0.00 seconds, 0 Inserts)
% 4.74/4.92
% 4.74/4.92 Stopped by limit on number of solutions
% 4.74/4.92
% 4.74/4.92 Stopped by limit on insertions
% 4.74/4.92
% 4.74/4.92 Model 5 [ 1 1 181 ] (0.00 seconds, 250000 Inserts)
% 4.74/4.92
% 4.74/4.92 Stopped by limit on insertions
% 4.74/4.92
% 4.74/4.92 Model 6 [ 1 0 141 ] (0.00 seconds, 250000 Inserts)
% 4.74/4.92
% 4.74/4.92 ----> UNIT CONFLICT at 4.53 sec ----> 760 [binary,759.1,2.1] {-} $F.
% 4.74/4.92
% 4.74/4.92 Length of proof is 14. Level of proof is 10.
% 4.74/4.92
% 4.74/4.92 ---------------- PROOF ----------------
% 4.74/4.92 % SZS status Unsatisfiable
% 4.74/4.92 % SZS output start Refutation
% 4.74/4.92
% 4.74/4.92 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 4.74/4.92 2 [] {+} -is_a_theorem(implies(implies(not(x),y),implies(z,implies(implies(y,x),x)))).
% 4.74/4.92 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 4.74/4.92 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 4.74/4.92 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 4.74/4.92 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 4.74/4.92 7 [hyper,4,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 4.74/4.92 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 4.74/4.92 12 [hyper,7,1,7] {+} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(not(A),A),B))).
% 4.74/4.92 29 [hyper,9,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 4.74/4.92 34 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 4.74/4.92 40 [hyper,29,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 4.74/4.92 57 [hyper,40,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 4.74/4.92 73 [hyper,57,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 4.74/4.92 85 [hyper,73,1,34] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 4.74/4.92 138 [hyper,12,1,85] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 4.74/4.92 249 [hyper,138,1,3] {-} is_a_theorem(implies(implies(implies(implies(not(A),A),A),B),implies(C,B))).
% 4.74/4.92 281 [hyper,249,1,6] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 4.74/4.92 759 [hyper,281,1,6] {-} is_a_theorem(implies(implies(not(A),B),implies(C,implies(implies(B,A),A)))).
% 4.74/4.92 760 [binary,759.1,2.1] {-} $F.
% 4.74/4.92
% 4.74/4.92 % SZS output end Refutation
% 4.74/4.92 ------------ end of proof -------------
% 4.74/4.92
% 4.74/4.92
% 4.74/4.92 Search stopped by max_proofs option.
% 4.74/4.92
% 4.74/4.92
% 4.74/4.92 Search stopped by max_proofs option.
% 4.74/4.92
% 4.74/4.92 ============ end of search ============
% 4.74/4.92
% 4.74/4.92 ----------- soft-scott stats ----------
% 4.74/4.92
% 4.74/4.92 true clauses given 22 (32.4%)
% 4.74/4.92 false clauses given 46
% 4.74/4.92
% 4.74/4.92 FALSE TRUE
% 4.74/4.92 10 0 1
% 4.74/4.92 11 0 11
% 4.74/4.92 12 0 15
% 4.74/4.92 13 3 19
% 4.74/4.92 14 8 25
% 4.74/4.92 15 11 45
% 4.74/4.92 16 12 52
% 4.74/4.92 17 11 52
% 4.74/4.92 18 16 47
% 4.74/4.92 19 14 52
% 4.74/4.92 20 13 39
% 4.74/4.92 21 6 27
% 4.74/4.92 22 7 28
% 4.74/4.92 23 4 22
% 4.74/4.92 24 3 13
% 4.74/4.92 25 4 12
% 4.74/4.92 26 4 12
% 4.74/4.92 27 1 4
% 4.74/4.92 28 3 12
% 4.74/4.92 29 1 2
% 4.74/4.92 30 3 5
% 4.74/4.92 31 0 2
% 4.74/4.92 32 2 6
% 4.74/4.92 33 0 1
% 4.74/4.92 34 4 11
% 4.74/4.92 36 1 10
% 4.74/4.92 37 0 1
% 4.74/4.92 38 1 3
% 4.74/4.92 40 1 3
% 4.74/4.92 42 0 1
% 4.74/4.92 46 0 1
% 4.74/4.92 49 0 1
% 4.74/4.92 52 0 1
% 4.74/4.92 tot: 133 536 (80.1% true)
% 4.74/4.92
% 4.74/4.92
% 4.74/4.92 Model 6 [ 1 0 141 ] (0.00 seconds, 250000 Inserts)
% 4.74/4.92
% 4.74/4.92 That finishes the proof of the theorem.
% 4.74/4.92
% 4.74/4.92 Process 32256 finished Mon Jul 4 11:27:04 2022
%------------------------------------------------------------------------------