%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL060-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n019.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:39 EDT 2022
% Result : Unsatisfiable 31.38s 31.61s
% Output : Refutation 31.38s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL060-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 3 10:33:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.36 ----- Otter 3.2, August 2001 -----
% 0.20/0.36 The process was started by sandbox on n019.cluster.edu,
% 0.20/0.36 Sun Jul 3 10:33:38 2022
% 0.20/0.36 The command was "./sos". The process ID is 24676.
% 0.20/0.36
% 0.20/0.36 set(prolog_style_variables).
% 0.20/0.36 set(auto).
% 0.20/0.36 dependent: set(auto1).
% 0.20/0.36 dependent: set(process_input).
% 0.20/0.36 dependent: clear(print_kept).
% 0.20/0.36 dependent: clear(print_new_demod).
% 0.20/0.36 dependent: clear(print_back_demod).
% 0.20/0.36 dependent: clear(print_back_sub).
% 0.20/0.36 dependent: set(control_memory).
% 0.20/0.36 dependent: assign(max_mem, 12000).
% 0.20/0.36 dependent: assign(pick_given_ratio, 4).
% 0.20/0.36 dependent: assign(stats_level, 1).
% 0.20/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.36 dependent: assign(sos_limit, 5000).
% 0.20/0.36 dependent: assign(max_weight, 60).
% 0.20/0.36 clear(print_given).
% 0.20/0.36
% 0.20/0.36 list(usable).
% 0.20/0.36
% 0.20/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.20/0.36
% 0.20/0.36 This is a Horn set without equality. The strategy will
% 0.20/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.20/0.36 in usable.
% 0.20/0.36
% 0.20/0.36 dependent: set(hyper_res).
% 0.20/0.36 dependent: clear(order_hyper).
% 0.20/0.36
% 0.20/0.36 ------------> process usable:
% 0.20/0.36
% 0.20/0.36 ------------> process sos:
% 0.20/0.36
% 0.20/0.36 ======= end of input processing =======
% 0.20/0.38
% 0.20/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.38
% 0.20/0.38 Stopped by limit on number of solutions
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 -------------- Softie stats --------------
% 0.20/0.38
% 0.20/0.38 UPDATE_STOP: 300
% 0.20/0.38 SFINDER_TIME_LIMIT: 2
% 0.20/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.38 number of clauses in intial UL: 2
% 0.20/0.38 number of clauses initially in problem: 5
% 0.20/0.38 percentage of clauses intially in UL: 40
% 0.20/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.38 percent of all initial clauses that are short: 100
% 0.20/0.38 absolute distinct symbol count: 5
% 0.20/0.38 distinct predicate count: 1
% 0.20/0.38 distinct function count: 2
% 0.20/0.38 distinct constant count: 2
% 0.20/0.38
% 0.20/0.38 ---------- no more Softie stats ----------
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 =========== start of search ===========
% 15.72/15.97
% 15.72/15.97
% 15.72/15.97 Changing weight limit from 60 to 32.
% 15.72/15.97
% 15.72/15.97 Model 2 (0.00 seconds, 0 Inserts)
% 15.72/15.97
% 15.72/15.97 Stopped by limit on number of solutions
% 15.72/15.97
% 15.72/15.97 Model 3 (0.00 seconds, 0 Inserts)
% 15.72/15.97
% 15.72/15.97 Stopped by limit on number of solutions
% 15.72/15.97
% 15.72/15.97 Model 4 (0.00 seconds, 0 Inserts)
% 15.72/15.97
% 15.72/15.97 Stopped by limit on number of solutions
% 15.72/15.97
% 15.72/15.97 Stopped by limit on insertions
% 15.72/15.97
% 15.72/15.97 Model 5 [ 1 0 96 ] (0.00 seconds, 250000 Inserts)
% 15.72/15.97
% 15.72/15.97 Stopped by limit on insertions
% 15.72/15.97
% 15.72/15.97 Model 6 [ 1 0 99 ] (0.00 seconds, 250000 Inserts)
% 15.72/15.97
% 15.72/15.97 Stopped by limit on insertions
% 15.72/15.97
% 15.72/15.97 Model 7 [ 1 1 44 ] (0.00 seconds, 250000 Inserts)
% 15.72/15.97
% 15.72/15.97 Stopped by limit on insertions
% 15.72/15.97
% 15.72/15.97 Model 8 [ 1 0 21 ] (0.00 seconds, 250000 Inserts)
% 15.72/15.97
% 15.72/15.97 Stopped by limit on insertions
% 15.72/15.97
% 15.72/15.97 Model 9 [ 1 0 84 ] (0.00 seconds, 250000 Inserts)
% 15.72/15.97
% 15.72/15.97 Stopped by limit on insertions
% 15.72/15.97
% 15.72/15.97 Model 10 [ 3 0 46 ] (0.00 seconds, 250000 Inserts)
% 15.72/15.97
% 15.72/15.97 Resetting weight limit to 32 after 145 givens.
% 15.72/15.97
% 18.59/18.76
% 18.59/18.76
% 18.59/18.76 Changing weight limit from 32 to 24.
% 18.59/18.76
% 18.59/18.76 Stopped by limit on insertions
% 18.59/18.76
% 18.59/18.76 Model 11 [ 2 1 2263 ] (0.00 seconds, 250000 Inserts)
% 18.59/18.76
% 18.59/18.76 Resetting weight limit to 24 after 265 givens.
% 18.59/18.76
% 18.66/18.83
% 18.66/18.83
% 18.66/18.83 Changing weight limit from 24 to 23.
% 18.66/18.83
% 18.66/18.83 Resetting weight limit to 23 after 275 givens.
% 18.66/18.83
% 18.67/18.88
% 18.67/18.88
% 18.67/18.88 Changing weight limit from 23 to 22.
% 18.67/18.88
% 18.67/18.88 Resetting weight limit to 22 after 280 givens.
% 18.67/18.88
% 18.77/18.93
% 18.77/18.93
% 18.77/18.93 Changing weight limit from 22 to 21.
% 18.77/18.93
% 18.77/18.93 Resetting weight limit to 21 after 285 givens.
% 18.77/18.93
% 18.77/18.98
% 18.77/18.98
% 18.77/18.98 Changing weight limit from 21 to 20.
% 18.77/18.98
% 18.77/18.98 Resetting weight limit to 20 after 290 givens.
% 18.77/18.98
% 18.83/19.04
% 18.83/19.04
% 18.83/19.04 Changing weight limit from 20 to 19.
% 18.83/19.04
% 18.83/19.04 Resetting weight limit to 19 after 300 givens.
% 18.83/19.04
% 18.92/19.08
% 18.92/19.08
% 18.92/19.08 Changing weight limit from 19 to 18.
% 18.92/19.08
% 18.92/19.08 Resetting weight limit to 18 after 310 givens.
% 18.92/19.08
% 18.96/19.13
% 18.96/19.13
% 18.96/19.13 Changing weight limit from 18 to 17.
% 18.96/19.13
% 18.96/19.13 Resetting weight limit to 17 after 325 givens.
% 18.96/19.13
% 19.12/19.32
% 19.12/19.32
% 19.12/19.32 Changing weight limit from 17 to 16.
% 19.12/19.32
% 19.12/19.32 Resetting weight limit to 16 after 400 givens.
% 19.12/19.32
% 19.63/19.81
% 19.63/19.81
% 19.63/19.81 Changing weight limit from 16 to 15.
% 19.63/19.81
% 19.63/19.81 Modelling stopped after 300 given clauses and 0.00 seconds
% 19.63/19.81
% 19.63/19.81
% 19.63/19.81 Resetting weight limit to 15 after 625 givens.
% 19.63/19.81
% 21.48/21.68
% 21.48/21.68
% 21.48/21.68 Changing weight limit from 15 to 14.
% 21.48/21.68
% 21.48/21.68 Resetting weight limit to 14 after 1400 givens.
% 21.48/21.68
% 31.38/31.61
% 31.38/31.61 -- HEY sandbox, WE HAVE A PROOF!! --
% 31.38/31.61
% 31.38/31.61 ----> UNIT CONFLICT at 29.52 sec ----> 42916 [binary,42915.1,2.1] {+} $F.
% 31.38/31.61
% 31.38/31.61 Length of proof is 34. Level of proof is 19.
% 31.38/31.61
% 31.38/31.61 ---------------- PROOF ----------------
% 31.38/31.61 % SZS status Unsatisfiable
% 31.38/31.61 % SZS output start Refutation
% 31.38/31.61
% 31.38/31.61 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 31.38/31.61 2 [] {+} -is_a_theorem(implies(implies(a,b),implies(implies(not(a),b),b))).
% 31.38/31.61 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 31.38/31.61 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 31.38/31.61 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 31.38/31.61 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 31.38/31.61 7 [hyper,4,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 31.38/31.61 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 31.38/31.61 12 [hyper,7,1,7] {+} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(not(A),A),B))).
% 31.38/31.61 17 [hyper,7,1,3] {-} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(B,C),implies(A,C)))).
% 31.38/31.61 21 [hyper,6,1,7] {-} is_a_theorem(implies(implies(not(implies(implies(implies(A,B),implies(C,B)),D)),implies(implies(implies(A,B),implies(C,B)),D)),implies(implies(C,A),D))).
% 31.38/31.61 22 [hyper,6,1,6] {+} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 31.38/31.61 29 [hyper,9,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 31.38/31.61 34 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 31.38/31.61 40 [hyper,29,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 31.38/31.61 43 [hyper,29,1,3] {+} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).
% 31.38/31.61 57 [hyper,40,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 31.38/31.61 73 [hyper,57,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 31.38/31.61 85 [hyper,73,1,34] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 31.38/31.61 138 [hyper,12,1,85] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 31.38/31.61 249 [hyper,138,1,3] {-} is_a_theorem(implies(implies(implies(implies(not(A),A),A),B),implies(C,B))).
% 31.38/31.61 281 [hyper,249,1,6] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 31.38/31.61 808 [hyper,281,1,281] {-} is_a_theorem(implies(A,implies(implies(B,implies(not(C),C)),implies(B,C)))).
% 31.38/31.61 815 [hyper,281,1,57] {+} is_a_theorem(implies(A,implies(B,implies(C,A)))).
% 31.38/31.61 848 [hyper,815,1,281] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 31.38/31.61 965 [hyper,848,1,17] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 31.38/31.61 1112 [hyper,808,1,808] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))).
% 31.38/31.61 1122 [hyper,808,1,21] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(B,A),A))).
% 31.38/31.61 1251 [hyper,1122,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),B),C),implies(implies(not(B),A),C))).
% 31.38/31.61 1616 [hyper,43,1,1112] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 31.38/31.61 1787 [hyper,965,1,1616] {+} is_a_theorem(implies(not(A),implies(A,B))).
% 31.38/31.61 1790 [hyper,965,1,1122] {+} is_a_theorem(implies(A,implies(implies(A,B),B))).
% 31.38/31.61 2081 [hyper,1790,1,22] {+} is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 31.38/31.61 2280 [hyper,1787,1,1122] {+} is_a_theorem(implies(implies(implies(A,B),A),A)).
% 31.38/31.61 2313 [hyper,2280,1,1790] {+} is_a_theorem(implies(implies(implies(implies(implies(A,B),A),A),C),C)).
% 31.38/31.61 36435 [hyper,2313,1,6] {+} is_a_theorem(implies(implies(A,implies(implies(B,C),B)),implies(A,B))).
% 31.38/31.61 42277 [hyper,36435,1,6] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,A),A))).
% 31.38/31.61 42881 [hyper,42277,1,1251] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(A,B),B))).
% 31.38/31.61 42915 [hyper,42881,1,2081] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),B),B))).
% 31.38/31.61 42916 [binary,42915.1,2.1] {+} $F.
% 31.38/31.61
% 31.38/31.61 % SZS output end Refutation
% 31.38/31.61 ------------ end of proof -------------
% 31.38/31.61
% 31.38/31.61
% 31.38/31.61 Search stopped by max_proofs option.
% 31.38/31.61
% 31.38/31.61
% 31.38/31.61 Search stopped by max_proofs option.
% 31.38/31.61
% 31.38/31.61 ============ end of search ============
% 31.38/31.61
% 31.38/31.61 ----------- soft-scott stats ----------
% 31.38/31.61
% 31.38/31.61 true clauses given 1344 (34.0%)
% 31.38/31.61 false clauses given 2606
% 31.38/31.61
% 31.38/31.61 FALSE TRUE
% 31.38/31.61 12 0 9
% 31.38/31.61 13 0 935
% 31.38/31.61 14 2500 1556
% 31.38/31.61 tot: 2500 2500 (50.0% true)
% 31.38/31.61
% 31.38/31.61
% 31.38/31.61 Model 11 [ 2 1 2263 ] (0.00 seconds, 250000 Inserts)
% 31.38/31.61
% 31.38/31.61 That finishes the proof of the theorem.
% 31.38/31.61
% 31.38/31.61 Process 24676 finished Sun Jul 3 10:34:10 2022
%------------------------------------------------------------------------------