TSTP Solution File: LCL002-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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:18 EDT 2022
% Result : Unsatisfiable 20.51s 20.68s
% Output : Refutation 20.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n028.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 : Sun Jul 3 00:20:47 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n028.cluster.edu,
% 0.12/0.35 Sun Jul 3 00:20:47 2022
% 0.12/0.35 The command was "./sos". The process ID is 28169.
% 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.37
% 0.12/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.37
% 0.12/0.37 Stopped by limit on number of solutions
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 -------------- Softie stats --------------
% 0.12/0.37
% 0.12/0.37 UPDATE_STOP: 300
% 0.12/0.37 SFINDER_TIME_LIMIT: 2
% 0.12/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.37 number of clauses in intial UL: 2
% 0.12/0.37 number of clauses initially in problem: 3
% 0.12/0.37 percentage of clauses intially in UL: 66
% 0.12/0.37 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.37 percent of all initial clauses that are short: 100
% 0.12/0.37 absolute distinct symbol count: 6
% 0.12/0.37 distinct predicate count: 1
% 0.12/0.37 distinct function count: 2
% 0.12/0.37 distinct constant count: 3
% 0.12/0.37
% 0.12/0.37 ---------- no more Softie stats ----------
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 =========== start of search ===========
% 12.80/13.00
% 12.80/13.00
% 12.80/13.00 Changing weight limit from 60 to 52.
% 12.80/13.00
% 12.80/13.00 Model 2 (0.00 seconds, 0 Inserts)
% 12.80/13.00
% 12.80/13.00 Stopped by limit on number of solutions
% 12.80/13.00
% 12.80/13.00 Model 3 (0.00 seconds, 0 Inserts)
% 12.80/13.00
% 12.80/13.00 Stopped by limit on number of solutions
% 12.80/13.00
% 12.80/13.00 Modelling stopped after 300 given clauses and 0.00 seconds
% 12.80/13.00
% 12.80/13.00
% 12.80/13.00 Resetting weight limit to 52 after 420 givens.
% 12.80/13.00
% 14.94/15.16
% 14.94/15.16
% 14.94/15.16 Changing weight limit from 52 to 37.
% 14.94/15.16
% 14.94/15.16 Resetting weight limit to 37 after 425 givens.
% 14.94/15.16
% 15.40/15.65
% 15.40/15.65
% 15.40/15.65 Changing weight limit from 37 to 35.
% 15.40/15.65
% 15.40/15.65 Resetting weight limit to 35 after 430 givens.
% 15.40/15.65
% 16.84/17.06
% 16.84/17.06
% 16.84/17.06 Changing weight limit from 35 to 33.
% 16.84/17.06
% 16.84/17.06 Resetting weight limit to 33 after 435 givens.
% 16.84/17.06
% 17.05/17.23
% 17.05/17.23
% 17.05/17.23 Changing weight limit from 33 to 32.
% 17.05/17.23
% 17.05/17.23 Resetting weight limit to 32 after 440 givens.
% 17.05/17.23
% 17.30/17.57
% 17.30/17.57
% 17.30/17.57 Changing weight limit from 32 to 31.
% 17.30/17.57
% 17.30/17.57 Resetting weight limit to 31 after 450 givens.
% 17.30/17.57
% 18.12/18.32
% 18.12/18.32
% 18.12/18.32 Changing weight limit from 31 to 30.
% 18.12/18.32
% 18.12/18.32 Resetting weight limit to 30 after 475 givens.
% 18.12/18.32
% 18.24/18.50
% 18.24/18.50
% 18.24/18.50 Changing weight limit from 30 to 29.
% 18.24/18.50
% 18.24/18.50 Resetting weight limit to 29 after 480 givens.
% 18.24/18.50
% 19.20/19.39
% 19.20/19.39
% 19.20/19.39 Changing weight limit from 29 to 27.
% 19.20/19.39
% 19.20/19.39 Resetting weight limit to 27 after 500 givens.
% 19.20/19.39
% 19.36/19.58
% 19.36/19.58
% 19.36/19.58 Changing weight limit from 27 to 26.
% 19.36/19.58
% 19.36/19.58 Resetting weight limit to 26 after 505 givens.
% 19.36/19.58
% 19.50/19.69
% 19.50/19.69
% 19.50/19.69 Changing weight limit from 26 to 25.
% 19.50/19.69
% 19.50/19.69 Resetting weight limit to 25 after 510 givens.
% 19.50/19.69
% 19.82/20.00
% 19.82/20.00
% 19.82/20.00 Changing weight limit from 25 to 24.
% 19.82/20.00
% 19.82/20.00 Resetting weight limit to 24 after 525 givens.
% 19.82/20.00
% 19.89/20.09
% 19.89/20.09
% 19.89/20.09 Changing weight limit from 24 to 23.
% 19.89/20.09
% 19.89/20.09 Resetting weight limit to 23 after 540 givens.
% 19.89/20.09
% 20.34/20.56
% 20.34/20.56
% 20.34/20.56 Changing weight limit from 23 to 21.
% 20.34/20.56
% 20.34/20.56 Resetting weight limit to 21 after 585 givens.
% 20.34/20.56
% 20.51/20.68
% 20.51/20.68 -- HEY sandbox, WE HAVE A PROOF!! --
% 20.51/20.68
% 20.51/20.68 ----> UNIT CONFLICT at 20.23 sec ----> 18221 [binary,18220.1,2.1] {-} $F.
% 20.51/20.68
% 20.51/20.68 Length of proof is 61. Level of proof is 48.
% 20.51/20.68
% 20.51/20.68 ---------------- PROOF ----------------
% 20.51/20.68 % SZS status Unsatisfiable
% 20.51/20.68 % SZS output start Refutation
% 20.51/20.68
% 20.51/20.68 1 [] {+} -is_a_theorem(or(not(A),B))| -is_a_theorem(A)|is_a_theorem(B).
% 20.51/20.68 2 [] {+} -is_a_theorem(or(not(or(not(b),c)),or(not(or(a,b)),or(a,c)))).
% 20.51/20.68 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))))).
% 20.51/20.68 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))))).
% 20.51/20.68 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)))).
% 20.51/20.68 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))))).
% 20.51/20.68 12 [hyper,6,1,3] {-} is_a_theorem(or(not(or(not(A),or(B,or(C,D)))),or(or(not(or(B,or(C,D))),E),or(not(or(not(C),F)),or(B,or(D,F)))))).
% 20.51/20.68 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)))))).
% 20.51/20.68 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)))).
% 20.51/20.68 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))))).
% 20.51/20.68 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)))).
% 20.51/20.68 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)))).
% 20.51/20.68 109 [hyper,94,1,13] {-} is_a_theorem(or(A,or(not(or(not(B),C)),or(not(C),or(C,C))))).
% 20.51/20.68 146 [hyper,109,1,109] {-} is_a_theorem(or(not(or(not(A),B)),or(not(B),or(B,B)))).
% 20.51/20.68 156 [hyper,146,1,3] {-} is_a_theorem(or(not(or(not(A),B)),or(not(A),or(A,B)))).
% 20.51/20.68 168 [hyper,156,1,3] {-} is_a_theorem(or(not(or(not(A),A)),or(not(A),or(B,A)))).
% 20.51/20.68 183 [hyper,168,1,13] {-} is_a_theorem(or(A,or(not(or(not(B),C)),or(not(C),or(D,C))))).
% 20.51/20.68 243 [hyper,183,1,183] {-} is_a_theorem(or(not(or(not(A),B)),or(not(B),or(C,B)))).
% 20.51/20.68 255 [hyper,243,1,10] {-} is_a_theorem(or(not(or(not(A),or(B,C))),or(D,or(not(C),or(B,C))))).
% 20.51/20.68 256 [hyper,243,1,3] {-} is_a_theorem(or(not(or(not(A),B)),or(not(C),or(C,B)))).
% 20.51/20.68 275 [hyper,256,1,3] {-} is_a_theorem(or(not(or(not(A),B)),or(not(A),or(C,B)))).
% 20.51/20.68 391 [hyper,275,1,10] {+} is_a_theorem(or(not(or(not(A),or(B,C))),or(D,or(not(or(B,C)),or(B,C))))).
% 20.51/20.68 401 [hyper,275,1,243] {-} is_a_theorem(or(not(or(not(A),B)),or(C,or(not(B),or(D,B))))).
% 20.51/20.68 573 [hyper,401,1,3] {-} is_a_theorem(or(not(or(not(not(A)),B)),or(C,or(or(D,A),B)))).
% 20.51/20.68 670 [hyper,573,1,3] {-} is_a_theorem(or(not(or(not(or(A,B)),not(B))),or(C,or(D,not(B))))).
% 20.51/20.68 1912 [hyper,255,1,670] {-} is_a_theorem(or(A,or(not(or(B,not(C))),or(D,or(B,not(C)))))).
% 20.51/20.68 2116 [hyper,1912,1,1912] {-} is_a_theorem(or(not(or(A,not(B))),or(C,or(A,not(B))))).
% 20.51/20.68 2170 [hyper,2116,1,3] {-} is_a_theorem(or(not(or(not(not(A)),A)),or(B,or(not(C),A)))).
% 20.51/20.68 2193 [hyper,2170,1,255] {-} is_a_theorem(or(A,or(not(or(not(B),C)),or(D,or(not(B),C))))).
% 20.51/20.68 2587 [hyper,2193,1,2193] {-} is_a_theorem(or(not(or(not(A),B)),or(C,or(not(A),B)))).
% 20.51/20.68 2624 [hyper,2587,1,3] {-} is_a_theorem(or(not(or(not(not(A)),A)),or(B,or(C,A)))).
% 20.51/20.68 2672 [hyper,2624,1,255] {-} is_a_theorem(or(A,or(not(or(B,C)),or(D,or(B,C))))).
% 20.51/20.68 2676 [hyper,2624,1,12] {-} is_a_theorem(or(or(not(or(A,or(B,C))),D),or(not(or(not(B),E)),or(A,or(C,E))))).
% 20.51/20.68 2678 [hyper,2624,1,3] {-} is_a_theorem(or(not(or(not(A),not(B))),or(C,or(B,not(B))))).
% 20.51/20.68 2779 [hyper,2672,1,2672] {-} is_a_theorem(or(not(or(A,B)),or(C,or(A,B)))).
% 20.51/20.68 2789 [hyper,2779,1,275] {-} is_a_theorem(or(not(or(A,B)),or(C,or(D,or(A,B))))).
% 20.51/20.68 2865 [hyper,2789,1,3] {-} is_a_theorem(or(not(or(not(A),B)),or(C,or(or(not(B),D),B)))).
% 20.51/20.68 3115 [hyper,2865,1,3] {-} is_a_theorem(or(not(or(not(or(not(A),B)),C)),or(D,or(A,C)))).
% 20.51/20.68 3136 [hyper,3115,1,2678] {-} is_a_theorem(or(A,or(B,or(C,or(D,not(D)))))).
% 20.51/20.68 3147 [hyper,3115,1,256] {-} is_a_theorem(or(A,or(B,or(not(C),or(C,D))))).
% 20.51/20.68 3246 [hyper,3136,1,3136] {-} is_a_theorem(or(A,or(B,or(C,not(C))))).
% 20.51/20.68 3254 [hyper,3246,1,3246] {+} is_a_theorem(or(A,or(B,not(B)))).
% 20.51/20.68 3259 [hyper,3254,1,3254] {+} is_a_theorem(or(A,not(A))).
% 20.51/20.68 3288 [hyper,3147,1,3147] {-} is_a_theorem(or(A,or(not(B),or(B,C)))).
% 20.51/20.68 3292 [hyper,3288,1,3288] {+} is_a_theorem(or(not(A),or(A,B))).
% 20.51/20.68 3452 [hyper,2676,1,3259] {-} is_a_theorem(not(not(or(or(not(or(A,or(B,C))),D),or(not(or(not(B),E)),or(A,or(C,E))))))).
% 20.51/20.68 3483 [hyper,3452,1,3292] {-} is_a_theorem(or(not(not(or(or(not(or(A,or(B,C))),D),or(not(or(not(B),E)),or(A,or(C,E)))))),F)).
% 20.51/20.68 3643 [hyper,3483,1,243] {+} is_a_theorem(or(not(A),or(B,A))).
% 20.51/20.68 3650 [hyper,3643,1,573] {+} is_a_theorem(or(A,or(or(B,C),or(D,not(C))))).
% 20.51/20.68 3820 [hyper,391,1,3643] {+} is_a_theorem(or(A,or(not(or(B,C)),or(B,C)))).
% 20.51/20.68 11381 [hyper,3650,1,3650] {+} is_a_theorem(or(or(A,B),or(C,not(B)))).
% 20.51/20.68 12648 [hyper,3820,1,3820] {+} is_a_theorem(or(not(or(A,B)),or(A,B))).
% 20.51/20.68 12660 [hyper,3820,1,3] {-} is_a_theorem(or(not(or(not(A),B)),or(not(or(A,C)),or(C,B)))).
% 20.51/20.68 12701 [hyper,12660,1,3] {-} is_a_theorem(or(not(or(not(A),B)),or(not(or(B,A)),or(C,B)))).
% 20.51/20.68 13581 [hyper,12648,1,12660] {-} is_a_theorem(or(not(or(or(A,B),C)),or(C,or(A,B)))).
% 20.51/20.68 15351 [hyper,13581,1,11381] {+} is_a_theorem(or(or(A,not(B)),or(C,B))).
% 20.51/20.68 16047 [hyper,12701,1,3292] {-} is_a_theorem(or(not(or(or(A,B),A)),or(C,or(A,B)))).
% 20.51/20.68 16415 [hyper,16047,1,15351] {+} is_a_theorem(or(A,or(or(B,C),not(C)))).
% 20.51/20.68 16624 [hyper,16415,1,16415] {+} is_a_theorem(or(or(A,B),not(B))).
% 20.51/20.68 17314 [hyper,16624,1,16047] {+} is_a_theorem(or(A,or(not(B),B))).
% 20.51/20.68 17367 [hyper,17314,1,17314] {+} is_a_theorem(or(not(A),A)).
% 20.51/20.68 17710 [hyper,17367,1,12660] {-} is_a_theorem(or(not(or(A,B)),or(B,A))).
% 20.51/20.68 17774 [hyper,17710,1,3643] {-} is_a_theorem(or(A,or(not(or(B,C)),or(C,B)))).
% 20.51/20.68 18220 [hyper,17774,1,3] {-} is_a_theorem(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))).
% 20.51/20.68 18221 [binary,18220.1,2.1] {-} $F.
% 20.51/20.68
% 20.51/20.68 % SZS output end Refutation
% 20.51/20.68 ------------ end of proof -------------
% 20.51/20.68
% 20.51/20.68
% 20.51/20.68 Search stopped by max_proofs option.
% 20.51/20.68
% 20.51/20.68
% 20.51/20.68 Search stopped by max_proofs option.
% 20.51/20.68
% 20.51/20.68 ============ end of search ============
% 20.51/20.68
% 20.51/20.68 ----------- soft-scott stats ----------
% 20.51/20.68
% 20.51/20.68 true clauses given 179 (29.9%)
% 20.51/20.68 false clauses given 420
% 20.51/20.68
% 20.51/20.68 FALSE TRUE
% 20.51/20.68 7 0 5
% 20.51/20.68 9 0 29
% 20.51/20.68 11 3 182
% 20.51/20.68 13 32 521
% 20.51/20.68 15 311 575
% 20.51/20.68 16 0 2
% 20.51/20.68 17 677 523
% 20.51/20.68 18 0 15
% 20.51/20.68 19 870 507
% 20.51/20.68 20 0 49
% 20.51/20.68 21 816 225
% 20.51/20.68 tot: 2709 2633 (49.3% true)
% 20.51/20.68
% 20.51/20.68
% 20.51/20.68 Model 3 (0.00 seconds, 0 Inserts)
% 20.51/20.68
% 20.51/20.68 That finishes the proof of the theorem.
% 20.51/20.68
% 20.51/20.68 Process 28169 finished Sun Jul 3 00:21:08 2022
%------------------------------------------------------------------------------