TSTP Solution File: LCL393-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL393-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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:53 EDT 2022
% Result : Unsatisfiable 281.21s 281.45s
% Output : Refutation 281.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL393-1 : TPTP v8.1.0. Released v2.3.0.
% 0.04/0.14 % Command : sos-script %s
% 0.14/0.36 % Computer : n021.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat Jul 2 13:55:15 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.38 ----- Otter 3.2, August 2001 -----
% 0.14/0.38 The process was started by sandbox2 on n021.cluster.edu,
% 0.14/0.38 Sat Jul 2 13:55:15 2022
% 0.14/0.38 The command was "./sos". The process ID is 1177.
% 0.14/0.38
% 0.14/0.38 set(prolog_style_variables).
% 0.14/0.38 set(auto).
% 0.14/0.38 dependent: set(auto1).
% 0.14/0.38 dependent: set(process_input).
% 0.14/0.38 dependent: clear(print_kept).
% 0.14/0.38 dependent: clear(print_new_demod).
% 0.14/0.38 dependent: clear(print_back_demod).
% 0.14/0.38 dependent: clear(print_back_sub).
% 0.14/0.38 dependent: set(control_memory).
% 0.14/0.38 dependent: assign(max_mem, 12000).
% 0.14/0.38 dependent: assign(pick_given_ratio, 4).
% 0.14/0.38 dependent: assign(stats_level, 1).
% 0.14/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.38 dependent: assign(sos_limit, 5000).
% 0.14/0.38 dependent: assign(max_weight, 60).
% 0.14/0.38 clear(print_given).
% 0.14/0.38
% 0.14/0.38 list(usable).
% 0.14/0.38
% 0.14/0.38 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.14/0.38
% 0.14/0.38 This is a Horn set without equality. The strategy will
% 0.14/0.38 be hyperresolution, with satellites in sos and nuclei
% 0.14/0.38 in usable.
% 0.14/0.38
% 0.14/0.38 dependent: set(hyper_res).
% 0.14/0.38 dependent: clear(order_hyper).
% 0.14/0.38
% 0.14/0.38 ------------> process usable:
% 0.14/0.38
% 0.14/0.38 ------------> process sos:
% 0.14/0.38
% 0.14/0.38 ======= end of input processing =======
% 0.21/0.40
% 0.21/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.40
% 0.21/0.40 Stopped by limit on number of solutions
% 0.21/0.40
% 0.21/0.40
% 0.21/0.40 -------------- Softie stats --------------
% 0.21/0.40
% 0.21/0.40 UPDATE_STOP: 300
% 0.21/0.40 SFINDER_TIME_LIMIT: 2
% 0.21/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.40 number of clauses in intial UL: 2
% 0.21/0.40 number of clauses initially in problem: 5
% 0.21/0.40 percentage of clauses intially in UL: 40
% 0.21/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.21/0.40 percent of all initial clauses that are short: 100
% 0.21/0.40 absolute distinct symbol count: 6
% 0.21/0.40 distinct predicate count: 1
% 0.21/0.40 distinct function count: 2
% 0.21/0.40 distinct constant count: 3
% 0.21/0.40
% 0.21/0.40 ---------- no more Softie stats ----------
% 0.21/0.40
% 0.21/0.40
% 0.21/0.40
% 0.21/0.40 =========== start of search ===========
% 13.65/13.86
% 13.65/13.86
% 13.65/13.86 Changing weight limit from 60 to 59.
% 13.65/13.86
% 13.65/13.86 Model 2 (0.00 seconds, 0 Inserts)
% 13.65/13.86
% 13.65/13.86 Stopped by limit on number of solutions
% 13.65/13.86
% 13.65/13.86 Model 3 (0.00 seconds, 0 Inserts)
% 13.65/13.86
% 13.65/13.86 Stopped by limit on number of solutions
% 13.65/13.86
% 13.65/13.86 Model 4 (0.00 seconds, 0 Inserts)
% 13.65/13.86
% 13.65/13.86 Stopped by limit on number of solutions
% 13.65/13.86
% 13.65/13.86 Stopped by limit on insertions
% 13.65/13.86
% 13.65/13.86 Model 5 [ 1 0 281 ] (0.00 seconds, 250000 Inserts)
% 13.65/13.86
% 13.65/13.86 Stopped by limit on insertions
% 13.65/13.86
% 13.65/13.86 Model 6 [ 1 1 358 ] (0.00 seconds, 250000 Inserts)
% 13.65/13.86
% 13.65/13.86 Stopped by limit on insertions
% 13.65/13.86
% 13.65/13.86 Model 7 [ 1 1 413 ] (0.00 seconds, 250000 Inserts)
% 13.65/13.86
% 13.65/13.86 Stopped by limit on insertions
% 13.65/13.86
% 13.65/13.86 Model 8 [ 1 6 21792 ] (0.00 seconds, 250000 Inserts)
% 13.65/13.86
% 13.65/13.86 Stopped by limit on insertions
% 13.65/13.86
% 13.65/13.86 Model 9 [ 1 9 31276 ] (0.00 seconds, 250000 Inserts)
% 13.65/13.86
% 13.65/13.86 Stopped by limit on insertions
% 13.65/13.86
% 13.65/13.86 Model 10 [ 2 8 30389 ] (0.00 seconds, 250000 Inserts)
% 13.65/13.86
% 13.65/13.86 Resetting weight limit to 59 after 190 givens.
% 13.65/13.86
% 14.67/14.87
% 14.67/14.87
% 14.67/14.87 Changing weight limit from 59 to 50.
% 14.67/14.87
% 14.67/14.87 Resetting weight limit to 50 after 245 givens.
% 14.67/14.87
% 14.67/14.90
% 14.67/14.90
% 14.67/14.90 Changing weight limit from 50 to 38.
% 14.67/14.90
% 14.67/14.90 Resetting weight limit to 38 after 250 givens.
% 14.67/14.90
% 14.75/14.95
% 14.75/14.95
% 14.75/14.95 Changing weight limit from 38 to 33.
% 14.75/14.95
% 14.75/14.95 Resetting weight limit to 33 after 255 givens.
% 14.75/14.95
% 14.80/15.02
% 14.80/15.02
% 14.80/15.02 Changing weight limit from 33 to 29.
% 14.80/15.02
% 14.80/15.02 Resetting weight limit to 29 after 260 givens.
% 14.80/15.02
% 14.90/15.12
% 14.90/15.12
% 14.90/15.12 Changing weight limit from 29 to 27.
% 14.90/15.12
% 14.90/15.12 Resetting weight limit to 27 after 270 givens.
% 14.90/15.12
% 14.98/15.21
% 14.98/15.21
% 14.98/15.21 Changing weight limit from 27 to 26.
% 14.98/15.21
% 14.98/15.21 Resetting weight limit to 26 after 280 givens.
% 14.98/15.21
% 15.04/15.24
% 15.04/15.24
% 15.04/15.24 Changing weight limit from 26 to 25.
% 15.04/15.24
% 15.04/15.24 Resetting weight limit to 25 after 285 givens.
% 15.04/15.24
% 15.08/15.29
% 15.08/15.29
% 15.08/15.29 Changing weight limit from 25 to 24.
% 15.08/15.29
% 15.08/15.29 Resetting weight limit to 24 after 295 givens.
% 15.08/15.29
% 15.16/15.34
% 15.16/15.34
% 15.16/15.34 Changing weight limit from 24 to 23.
% 15.16/15.34
% 15.16/15.34 Resetting weight limit to 23 after 300 givens.
% 15.16/15.34
% 15.29/15.49
% 15.29/15.49
% 15.29/15.49 Changing weight limit from 23 to 21.
% 15.29/15.49
% 15.29/15.49 Resetting weight limit to 21 after 310 givens.
% 15.29/15.49
% 15.39/15.57
% 15.39/15.57
% 15.39/15.57 Changing weight limit from 21 to 20.
% 15.39/15.57
% 15.39/15.57 Resetting weight limit to 20 after 325 givens.
% 15.39/15.57
% 15.51/15.72
% 15.51/15.72
% 15.51/15.72 Changing weight limit from 20 to 19.
% 15.51/15.72
% 15.51/15.72 Resetting weight limit to 19 after 350 givens.
% 15.51/15.72
% 15.66/15.88
% 15.66/15.88
% 15.66/15.88 Changing weight limit from 19 to 18.
% 15.66/15.88
% 15.66/15.88 Resetting weight limit to 18 after 400 givens.
% 15.66/15.88
% 15.93/16.14
% 15.93/16.14
% 15.93/16.14 Changing weight limit from 18 to 17.
% 15.93/16.14
% 15.93/16.14 Modelling stopped after 300 given clauses and 0.00 seconds
% 15.93/16.14
% 15.93/16.14
% 15.93/16.14 Resetting weight limit to 17 after 490 givens.
% 15.93/16.14
% 16.63/16.85
% 16.63/16.85
% 16.63/16.85 Changing weight limit from 17 to 16.
% 16.63/16.85
% 16.63/16.85 Resetting weight limit to 16 after 705 givens.
% 16.63/16.85
% 17.71/17.92
% 17.71/17.92
% 17.71/17.92 Changing weight limit from 16 to 15.
% 17.71/17.92
% 17.71/17.92 Resetting weight limit to 15 after 1035 givens.
% 17.71/17.92
% 281.21/281.45
% 281.21/281.45 -- HEY sandbox2, WE HAVE A PROOF!! --
% 281.21/281.45
% 281.21/281.45 ----> UNIT CONFLICT at 252.63 sec ----> 391291 [binary,391290.1,2.1] {+} $F.
% 281.21/281.45
% 281.21/281.45 Length of proof is 38. Level of proof is 22.
% 281.21/281.45
% 281.21/281.45 ---------------- PROOF ----------------
% 281.21/281.45 % SZS status Unsatisfiable
% 281.21/281.45 % SZS output start Refutation
% 281.21/281.45
% 281.21/281.45 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 281.21/281.45 2 [] {+} -is_a_theorem(implies(implies(not(x),y),implies(implies(x,z),implies(implies(z,y),y)))).
% 281.21/281.45 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 281.21/281.45 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 281.21/281.45 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 281.21/281.45 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 281.21/281.45 7 [hyper,4,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 281.21/281.45 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 281.21/281.45 12 [hyper,7,1,7] {+} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(not(A),A),B))).
% 281.21/281.45 17 [hyper,7,1,3] {-} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(B,C),implies(A,C)))).
% 281.21/281.45 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))).
% 281.21/281.45 22 [hyper,6,1,6] {+} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 281.21/281.45 29 [hyper,9,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 281.21/281.45 34 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 281.21/281.45 40 [hyper,29,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 281.21/281.45 43 [hyper,29,1,3] {+} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).
% 281.21/281.45 57 [hyper,40,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 281.21/281.45 73 [hyper,57,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 281.21/281.45 85 [hyper,73,1,34] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 281.21/281.45 138 [hyper,12,1,85] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 281.21/281.45 249 [hyper,138,1,3] {-} is_a_theorem(implies(implies(implies(implies(not(A),A),A),B),implies(C,B))).
% 281.21/281.45 281 [hyper,249,1,6] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 281.21/281.45 745 [hyper,281,1,281] {-} is_a_theorem(implies(A,implies(implies(B,implies(not(C),C)),implies(B,C)))).
% 281.21/281.45 752 [hyper,281,1,57] {+} is_a_theorem(implies(A,implies(B,implies(C,A)))).
% 281.21/281.45 774 [hyper,752,1,281] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 281.21/281.45 952 [hyper,774,1,17] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 281.21/281.45 1203 [hyper,745,1,745] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))).
% 281.21/281.45 1214 [hyper,745,1,21] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(B,A),A))).
% 281.21/281.45 1368 [hyper,1214,1,22] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(not(C),B),implies(A,C)))).
% 281.21/281.45 1576 [hyper,43,1,1203] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 281.21/281.45 1688 [hyper,952,1,1576] {+} is_a_theorem(implies(not(A),implies(A,B))).
% 281.21/281.45 1691 [hyper,952,1,1214] {+} is_a_theorem(implies(A,implies(implies(A,B),B))).
% 281.21/281.45 2153 [hyper,1691,1,22] {+} is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 281.21/281.45 2169 [hyper,1691,1,1688] {+} is_a_theorem(implies(implies(implies(not(A),implies(A,B)),C),C)).
% 281.21/281.45 2179 [hyper,1691,1,1214] {-} is_a_theorem(implies(implies(implies(implies(not(A),B),implies(implies(B,A),A)),C),C)).
% 281.21/281.45 33869 [hyper,1368,1,2169] {-} is_a_theorem(implies(implies(not(A),B),implies(not(B),A))).
% 281.21/281.45 33969 [hyper,33869,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(implies(not(B),A),C))).
% 281.21/281.45 73608 [hyper,33969,1,2179] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(A,B),B))).
% 281.21/281.45 73790 [hyper,73608,1,5] {-} is_a_theorem(implies(not(implies(implies(not(A),B),implies(implies(A,B),B))),C)).
% 281.21/281.45 128812 [hyper,73790,1,17] {-} is_a_theorem(implies(implies(implies(implies(A,B),B),C),implies(implies(not(A),B),C))).
% 281.21/281.45 253346 [hyper,128812,1,6] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(not(B),C),implies(A,C)))).
% 281.21/281.45 342390 [hyper,253346,1,6] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),C),implies(implies(B,C),C)))).
% 281.21/281.45 391290 [hyper,342390,1,2153] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(A,C),implies(implies(C,B),B)))).
% 281.21/281.45 391291 [binary,391290.1,2.1] {+} $F.
% 281.21/281.45
% 281.21/281.45 % SZS output end Refutation
% 281.21/281.45 ------------ end of proof -------------
% 281.21/281.45
% 281.21/281.45
% 281.21/281.45 Search stopped by max_proofs option.
% 281.21/281.45
% 281.21/281.45
% 281.21/281.45 Search stopped by max_proofs option.
% 281.21/281.45
% 281.21/281.45 ============ end of search ============
% 281.21/281.45
% 281.21/281.45 ----------- soft-scott stats ----------
% 281.21/281.45
% 281.21/281.45 true clauses given 6223 (37.4%)
% 281.21/281.45 false clauses given 10437
% 281.21/281.45
% 281.21/281.45 FALSE TRUE
% 281.21/281.45 14 0 2043
% 281.21/281.45 15 777 457
% 281.21/281.45 tot: 777 2500 (76.3% true)
% 281.21/281.45
% 281.21/281.45
% 281.21/281.45 Model 10 [ 2 8 30389 ] (0.02 seconds, 250000 Inserts)
% 281.21/281.45
% 281.21/281.45 That finishes the proof of the theorem.
% 281.21/281.45
% 281.21/281.45 Process 1177 finished Sat Jul 2 13:59:56 2022
%------------------------------------------------------------------------------