TSTP Solution File: LCL391-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL391-1 : TPTP v8.1.0. Released v2.3.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:29:52 EDT 2022
% Result : Unsatisfiable 66.61s 66.78s
% Output : Refutation 66.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL391-1 : TPTP v8.1.0. Released v2.3.0.
% 0.06/0.11 % Command : sos-script %s
% 0.12/0.32 % Computer : n028.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Sun Jul 3 16:43:03 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.12/0.33 ----- Otter 3.2, August 2001 -----
% 0.12/0.33 The process was started by sandbox on n028.cluster.edu,
% 0.12/0.33 Sun Jul 3 16:43:03 2022
% 0.12/0.33 The command was "./sos". The process ID is 5755.
% 0.12/0.33
% 0.12/0.33 set(prolog_style_variables).
% 0.12/0.33 set(auto).
% 0.12/0.33 dependent: set(auto1).
% 0.12/0.33 dependent: set(process_input).
% 0.12/0.33 dependent: clear(print_kept).
% 0.12/0.33 dependent: clear(print_new_demod).
% 0.12/0.33 dependent: clear(print_back_demod).
% 0.12/0.33 dependent: clear(print_back_sub).
% 0.12/0.33 dependent: set(control_memory).
% 0.12/0.33 dependent: assign(max_mem, 12000).
% 0.12/0.33 dependent: assign(pick_given_ratio, 4).
% 0.12/0.33 dependent: assign(stats_level, 1).
% 0.12/0.33 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.33 dependent: assign(sos_limit, 5000).
% 0.12/0.33 dependent: assign(max_weight, 60).
% 0.12/0.33 clear(print_given).
% 0.12/0.33
% 0.12/0.33 list(usable).
% 0.12/0.33
% 0.12/0.33 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.12/0.33
% 0.12/0.33 This is a Horn set without equality. The strategy will
% 0.12/0.33 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.33 in usable.
% 0.12/0.33
% 0.12/0.33 dependent: set(hyper_res).
% 0.12/0.33 dependent: clear(order_hyper).
% 0.12/0.33
% 0.12/0.33 ------------> process usable:
% 0.12/0.33
% 0.12/0.33 ------------> process sos:
% 0.12/0.33
% 0.12/0.33 ======= end of input processing =======
% 0.12/0.36
% 0.12/0.36 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.36
% 0.12/0.36 Stopped by limit on number of solutions
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36 -------------- Softie stats --------------
% 0.12/0.36
% 0.12/0.36 UPDATE_STOP: 300
% 0.12/0.36 SFINDER_TIME_LIMIT: 2
% 0.12/0.36 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.36 number of clauses in intial UL: 2
% 0.12/0.36 number of clauses initially in problem: 5
% 0.12/0.36 percentage of clauses intially in UL: 40
% 0.12/0.36 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.36 percent of all initial clauses that are short: 100
% 0.12/0.36 absolute distinct symbol count: 5
% 0.12/0.36 distinct predicate count: 1
% 0.12/0.36 distinct function count: 2
% 0.12/0.36 distinct constant count: 2
% 0.12/0.36
% 0.12/0.36 ---------- no more Softie stats ----------
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36 =========== start of search ===========
% 3.51/3.73
% 3.51/3.73
% 3.51/3.73 Changing weight limit from 60 to 57.
% 3.51/3.73
% 3.51/3.73 Model 2 (0.00 seconds, 0 Inserts)
% 3.51/3.73
% 3.51/3.73 Stopped by limit on number of solutions
% 3.51/3.73
% 3.51/3.73 Model 3 (0.00 seconds, 0 Inserts)
% 3.51/3.73
% 3.51/3.73 Stopped by limit on number of solutions
% 3.51/3.73
% 3.51/3.73 Model 4 (0.00 seconds, 0 Inserts)
% 3.51/3.73
% 3.51/3.73 Stopped by limit on number of solutions
% 3.51/3.73
% 3.51/3.73 Stopped by limit on insertions
% 3.51/3.73
% 3.51/3.73 Model 5 [ 1 1 99 ] (0.00 seconds, 250000 Inserts)
% 3.51/3.73
% 3.51/3.73 Resetting weight limit to 57 after 150 givens.
% 3.51/3.73
% 3.61/3.78
% 3.61/3.78
% 3.61/3.78 Changing weight limit from 57 to 52.
% 3.61/3.78
% 3.61/3.78 Resetting weight limit to 52 after 155 givens.
% 3.61/3.78
% 14.28/14.45
% 14.28/14.45
% 14.28/14.45 Changing weight limit from 52 to 41.
% 14.28/14.45
% 14.28/14.45 Stopped by limit on insertions
% 14.28/14.45
% 14.28/14.45 Model 6 [ 1 0 101 ] (0.00 seconds, 250000 Inserts)
% 14.28/14.45
% 14.28/14.45 Stopped by limit on insertions
% 14.28/14.45
% 14.28/14.45 Stopped by limit on insertions
% 14.28/14.45
% 14.28/14.45 Model 7 [ 1 1 1752 ] (0.00 seconds, 250000 Inserts)
% 14.28/14.45
% 14.28/14.45 Resetting weight limit to 41 after 210 givens.
% 14.28/14.45
% 15.99/16.20
% 15.99/16.20
% 15.99/16.20 Changing weight limit from 41 to 39.
% 15.99/16.20
% 15.99/16.20 Resetting weight limit to 39 after 345 givens.
% 15.99/16.20
% 16.09/16.25
% 16.09/16.25
% 16.09/16.25 Changing weight limit from 39 to 28.
% 16.09/16.25
% 16.09/16.25 Resetting weight limit to 28 after 350 givens.
% 16.09/16.25
% 16.09/16.32
% 16.09/16.32
% 16.09/16.32 Changing weight limit from 28 to 26.
% 16.09/16.32
% 16.09/16.32 Resetting weight limit to 26 after 360 givens.
% 16.09/16.32
% 16.18/16.36
% 16.18/16.36
% 16.18/16.36 Changing weight limit from 26 to 25.
% 16.18/16.36
% 16.18/16.36 Resetting weight limit to 25 after 370 givens.
% 16.18/16.36
% 16.28/16.45
% 16.28/16.45
% 16.28/16.45 Changing weight limit from 25 to 23.
% 16.28/16.45
% 16.28/16.45 Resetting weight limit to 23 after 380 givens.
% 16.28/16.45
% 16.29/16.50
% 16.29/16.50
% 16.29/16.50 Changing weight limit from 23 to 22.
% 16.29/16.50
% 16.29/16.50 Resetting weight limit to 22 after 390 givens.
% 16.29/16.50
% 16.41/16.64
% 16.41/16.64
% 16.41/16.64 Changing weight limit from 22 to 21.
% 16.41/16.64
% 16.41/16.64 Modelling stopped after 300 given clauses and 0.00 seconds
% 16.41/16.64
% 16.41/16.64
% 16.41/16.64 Resetting weight limit to 21 after 410 givens.
% 16.41/16.64
% 16.51/16.69
% 16.51/16.69
% 16.51/16.69 Changing weight limit from 21 to 20.
% 16.51/16.69
% 16.51/16.69 Resetting weight limit to 20 after 415 givens.
% 16.51/16.69
% 16.81/16.98
% 16.81/16.98
% 16.81/16.98 Changing weight limit from 20 to 19.
% 16.81/16.98
% 16.81/16.98 Resetting weight limit to 19 after 470 givens.
% 16.81/16.98
% 17.10/17.31
% 17.10/17.31
% 17.10/17.31 Changing weight limit from 19 to 18.
% 17.10/17.31
% 17.10/17.31 Resetting weight limit to 18 after 520 givens.
% 17.10/17.31
% 17.41/17.60
% 17.41/17.60
% 17.41/17.60 Changing weight limit from 18 to 17.
% 17.41/17.60
% 17.41/17.60 Resetting weight limit to 17 after 560 givens.
% 17.41/17.60
% 18.25/18.43
% 18.25/18.43
% 18.25/18.43 Changing weight limit from 17 to 16.
% 18.25/18.43
% 18.25/18.43 Resetting weight limit to 16 after 810 givens.
% 18.25/18.43
% 19.39/19.58
% 19.39/19.58
% 19.39/19.58 Changing weight limit from 16 to 15.
% 19.39/19.58
% 19.39/19.58 Resetting weight limit to 15 after 1140 givens.
% 19.39/19.58
% 66.61/66.78
% 66.61/66.78 -- HEY sandbox, WE HAVE A PROOF!! --
% 66.61/66.78
% 66.61/66.78 ----> UNIT CONFLICT at 60.35 sec ----> 195437 [binary,195436.1,2.1] {+} $F.
% 66.61/66.78
% 66.61/66.78 Length of proof is 52. Level of proof is 29.
% 66.61/66.78
% 66.61/66.78 ---------------- PROOF ----------------
% 66.61/66.78 % SZS status Unsatisfiable
% 66.61/66.78 % SZS output start Refutation
% 66.61/66.78
% 66.61/66.78 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 66.61/66.78 2 [] {+} -is_a_theorem(implies(implies(x,y),implies(implies(x,not(y)),not(x)))).
% 66.61/66.78 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 66.61/66.78 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 66.61/66.78 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 66.61/66.78 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 66.61/66.78 7 [hyper,4,1,3] {+} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 66.61/66.78 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 66.61/66.78 13 [hyper,9,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(not(A),D),B),C))).
% 66.61/66.78 15 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 66.61/66.78 18 [hyper,6,1,6] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 66.61/66.78 21 [hyper,6,1,9] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 66.61/66.78 24 [hyper,21,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 66.61/66.78 26 [hyper,21,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).
% 66.61/66.78 37 [hyper,7,1,3] {+} is_a_theorem(implies(implies(implies(implies(not(A),A),B),C),implies(implies(A,B),C))).
% 66.61/66.78 43 [hyper,7,1,6] {+} 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))).
% 66.61/66.78 46 [hyper,7,1,3] {+} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(B,C),implies(A,C)))).
% 66.61/66.78 55 [hyper,24,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 66.61/66.78 71 [hyper,55,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 66.61/66.78 85 [hyper,71,1,15] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 66.61/66.78 111 [hyper,85,1,4] {+} is_a_theorem(implies(A,implies(B,B))).
% 66.61/66.78 126 [hyper,13,1,5] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(not(implies(A,C)),D))).
% 66.61/66.78 162 [hyper,111,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 66.61/66.78 198 [hyper,162,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(D,D),B),C))).
% 66.61/66.78 203 [hyper,162,1,7] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 66.61/66.78 437 [hyper,203,1,18] {+} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 66.61/66.78 3719 [hyper,437,1,26] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))).
% 66.61/66.78 3757 [hyper,3719,1,437] {-} is_a_theorem(implies(A,implies(implies(not(B),not(C)),implies(C,B)))).
% 66.61/66.78 3805 [hyper,3757,1,3757] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 66.61/66.78 3864 [hyper,3805,1,198] {-} is_a_theorem(implies(implies(implies(A,A),not(B)),implies(B,C))).
% 66.61/66.78 3868 [hyper,3805,1,126] {-} is_a_theorem(implies(not(implies(A,implies(B,A))),C)).
% 66.61/66.78 3898 [hyper,3868,1,46] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 66.61/66.78 4907 [hyper,3898,1,3864] {+} is_a_theorem(implies(not(A),implies(A,B))).
% 66.61/66.78 4939 [hyper,4907,1,437] {+} is_a_theorem(implies(A,implies(not(not(B)),B))).
% 66.61/66.78 4958 [hyper,4907,1,3] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))).
% 66.61/66.78 5108 [hyper,4939,1,4939] {+} is_a_theorem(implies(not(not(A)),A)).
% 66.61/66.78 5540 [hyper,5108,1,3719] {-} is_a_theorem(implies(A,implies(B,not(not(B))))).
% 66.61/66.78 23772 [hyper,4958,1,437] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))).
% 66.61/66.78 23906 [hyper,23772,1,43] {+} is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))).
% 66.61/66.78 24169 [hyper,23906,1,437] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))).
% 66.61/66.78 25187 [hyper,24169,1,6] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(B,A),A))).
% 66.61/66.78 25936 [hyper,25187,1,3898] {+} is_a_theorem(implies(A,implies(implies(A,B),B))).
% 66.61/66.78 25973 [hyper,25187,1,23772] {-} is_a_theorem(implies(implies(implies(implies(implies(A,B),A),A),C),C)).
% 66.61/66.78 26070 [hyper,25187,1,5540] {+} is_a_theorem(implies(implies(implies(A,not(not(A))),B),B)).
% 66.61/66.78 26739 [hyper,25936,1,18] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 66.61/66.78 28570 [hyper,26070,1,6] {+} is_a_theorem(implies(implies(A,B),implies(A,not(not(B))))).
% 66.61/66.78 29415 [hyper,28570,1,3] {+} is_a_theorem(implies(implies(implies(A,not(not(B))),C),implies(implies(A,B),C))).
% 66.61/66.78 44612 [hyper,25973,1,6] {-} is_a_theorem(implies(implies(A,implies(implies(B,C),B)),implies(A,B))).
% 66.61/66.78 54093 [hyper,44612,1,26] {-} is_a_theorem(implies(implies(implies(A,B),not(C)),implies(C,A))).
% 66.61/66.78 54095 [hyper,44612,1,6] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,A),A))).
% 66.61/66.78 54166 [hyper,54093,1,37] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,not(A)))).
% 66.61/66.78 54213 [hyper,54166,1,5] {-} is_a_theorem(implies(not(implies(implies(A,not(B)),implies(B,not(A)))),C)).
% 66.61/66.78 60030 [hyper,54095,1,37] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,not(A)),not(A)))).
% 66.61/66.78 63721 [hyper,60030,1,26739] {-} is_a_theorem(implies(implies(A,not(B)),implies(implies(B,A),not(B)))).
% 66.61/66.78 103555 [hyper,54213,1,46] {-} is_a_theorem(implies(implies(implies(A,not(B)),C),implies(implies(B,not(A)),C))).
% 66.61/66.78 195240 [hyper,103555,1,63721] {-} is_a_theorem(implies(implies(A,not(B)),implies(implies(A,B),not(A)))).
% 66.61/66.78 195436 [hyper,195240,1,29415] {-} is_a_theorem(implies(implies(A,B),implies(implies(A,not(B)),not(A)))).
% 66.61/66.78 195437 [binary,195436.1,2.1] {+} $F.
% 66.61/66.78
% 66.61/66.78 % SZS output end Refutation
% 66.61/66.78 ------------ end of proof -------------
% 66.61/66.78
% 66.61/66.78
% 66.61/66.78 Search stopped by max_proofs option.
% 66.61/66.78
% 66.61/66.78
% 66.61/66.78 Search stopped by max_proofs option.
% 66.61/66.78
% 66.61/66.78 ============ end of search ============
% 66.61/66.78
% 66.61/66.78 ----------- soft-scott stats ----------
% 66.61/66.78
% 66.61/66.78 true clauses given 2020 (27.7%)
% 66.61/66.78 false clauses given 5275
% 66.61/66.78
% 66.61/66.78 FALSE TRUE
% 66.61/66.78 13 1 0
% 66.61/66.78 14 2499 1339
% 66.61/66.78 15 0 1161
% 66.61/66.78 tot: 2500 2500 (50.0% true)
% 66.61/66.78
% 66.61/66.78
% 66.61/66.78 Model 7 [ 1 1 1752 ] (0.00 seconds, 250000 Inserts)
% 66.61/66.78
% 66.61/66.78 That finishes the proof of the theorem.
% 66.61/66.78
% 66.61/66.78 Process 5755 finished Sun Jul 3 16:44:10 2022
%------------------------------------------------------------------------------