%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL383-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n010.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:49 EDT 2022
% Result : Unsatisfiable 15.14s 15.32s
% Output : Refutation 15.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : LCL383-1 : TPTP v8.1.0. Released v2.3.0.
% 0.02/0.11 % Command : sos-script %s
% 0.10/0.32 % Computer : n010.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 600
% 0.10/0.32 % DateTime : Mon Jul 4 05:59:47 EDT 2022
% 0.10/0.32 % CPUTime :
% 0.10/0.34 ----- Otter 3.2, August 2001 -----
% 0.10/0.34 The process was started by sandbox on n010.cluster.edu,
% 0.10/0.34 Mon Jul 4 05:59:47 2022
% 0.10/0.34 The command was "./sos". The process ID is 22929.
% 0.10/0.34
% 0.10/0.34 set(prolog_style_variables).
% 0.10/0.34 set(auto).
% 0.10/0.34 dependent: set(auto1).
% 0.10/0.34 dependent: set(process_input).
% 0.10/0.34 dependent: clear(print_kept).
% 0.10/0.34 dependent: clear(print_new_demod).
% 0.10/0.34 dependent: clear(print_back_demod).
% 0.10/0.34 dependent: clear(print_back_sub).
% 0.10/0.34 dependent: set(control_memory).
% 0.10/0.34 dependent: assign(max_mem, 12000).
% 0.10/0.34 dependent: assign(pick_given_ratio, 4).
% 0.10/0.34 dependent: assign(stats_level, 1).
% 0.10/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.10/0.34 dependent: assign(sos_limit, 5000).
% 0.10/0.34 dependent: assign(max_weight, 60).
% 0.10/0.34 clear(print_given).
% 0.10/0.34
% 0.10/0.34 list(usable).
% 0.10/0.34
% 0.10/0.34 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.10/0.34
% 0.10/0.34 This is a Horn set without equality. The strategy will
% 0.10/0.34 be hyperresolution, with satellites in sos and nuclei
% 0.10/0.34 in usable.
% 0.10/0.34
% 0.10/0.34 dependent: set(hyper_res).
% 0.10/0.34 dependent: clear(order_hyper).
% 0.10/0.34
% 0.10/0.34 ------------> process usable:
% 0.10/0.34
% 0.10/0.34 ------------> process sos:
% 0.10/0.34
% 0.10/0.34 ======= end of input processing =======
% 0.10/0.35
% 0.10/0.35 Model 1 (0.00 seconds, 0 Inserts)
% 0.10/0.35
% 0.10/0.35 Stopped by limit on number of solutions
% 0.10/0.35
% 0.10/0.35
% 0.10/0.35 -------------- Softie stats --------------
% 0.10/0.35
% 0.10/0.35 UPDATE_STOP: 300
% 0.10/0.35 SFINDER_TIME_LIMIT: 2
% 0.10/0.35 SHORT_CLAUSE_CUTOFF: 4
% 0.10/0.35 number of clauses in intial UL: 2
% 0.10/0.35 number of clauses initially in problem: 5
% 0.10/0.35 percentage of clauses intially in UL: 40
% 0.10/0.35 percentage of distinct symbols occuring in initial UL: 100
% 0.10/0.35 percent of all initial clauses that are short: 100
% 0.10/0.35 absolute distinct symbol count: 6
% 0.10/0.35 distinct predicate count: 1
% 0.10/0.35 distinct function count: 2
% 0.10/0.35 distinct constant count: 3
% 0.10/0.35
% 0.10/0.35 ---------- no more Softie stats ----------
% 0.10/0.35
% 0.10/0.35
% 0.10/0.35
% 0.10/0.35 =========== start of search ===========
% 14.18/14.36
% 14.18/14.36
% 14.18/14.36 Changing weight limit from 60 to 53.
% 14.18/14.36
% 14.18/14.36 Model 2 (0.00 seconds, 0 Inserts)
% 14.18/14.36
% 14.18/14.36 Stopped by limit on number of solutions
% 14.18/14.36
% 14.18/14.36 Model 3 (0.00 seconds, 0 Inserts)
% 14.18/14.36
% 14.18/14.36 Stopped by limit on number of solutions
% 14.18/14.36
% 14.18/14.36 Model 4 (0.00 seconds, 0 Inserts)
% 14.18/14.36
% 14.18/14.36 Stopped by limit on number of solutions
% 14.18/14.36
% 14.18/14.36 Stopped by limit on insertions
% 14.18/14.36
% 14.18/14.36 Model 5 [ 1 0 138 ] (0.00 seconds, 250000 Inserts)
% 14.18/14.36
% 14.18/14.36 Stopped by limit on insertions
% 14.18/14.36
% 14.18/14.36 Model 6 [ 1 1 88 ] (0.00 seconds, 250000 Inserts)
% 14.18/14.36
% 14.18/14.36 Stopped by limit on insertions
% 14.18/14.36
% 14.18/14.36 Model 7 [ 1 0 3428 ] (0.00 seconds, 250000 Inserts)
% 14.18/14.36
% 14.18/14.36 Stopped by limit on insertions
% 14.18/14.36
% 14.18/14.36 Model 8 [ 1 1 542 ] (0.00 seconds, 250000 Inserts)
% 14.18/14.36
% 14.18/14.36 Stopped by limit on insertions
% 14.18/14.36
% 14.18/14.36 Resetting weight limit to 53 after 200 givens.
% 14.18/14.36
% 14.18/14.37
% 14.18/14.37
% 14.18/14.37 Changing weight limit from 53 to 40.
% 14.18/14.37
% 14.18/14.37 Resetting weight limit to 40 after 205 givens.
% 14.18/14.37
% 14.40/14.63
% 14.40/14.63
% 14.40/14.63 Changing weight limit from 40 to 37.
% 14.40/14.63
% 14.40/14.63 Resetting weight limit to 37 after 230 givens.
% 14.40/14.63
% 14.51/14.73
% 14.51/14.73
% 14.51/14.73 Changing weight limit from 37 to 27.
% 14.51/14.73
% 14.51/14.73 Resetting weight limit to 27 after 235 givens.
% 14.51/14.73
% 14.57/14.81
% 14.57/14.81
% 14.57/14.81 Changing weight limit from 27 to 23.
% 14.57/14.81
% 14.57/14.81 Resetting weight limit to 23 after 240 givens.
% 14.57/14.81
% 14.66/14.86
% 14.66/14.86
% 14.66/14.86 Changing weight limit from 23 to 22.
% 14.66/14.86
% 14.66/14.86 Resetting weight limit to 22 after 245 givens.
% 14.66/14.86
% 14.71/14.90
% 14.71/14.90
% 14.71/14.90 Changing weight limit from 22 to 21.
% 14.71/14.90
% 14.71/14.90 Resetting weight limit to 21 after 250 givens.
% 14.71/14.90
% 14.80/14.97
% 14.80/14.97
% 14.80/14.97 Changing weight limit from 21 to 20.
% 14.80/14.97
% 14.80/14.97 Resetting weight limit to 20 after 260 givens.
% 14.80/14.97
% 14.85/15.08
% 14.85/15.08
% 14.85/15.08 Changing weight limit from 20 to 19.
% 14.85/15.08
% 14.85/15.08 Resetting weight limit to 19 after 290 givens.
% 14.85/15.08
% 15.01/15.22
% 15.01/15.22
% 15.01/15.22 Changing weight limit from 19 to 18.
% 15.01/15.22
% 15.01/15.22 Resetting weight limit to 18 after 310 givens.
% 15.01/15.22
% 15.14/15.32
% 15.14/15.32 -- HEY sandbox, WE HAVE A PROOF!! --
% 15.14/15.32
% 15.14/15.32 ----> UNIT CONFLICT at 14.94 sec ----> 10029 [binary,10028.1,2.1] {-} $F.
% 15.14/15.32
% 15.14/15.32 Length of proof is 36. Level of proof is 22.
% 15.14/15.32
% 15.14/15.32 ---------------- PROOF ----------------
% 15.14/15.32 % SZS status Unsatisfiable
% 15.14/15.32 % SZS output start Refutation
% 15.14/15.32
% 15.14/15.32 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 15.14/15.32 2 [] {+} -is_a_theorem(implies(implies(x,implies(y,not(z))),implies(implies(z,y),implies(x,not(z))))).
% 15.14/15.32 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 15.14/15.32 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 15.14/15.32 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 15.14/15.32 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 15.14/15.32 7 [hyper,4,1,3] {+} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 15.14/15.32 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 15.14/15.32 15 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 15.14/15.32 18 [hyper,6,1,6] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 15.14/15.32 21 [hyper,6,1,9] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 15.14/15.32 24 [hyper,21,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 15.14/15.32 26 [hyper,21,1,3] {+} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).
% 15.14/15.32 55 [hyper,24,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 15.14/15.32 71 [hyper,55,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 15.14/15.32 85 [hyper,71,1,15] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 15.14/15.32 111 [hyper,85,1,4] {+} is_a_theorem(implies(A,implies(B,B))).
% 15.14/15.32 162 [hyper,111,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 15.14/15.32 198 [hyper,162,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(D,D),B),C))).
% 15.14/15.32 203 [hyper,162,1,7] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 15.14/15.32 437 [hyper,203,1,18] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 15.14/15.32 931 [hyper,437,1,437] {-} is_a_theorem(implies(A,implies(implies(B,implies(not(C),C)),implies(B,C)))).
% 15.14/15.32 937 [hyper,437,1,55] {+} is_a_theorem(implies(A,implies(B,implies(C,A)))).
% 15.14/15.32 939 [hyper,437,1,26] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))).
% 15.14/15.32 971 [hyper,939,1,437] {-} is_a_theorem(implies(A,implies(implies(not(B),not(C)),implies(C,B)))).
% 15.14/15.32 991 [hyper,937,1,437] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 15.14/15.32 1097 [hyper,991,1,991] {+} is_a_theorem(implies(A,implies(B,A))).
% 15.14/15.32 1124 [hyper,971,1,971] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 15.14/15.32 1137 [hyper,1124,1,437] {-} is_a_theorem(implies(A,implies(implies(not(B),not(not(B))),B))).
% 15.14/15.32 1166 [hyper,1137,1,1137] {-} is_a_theorem(implies(implies(not(A),not(not(A))),A)).
% 15.14/15.32 1182 [hyper,1166,1,198] {+} is_a_theorem(implies(implies(implies(A,A),not(not(B))),B)).
% 15.14/15.32 1213 [hyper,1097,1,3] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 15.14/15.32 1474 [hyper,931,1,931] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))).
% 15.14/15.32 1505 [hyper,1474,1,6] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(B,A),A))).
% 15.14/15.32 1892 [hyper,1213,1,1505] {+} is_a_theorem(implies(A,implies(implies(A,B),B))).
% 15.14/15.32 1893 [hyper,1213,1,1182] {+} is_a_theorem(implies(not(not(A)),A)).
% 15.14/15.32 1986 [hyper,1893,1,1505] {-} is_a_theorem(implies(implies(A,not(A)),not(A))).
% 15.14/15.32 2308 [hyper,1986,1,1892] {-} is_a_theorem(implies(implies(implies(implies(A,not(A)),not(A)),B),B)).
% 15.14/15.32 4209 [hyper,2308,1,6] {-} is_a_theorem(implies(implies(A,implies(B,not(B))),implies(A,not(B)))).
% 15.14/15.32 6750 [hyper,4209,1,6] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,not(A)),not(A)))).
% 15.14/15.32 10028 [hyper,6750,1,18] {-} is_a_theorem(implies(implies(A,implies(B,not(C))),implies(implies(C,B),implies(A,not(C))))).
% 15.14/15.32 10029 [binary,10028.1,2.1] {-} $F.
% 15.14/15.32
% 15.14/15.32 % SZS output end Refutation
% 15.14/15.32 ------------ end of proof -------------
% 15.14/15.32
% 15.14/15.32
% 15.14/15.32 Search stopped by max_proofs option.
% 15.14/15.32
% 15.14/15.32
% 15.14/15.32 Search stopped by max_proofs option.
% 15.14/15.32
% 15.14/15.32 ============ end of search ============
% 15.14/15.32
% 15.14/15.32 ----------- soft-scott stats ----------
% 15.14/15.32
% 15.14/15.32 true clauses given 118 (34.8%)
% 15.14/15.32 false clauses given 221
% 15.14/15.32
% 15.14/15.32 FALSE TRUE
% 15.14/15.32 10 0 69
% 15.14/15.32 11 0 116
% 15.14/15.32 12 65 246
% 15.14/15.32 13 217 322
% 15.14/15.32 14 401 428
% 15.14/15.32 15 573 394
% 15.14/15.32 16 788 402
% 15.14/15.32 17 495 421
% 15.14/15.32 18 6 163
% 15.14/15.32 tot: 2545 2561 (50.2% true)
% 15.14/15.32
% 15.14/15.32
% 15.14/15.32 Model 8 [ 1 -315 542 ] (0.00 seconds, 250000 Inserts)
% 15.14/15.32
% 15.14/15.32 That finishes the proof of the theorem.
% 15.14/15.32
% 15.14/15.32 Process 22929 finished Mon Jul 4 06:00:02 2022
%------------------------------------------------------------------------------