%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL005-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n018.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:19 EDT 2022
% Result : Unsatisfiable 15.54s 15.72s
% Output : Refutation 15.54s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL005-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 4 06:42:35 EDT 2022
% 0.18/0.33 % CPUTime :
% 0.18/0.35 ----- Otter 3.2, August 2001 -----
% 0.18/0.35 The process was started by sandbox on n018.cluster.edu,
% 0.18/0.35 Mon Jul 4 06:42:35 2022
% 0.18/0.35 The command was "./sos". The process ID is 9217.
% 0.18/0.35
% 0.18/0.35 set(prolog_style_variables).
% 0.18/0.35 set(auto).
% 0.18/0.35 dependent: set(auto1).
% 0.18/0.35 dependent: set(process_input).
% 0.18/0.35 dependent: clear(print_kept).
% 0.18/0.35 dependent: clear(print_new_demod).
% 0.18/0.35 dependent: clear(print_back_demod).
% 0.18/0.35 dependent: clear(print_back_sub).
% 0.18/0.35 dependent: set(control_memory).
% 0.18/0.35 dependent: assign(max_mem, 12000).
% 0.18/0.35 dependent: assign(pick_given_ratio, 4).
% 0.18/0.35 dependent: assign(stats_level, 1).
% 0.18/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.35 dependent: assign(sos_limit, 5000).
% 0.18/0.35 dependent: assign(max_weight, 60).
% 0.18/0.35 clear(print_given).
% 0.18/0.35
% 0.18/0.35 list(usable).
% 0.18/0.35
% 0.18/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.18/0.35
% 0.18/0.35 This is a Horn set without equality. The strategy will
% 0.18/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.18/0.35 in usable.
% 0.18/0.35
% 0.18/0.35 dependent: set(hyper_res).
% 0.18/0.35 dependent: clear(order_hyper).
% 0.18/0.35
% 0.18/0.35 ------------> process usable:
% 0.18/0.35
% 0.18/0.35 ------------> process sos:
% 0.18/0.35
% 0.18/0.35 ======= end of input processing =======
% 0.18/0.37
% 0.18/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.37
% 0.18/0.37 Stopped by limit on number of solutions
% 0.18/0.37
% 0.18/0.37
% 0.18/0.37 -------------- Softie stats --------------
% 0.18/0.37
% 0.18/0.37 UPDATE_STOP: 300
% 0.18/0.37 SFINDER_TIME_LIMIT: 2
% 0.18/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.37 number of clauses in intial UL: 2
% 0.18/0.37 number of clauses initially in problem: 3
% 0.18/0.37 percentage of clauses intially in UL: 66
% 0.18/0.37 percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.37 percent of all initial clauses that are short: 100
% 0.18/0.37 absolute distinct symbol count: 4
% 0.18/0.37 distinct predicate count: 1
% 0.18/0.37 distinct function count: 2
% 0.18/0.37 distinct constant count: 1
% 0.18/0.37
% 0.18/0.37 ---------- no more Softie stats ----------
% 0.18/0.37
% 0.18/0.37
% 0.18/0.37
% 0.18/0.37 =========== start of search ===========
% 8.95/9.17
% 8.95/9.17
% 8.95/9.17 Changing weight limit from 60 to 49.
% 8.95/9.17
% 8.95/9.17 Model 2 (0.00 seconds, 0 Inserts)
% 8.95/9.17
% 8.95/9.17 Stopped by limit on number of solutions
% 8.95/9.17
% 8.95/9.17 Model 3 (0.00 seconds, 0 Inserts)
% 8.95/9.17
% 8.95/9.17 Stopped by limit on number of solutions
% 8.95/9.17
% 8.95/9.17 Modelling stopped after 300 given clauses and 0.00 seconds
% 8.95/9.17
% 8.95/9.17
% 8.95/9.17 Resetting weight limit to 49 after 470 givens.
% 8.95/9.17
% 9.04/9.29
% 9.04/9.29
% 9.04/9.29 Changing weight limit from 49 to 39.
% 9.04/9.29
% 9.04/9.29 Resetting weight limit to 39 after 475 givens.
% 9.04/9.29
% 9.41/9.58
% 9.41/9.58
% 9.41/9.58 Changing weight limit from 39 to 37.
% 9.41/9.58
% 9.41/9.58 Resetting weight limit to 37 after 490 givens.
% 9.41/9.58
% 9.41/9.65
% 9.41/9.65
% 9.41/9.65 Changing weight limit from 37 to 36.
% 9.41/9.65
% 9.41/9.65 Resetting weight limit to 36 after 500 givens.
% 9.41/9.65
% 9.54/9.77
% 9.54/9.77
% 9.54/9.77 Changing weight limit from 36 to 35.
% 9.54/9.77
% 9.54/9.77 Resetting weight limit to 35 after 520 givens.
% 9.54/9.77
% 9.73/9.95
% 9.73/9.95
% 9.73/9.95 Changing weight limit from 35 to 33.
% 9.73/9.95
% 9.73/9.95 Resetting weight limit to 33 after 535 givens.
% 9.73/9.95
% 9.82/10.05
% 9.82/10.05
% 9.82/10.05 Changing weight limit from 33 to 32.
% 9.82/10.05
% 9.82/10.05 Resetting weight limit to 32 after 550 givens.
% 9.82/10.05
% 9.92/10.10
% 9.92/10.10
% 9.92/10.10 Changing weight limit from 32 to 31.
% 9.92/10.10
% 9.92/10.10 Resetting weight limit to 31 after 560 givens.
% 9.92/10.10
% 10.13/10.34
% 10.13/10.34
% 10.13/10.34 Changing weight limit from 31 to 30.
% 10.13/10.34
% 10.13/10.34 Resetting weight limit to 30 after 615 givens.
% 10.13/10.34
% 10.13/10.39
% 10.13/10.39
% 10.13/10.39 Changing weight limit from 30 to 29.
% 10.13/10.39
% 10.13/10.39 Resetting weight limit to 29 after 625 givens.
% 10.13/10.39
% 10.52/10.72
% 10.52/10.72
% 10.52/10.72 Changing weight limit from 29 to 27.
% 10.52/10.72
% 10.52/10.72 Resetting weight limit to 27 after 660 givens.
% 10.52/10.72
% 11.33/11.59
% 11.33/11.59
% 11.33/11.59 Changing weight limit from 27 to 26.
% 11.33/11.59
% 11.33/11.59 Resetting weight limit to 26 after 775 givens.
% 11.33/11.59
% 11.42/11.60
% 11.42/11.60
% 11.42/11.60 Changing weight limit from 26 to 25.
% 11.42/11.60
% 11.42/11.60 Resetting weight limit to 25 after 780 givens.
% 11.42/11.60
% 11.80/12.05
% 11.80/12.05
% 11.80/12.05 Changing weight limit from 25 to 24.
% 11.80/12.05
% 11.80/12.05 Resetting weight limit to 24 after 850 givens.
% 11.80/12.05
% 11.80/12.06
% 11.80/12.06
% 11.80/12.06 Changing weight limit from 24 to 23.
% 11.80/12.06
% 11.80/12.06 Resetting weight limit to 23 after 855 givens.
% 11.80/12.06
% 12.20/12.39
% 12.20/12.39
% 12.20/12.39 Changing weight limit from 23 to 22.
% 12.20/12.39
% 12.20/12.39 Resetting weight limit to 22 after 935 givens.
% 12.20/12.39
% 12.22/12.40
% 12.22/12.40
% 12.22/12.40 Changing weight limit from 22 to 21.
% 12.22/12.40
% 12.22/12.40 Resetting weight limit to 21 after 940 givens.
% 12.22/12.40
% 15.54/15.72
% 15.54/15.72 -- HEY sandbox, WE HAVE A PROOF!! --
% 15.54/15.72
% 15.54/15.72 ----> UNIT CONFLICT at 15.03 sec ----> 29771 [binary,29770.1,2.1] {+} $F.
% 15.54/15.72
% 15.54/15.72 Length of proof is 44. Level of proof is 41.
% 15.54/15.72
% 15.54/15.72 ---------------- PROOF ----------------
% 15.54/15.72 % SZS status Unsatisfiable
% 15.54/15.72 % SZS output start Refutation
% 15.54/15.72
% 15.54/15.72 1 [] {+} -is_a_theorem(or(not(A),B))| -is_a_theorem(A)|is_a_theorem(B).
% 15.54/15.72 2 [] {+} -is_a_theorem(or(not(or(a,a)),a)).
% 15.54/15.72 3 [] {-} is_a_theorem(or(not(or(not(or(not(A),B)),or(C,or(D,E)))),or(not(or(not(D),A)),or(C,or(E,A))))).
% 15.54/15.72 4 [hyper,3,1,3] {-} is_a_theorem(or(not(or(not(A),or(not(B),C))),or(not(or(not(D),B)),or(or(E,B),or(not(B),C))))).
% 15.54/15.72 6 [hyper,4,1,3] {-} is_a_theorem(or(not(or(not(or(A,B)),C)),or(not(or(not(D),B)),or(or(not(B),E),C)))).
% 15.54/15.72 10 [hyper,6,1,3] {-} is_a_theorem(or(not(or(not(or(not(A),B)),or(C,A))),or(not(or(not(D),A)),or(E,or(C,A))))).
% 15.54/15.72 13 [hyper,10,1,10] {-} is_a_theorem(or(not(or(not(A),or(not(B),or(C,B)))),or(D,or(not(or(not(E),B)),or(not(B),or(C,B)))))).
% 15.54/15.72 64 [hyper,13,1,3] {-} is_a_theorem(or(not(or(not(not(or(not(A),B))),C)),or(D,or(or(not(B),or(E,B)),C)))).
% 15.54/15.72 78 [hyper,64,1,13] {-} is_a_theorem(or(A,or(not(or(not(B),C)),or(not(C),or(or(not(D),or(E,D)),C))))).
% 15.54/15.72 85 [hyper,78,1,78] {-} is_a_theorem(or(not(or(not(A),B)),or(not(B),or(or(not(C),or(D,C)),B)))).
% 15.54/15.72 94 [hyper,85,1,3] {-} is_a_theorem(or(not(or(not(or(not(A),or(B,A))),C)),or(not(D),or(D,C)))).
% 15.54/15.72 109 [hyper,94,1,13] {-} is_a_theorem(or(A,or(not(or(not(B),C)),or(not(C),or(C,C))))).
% 15.54/15.72 146 [hyper,109,1,109] {-} is_a_theorem(or(not(or(not(A),B)),or(not(B),or(B,B)))).
% 15.54/15.72 156 [hyper,146,1,3] {-} is_a_theorem(or(not(or(not(A),B)),or(not(A),or(A,B)))).
% 15.54/15.72 168 [hyper,156,1,3] {-} is_a_theorem(or(not(or(not(A),A)),or(not(A),or(B,A)))).
% 15.54/15.72 183 [hyper,168,1,13] {-} is_a_theorem(or(A,or(not(or(not(B),C)),or(not(C),or(D,C))))).
% 15.54/15.72 243 [hyper,183,1,183] {-} is_a_theorem(or(not(or(not(A),B)),or(not(B),or(C,B)))).
% 15.54/15.72 255 [hyper,243,1,10] {-} is_a_theorem(or(not(or(not(A),or(B,C))),or(D,or(not(C),or(B,C))))).
% 15.54/15.72 256 [hyper,243,1,3] {-} is_a_theorem(or(not(or(not(A),B)),or(not(C),or(C,B)))).
% 15.54/15.72 275 [hyper,256,1,3] {-} is_a_theorem(or(not(or(not(A),B)),or(not(A),or(C,B)))).
% 15.54/15.72 401 [hyper,275,1,243] {-} is_a_theorem(or(not(or(not(A),B)),or(C,or(not(B),or(D,B))))).
% 15.54/15.72 573 [hyper,401,1,3] {-} is_a_theorem(or(not(or(not(not(A)),B)),or(C,or(or(D,A),B)))).
% 15.54/15.72 670 [hyper,573,1,3] {-} is_a_theorem(or(not(or(not(or(A,B)),not(B))),or(C,or(D,not(B))))).
% 15.54/15.72 1912 [hyper,255,1,670] {-} is_a_theorem(or(A,or(not(or(B,not(C))),or(D,or(B,not(C)))))).
% 15.54/15.72 2116 [hyper,1912,1,1912] {-} is_a_theorem(or(not(or(A,not(B))),or(C,or(A,not(B))))).
% 15.54/15.72 2170 [hyper,2116,1,3] {-} is_a_theorem(or(not(or(not(not(A)),A)),or(B,or(not(C),A)))).
% 15.54/15.72 2193 [hyper,2170,1,255] {-} is_a_theorem(or(A,or(not(or(not(B),C)),or(D,or(not(B),C))))).
% 15.54/15.72 2587 [hyper,2193,1,2193] {-} is_a_theorem(or(not(or(not(A),B)),or(C,or(not(A),B)))).
% 15.54/15.72 2624 [hyper,2587,1,3] {-} is_a_theorem(or(not(or(not(not(A)),A)),or(B,or(C,A)))).
% 15.54/15.72 2672 [hyper,2624,1,255] {-} is_a_theorem(or(A,or(not(or(B,C)),or(D,or(B,C))))).
% 15.54/15.72 2779 [hyper,2672,1,2672] {-} is_a_theorem(or(not(or(A,B)),or(C,or(A,B)))).
% 15.54/15.72 2789 [hyper,2779,1,275] {-} is_a_theorem(or(not(or(A,B)),or(C,or(D,or(A,B))))).
% 15.54/15.72 2865 [hyper,2789,1,3] {-} is_a_theorem(or(not(or(not(A),B)),or(C,or(or(not(B),D),B)))).
% 15.54/15.72 3115 [hyper,2865,1,3] {-} is_a_theorem(or(not(or(not(or(not(A),B)),C)),or(D,or(A,C)))).
% 15.54/15.72 3129 [hyper,3115,1,3] {-} is_a_theorem(or(not(or(not(A),or(not(A),B))),or(C,or(D,or(not(A),B))))).
% 15.54/15.72 3908 [hyper,3129,1,2624] {-} is_a_theorem(or(A,or(B,or(not(or(not(not(C)),C)),or(D,C))))).
% 15.54/15.72 3915 [hyper,3908,1,3908] {-} is_a_theorem(or(A,or(not(or(not(not(B)),B)),or(C,B)))).
% 15.54/15.72 3926 [hyper,3915,1,3915] {-} is_a_theorem(or(not(or(not(not(A)),A)),or(B,A))).
% 15.54/15.72 4042 [hyper,3926,1,3129] {-} is_a_theorem(or(A,or(B,or(not(or(not(not(C)),C)),C)))).
% 15.54/15.72 4044 [hyper,3926,1,3] {-} is_a_theorem(or(not(or(not(A),not(or(A,B)))),or(C,or(B,not(or(A,B)))))).
% 15.54/15.72 4070 [hyper,4042,1,4042] {-} is_a_theorem(or(A,or(not(or(not(not(B)),B)),B))).
% 15.54/15.72 4091 [hyper,4070,1,4070] {-} is_a_theorem(or(not(or(not(not(A)),A)),A)).
% 15.54/15.72 4105 [hyper,4091,1,3115] {+} is_a_theorem(or(A,or(not(B),B))).
% 15.54/15.72 4126 [hyper,4105,1,4105] {+} is_a_theorem(or(not(A),A)).
% 15.54/15.72 29526 [hyper,4044,1,3] {-} is_a_theorem(or(not(or(not(A),B)),or(C,or(not(or(B,A)),B)))).
% 15.54/15.72 29755 [hyper,29526,1,4126] {-} is_a_theorem(or(A,or(not(or(B,B)),B))).
% 15.54/15.72 29770 [hyper,29755,1,29755] {-} is_a_theorem(or(not(or(A,A)),A)).
% 15.54/15.72 29771 [binary,29770.1,2.1] {+} $F.
% 15.54/15.72
% 15.54/15.72 % SZS output end Refutation
% 15.54/15.72 ------------ end of proof -------------
% 15.54/15.72
% 15.54/15.72
% 15.54/15.72 Search stopped by max_proofs option.
% 15.54/15.72
% 15.54/15.72
% 15.54/15.72 Search stopped by max_proofs option.
% 15.54/15.72
% 15.54/15.72 ============ end of search ============
% 15.54/15.72
% 15.54/15.72 ----------- soft-scott stats ----------
% 15.54/15.72
% 15.54/15.72 true clauses given 499 (29.8%)
% 15.54/15.72 false clauses given 1174
% 15.54/15.72
% 15.54/15.72 FALSE TRUE
% 15.54/15.72 13 3 506
% 15.54/15.72 15 3 1340
% 15.54/15.72 17 22 688
% 15.54/15.72 18 199 0
% 15.54/15.72 19 1769 5
% 15.54/15.72 20 458 0
% 15.54/15.72 21 260 0
% 15.54/15.72 tot: 2714 2539 (48.3% true)
% 15.54/15.72
% 15.54/15.72
% 15.54/15.72 Model 3 (0.00 seconds, 0 Inserts)
% 15.54/15.72
% 15.54/15.72 That finishes the proof of the theorem.
% 15.54/15.72
% 15.54/15.72 Process 9217 finished Mon Jul 4 06:42:51 2022
%------------------------------------------------------------------------------