%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL400-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n006.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:56 EDT 2022
% Result : Unsatisfiable 11.10s 11.31s
% Output : Refutation 11.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : LCL400-1 : TPTP v8.1.0. Released v2.3.0.
% 0.08/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n006.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 16:59:07 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 n006.cluster.edu,
% 0.12/0.35 Mon Jul 4 16:59:07 2022
% 0.12/0.35 The command was "./sos". The process ID is 23022.
% 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: 5
% 0.12/0.38 distinct predicate count: 1
% 0.12/0.38 distinct function count: 2
% 0.12/0.38 distinct constant count: 2
% 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 ===========
% 5.25/5.48
% 5.25/5.48
% 5.25/5.48 Changing weight limit from 60 to 51.
% 5.25/5.48
% 5.25/5.48 Model 2 (0.00 seconds, 0 Inserts)
% 5.25/5.48
% 5.25/5.48 Stopped by limit on number of solutions
% 5.25/5.48
% 5.25/5.48 Model 3 (0.00 seconds, 0 Inserts)
% 5.25/5.48
% 5.31/5.48 Stopped by limit on number of solutions
% 5.31/5.48
% 5.31/5.48 Stopped by limit on insertions
% 5.31/5.48
% 5.31/5.48 Model 4 [ 1 1 120 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.48
% 5.31/5.48 Stopped by limit on insertions
% 5.31/5.48
% 5.31/5.48 Model 5 [ 1 0 46 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.48
% 5.31/5.48 Resetting weight limit to 51 after 140 givens.
% 5.31/5.48
% 7.57/7.77
% 7.57/7.77
% 7.57/7.77 Changing weight limit from 51 to 52.
% 7.57/7.77
% 7.57/7.77 Stopped by limit on insertions
% 7.57/7.77
% 7.57/7.77 Model 6 [ 1 1 178 ] (0.00 seconds, 250000 Inserts)
% 7.57/7.77
% 7.57/7.77 Resetting weight limit to 52 after 185 givens.
% 7.57/7.77
% 9.94/10.16
% 9.94/10.16
% 9.94/10.16 Changing weight limit from 52 to 53.
% 9.94/10.16
% 9.94/10.16 Stopped by limit on insertions
% 9.94/10.16
% 9.94/10.16 Model 7 [ 1 0 505 ] (0.00 seconds, 250000 Inserts)
% 9.94/10.16
% 9.94/10.16 Model 8 [ 2 5 32610 ] (0.00 seconds, 244584 Inserts)
% 9.94/10.16
% 9.94/10.16 Resetting weight limit to 53 after 190 givens.
% 9.94/10.16
% 9.94/10.20
% 9.94/10.20
% 9.94/10.20 Changing weight limit from 53 to 31.
% 9.94/10.20
% 9.94/10.20 Resetting weight limit to 31 after 195 givens.
% 9.94/10.20
% 10.42/10.66
% 10.42/10.66
% 10.42/10.66 Changing weight limit from 31 to 27.
% 10.42/10.66
% 10.42/10.66 Resetting weight limit to 27 after 260 givens.
% 10.42/10.66
% 10.49/10.67
% 10.49/10.67
% 10.49/10.67 Changing weight limit from 27 to 25.
% 10.49/10.67
% 10.49/10.67 Resetting weight limit to 25 after 265 givens.
% 10.49/10.67
% 10.49/10.69
% 10.49/10.69
% 10.49/10.69 Changing weight limit from 25 to 23.
% 10.49/10.69
% 10.49/10.69 Resetting weight limit to 23 after 270 givens.
% 10.49/10.69
% 10.56/10.75
% 10.56/10.75
% 10.56/10.75 Changing weight limit from 23 to 21.
% 10.56/10.75
% 10.56/10.75 Resetting weight limit to 21 after 275 givens.
% 10.56/10.75
% 10.56/10.78
% 10.56/10.78
% 10.56/10.78 Changing weight limit from 21 to 20.
% 10.56/10.78
% 10.56/10.78 Resetting weight limit to 20 after 280 givens.
% 10.56/10.78
% 10.72/10.92
% 10.72/10.92
% 10.72/10.92 Changing weight limit from 20 to 19.
% 10.72/10.92
% 10.72/10.92 Resetting weight limit to 19 after 300 givens.
% 10.72/10.92
% 11.01/11.19
% 11.01/11.19
% 11.01/11.19 Changing weight limit from 19 to 18.
% 11.01/11.19
% 11.01/11.19 Resetting weight limit to 18 after 340 givens.
% 11.01/11.19
% 11.10/11.31
% 11.10/11.31 -- HEY sandbox, WE HAVE A PROOF!! --
% 11.10/11.31
% 11.10/11.31 ----> UNIT CONFLICT at 10.89 sec ----> 12227 [binary,12226.1,2.1] {-} $F.
% 11.10/11.31
% 11.10/11.31 Length of proof is 37. Level of proof is 21.
% 11.10/11.31
% 11.10/11.31 ---------------- PROOF ----------------
% 11.10/11.31 % SZS status Unsatisfiable
% 11.10/11.31 % SZS output start Refutation
% 11.10/11.31
% 11.10/11.31 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 11.10/11.31 2 [] {+} -is_a_theorem(implies(not(implies(x,y)),x)).
% 11.10/11.31 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 11.10/11.31 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 11.10/11.31 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 11.10/11.31 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 11.10/11.31 7 [hyper,4,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 11.10/11.31 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 11.10/11.31 12 [hyper,7,1,7] {+} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(not(A),A),B))).
% 11.10/11.31 14 [hyper,7,1,3] {+} is_a_theorem(implies(implies(implies(implies(not(A),A),B),C),implies(implies(A,B),C))).
% 11.10/11.31 17 [hyper,7,1,3] {+} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(B,C),implies(A,C)))).
% 11.10/11.31 22 [hyper,6,1,6] {+} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 11.10/11.31 29 [hyper,9,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 11.10/11.31 34 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 11.10/11.31 36 [hyper,34,1,5] {+} is_a_theorem(implies(not(implies(A,A)),B)).
% 11.10/11.31 64 [hyper,29,1,9] {-} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 11.10/11.31 67 [hyper,29,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).
% 11.10/11.31 69 [hyper,29,1,36] {-} is_a_theorem(implies(A,implies(not(implies(B,B)),C))).
% 11.10/11.31 78 [hyper,64,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 11.10/11.31 95 [hyper,69,1,3] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 11.10/11.31 317 [hyper,95,1,14] {+} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 11.10/11.31 326 [hyper,95,1,12] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 11.10/11.31 413 [hyper,317,1,29] {-} is_a_theorem(implies(A,implies(B,implies(not(B),C)))).
% 11.10/11.31 617 [hyper,22,1,413] {-} is_a_theorem(implies(implies(A,B),implies(C,implies(A,implies(not(B),D))))).
% 11.10/11.31 620 [hyper,22,1,326] {+} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 11.10/11.31 2406 [hyper,620,1,78] {+} is_a_theorem(implies(A,implies(B,implies(C,A)))).
% 11.10/11.31 2426 [hyper,620,1,617] {-} is_a_theorem(implies(A,implies(implies(B,C),implies(B,implies(not(C),D))))).
% 11.10/11.31 2446 [hyper,2426,1,2426] {-} is_a_theorem(implies(implies(A,B),implies(A,implies(not(B),C)))).
% 11.10/11.31 2523 [hyper,2406,1,620] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 11.10/11.31 2814 [hyper,2523,1,17] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 11.10/11.31 4368 [hyper,67,1,620] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))).
% 11.10/11.31 4481 [hyper,4368,1,2814] {-} is_a_theorem(implies(not(A),implies(B,implies(A,C)))).
% 11.10/11.31 4538 [hyper,4481,1,620] {-} is_a_theorem(implies(A,implies(not(B),implies(B,C)))).
% 11.10/11.31 4559 [hyper,4538,1,4538] {+} is_a_theorem(implies(not(A),implies(A,B))).
% 11.10/11.31 4596 [hyper,4559,1,620] {-} is_a_theorem(implies(A,implies(not(not(B)),B))).
% 11.10/11.31 4611 [hyper,4596,1,4596] {+} is_a_theorem(implies(not(not(A)),A)).
% 11.10/11.31 4808 [hyper,4611,1,4368] {+} is_a_theorem(implies(A,implies(B,not(not(B))))).
% 11.10/11.31 4847 [hyper,4808,1,4808] {+} is_a_theorem(implies(A,not(not(A)))).
% 11.10/11.31 5066 [hyper,4847,1,2814] {-} is_a_theorem(implies(A,not(not(implies(B,A))))).
% 11.10/11.31 5315 [hyper,5066,1,29] {-} is_a_theorem(implies(not(implies(A,B)),implies(B,C))).
% 11.10/11.31 5558 [hyper,5315,1,2446] {-} is_a_theorem(implies(not(implies(A,B)),implies(not(implies(B,C)),D))).
% 11.10/11.31 12226 [hyper,5558,1,4] {-} is_a_theorem(implies(not(implies(A,B)),A)).
% 11.10/11.31 12227 [binary,12226.1,2.1] {-} $F.
% 11.10/11.31
% 11.10/11.31 % SZS output end Refutation
% 11.10/11.31 ------------ end of proof -------------
% 11.10/11.31
% 11.10/11.31
% 11.10/11.31 Search stopped by max_proofs option.
% 11.10/11.31
% 11.10/11.31
% 11.10/11.31 Search stopped by max_proofs option.
% 11.10/11.31
% 11.10/11.31 ============ end of search ============
% 11.10/11.31
% 11.10/11.31 ----------- soft-scott stats ----------
% 11.10/11.31
% 11.10/11.31 true clauses given 113 (28.8%)
% 11.10/11.31 false clauses given 279
% 11.10/11.31
% 11.10/11.31 FALSE TRUE
% 11.10/11.31 10 0 15
% 11.10/11.31 11 0 55
% 11.10/11.31 12 97 110
% 11.10/11.31 13 210 182
% 11.10/11.31 14 360 313
% 11.10/11.31 15 565 420
% 11.10/11.31 16 700 514
% 11.10/11.31 17 572 625
% 11.10/11.31 18 6 266
% 11.10/11.31 tot: 2510 2500 (49.9% true)
% 11.10/11.31
% 11.10/11.31
% 11.10/11.31 Model 8 [ 2 5 32610 ] (0.00 seconds, 244584 Inserts)
% 11.10/11.31
% 11.10/11.31 That finishes the proof of the theorem.
% 11.10/11.31
% 11.10/11.31 Process 23022 finished Mon Jul 4 16:59:18 2022
%------------------------------------------------------------------------------