TSTP Solution File: LCL385-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL385-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n003.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:50 EDT 2022
% Result : Unsatisfiable 37.03s 37.23s
% Output : Refutation 37.03s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL385-1 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n003.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 00:01:09 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 n003.cluster.edu,
% 0.12/0.35 Mon Jul 4 00:01:09 2022
% 0.12/0.35 The command was "./sos". The process ID is 9552.
% 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: 5
% 0.12/0.37 percentage of clauses intially in UL: 40
% 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: 5
% 0.12/0.37 distinct predicate count: 1
% 0.12/0.37 distinct function count: 2
% 0.12/0.37 distinct constant count: 2
% 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 ===========
% 6.83/7.00
% 6.83/7.00
% 6.83/7.00 Changing weight limit from 60 to 43.
% 6.83/7.00
% 6.83/7.00 Model 2 (0.00 seconds, 0 Inserts)
% 6.83/7.00
% 6.83/7.00 Stopped by limit on number of solutions
% 6.83/7.00
% 6.83/7.00 Model 3 (0.00 seconds, 0 Inserts)
% 6.83/7.00
% 6.83/7.00 Stopped by limit on number of solutions
% 6.83/7.00
% 6.83/7.00 Model 4 (0.00 seconds, 0 Inserts)
% 6.83/7.00
% 6.83/7.00 Stopped by limit on number of solutions
% 6.83/7.00
% 6.83/7.00 Stopped by limit on insertions
% 6.83/7.00
% 6.83/7.00 Resetting weight limit to 43 after 150 givens.
% 6.83/7.00
% 36.53/36.74
% 36.53/36.74
% 36.53/36.74 Changing weight limit from 43 to 27.
% 36.53/36.74
% 36.53/36.74 Stopped by limit on insertions
% 36.53/36.74
% 36.53/36.74 Model 5 [ 1 0 54 ] (0.00 seconds, 250000 Inserts)
% 36.53/36.74
% 36.53/36.74 Stopped by limit on insertions
% 36.53/36.74
% 36.53/36.74 Model 6 [ 1 0 143 ] (0.00 seconds, 250000 Inserts)
% 36.53/36.74
% 36.53/36.74 Stopped by limit on insertions
% 36.53/36.74
% 36.53/36.74 Stopped by limit on insertions
% 36.53/36.74
% 36.53/36.74 Model 7 [ 1 0 37 ] (0.00 seconds, 250000 Inserts)
% 36.53/36.74
% 36.53/36.74 Stopped by limit on insertions
% 36.53/36.74
% 36.53/36.74 Resetting weight limit to 27 after 280 givens.
% 36.53/36.74
% 36.60/36.79
% 36.60/36.79
% 36.60/36.79 Changing weight limit from 27 to 25.
% 36.60/36.79
% 36.60/36.79 Resetting weight limit to 25 after 285 givens.
% 36.60/36.79
% 36.60/36.85
% 36.60/36.85
% 36.60/36.85 Changing weight limit from 25 to 23.
% 36.60/36.85
% 36.60/36.85 Resetting weight limit to 23 after 290 givens.
% 36.60/36.85
% 36.70/36.90
% 36.70/36.90
% 36.70/36.90 Changing weight limit from 23 to 22.
% 36.70/36.90
% 36.70/36.90 Resetting weight limit to 22 after 300 givens.
% 36.70/36.90
% 36.79/36.95
% 36.79/36.95
% 36.79/36.95 Changing weight limit from 22 to 21.
% 36.79/36.95
% 36.79/36.95 Resetting weight limit to 21 after 310 givens.
% 36.79/36.95
% 36.89/37.07
% 36.89/37.07
% 36.89/37.07 Changing weight limit from 21 to 20.
% 36.89/37.07
% 36.89/37.07 Resetting weight limit to 20 after 320 givens.
% 36.89/37.07
% 36.99/37.19
% 36.99/37.19
% 36.99/37.19 Changing weight limit from 20 to 19.
% 36.99/37.19
% 36.99/37.19 Resetting weight limit to 19 after 340 givens.
% 36.99/37.19
% 37.03/37.23
% 37.03/37.23 -- HEY sandbox, WE HAVE A PROOF!! --
% 37.03/37.23
% 37.03/37.23 ----> UNIT CONFLICT at 36.83 sec ----> 12736 [binary,12735.1,2.1] {+} $F.
% 37.03/37.23
% 37.03/37.23 Length of proof is 34. Level of proof is 22.
% 37.03/37.23
% 37.03/37.23 ---------------- PROOF ----------------
% 37.03/37.23 % SZS status Unsatisfiable
% 37.03/37.23 % SZS output start Refutation
% 37.03/37.23
% 37.03/37.23 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 37.03/37.23 2 [] {+} -is_a_theorem(implies(implies(x,not(y)),implies(y,not(x)))).
% 37.03/37.23 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 37.03/37.23 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 37.03/37.23 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 37.03/37.23 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 37.03/37.23 7 [hyper,4,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 37.03/37.23 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 37.03/37.23 12 [hyper,7,1,7] {+} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(not(A),A),B))).
% 37.03/37.23 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))).
% 37.03/37.23 22 [hyper,6,1,6] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 37.03/37.23 29 [hyper,9,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 37.03/37.23 34 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 37.03/37.23 40 [hyper,29,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 37.03/37.23 43 [hyper,29,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).
% 37.03/37.23 57 [hyper,40,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 37.03/37.23 73 [hyper,57,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 37.03/37.23 85 [hyper,73,1,34] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 37.03/37.23 113 [hyper,85,1,4] {+} is_a_theorem(implies(A,implies(B,B))).
% 37.03/37.23 138 [hyper,12,1,85] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 37.03/37.23 183 [hyper,113,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 37.03/37.23 195 [hyper,183,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(D,D),B),C))).
% 37.03/37.23 249 [hyper,138,1,3] {-} is_a_theorem(implies(implies(implies(implies(not(A),A),A),B),implies(C,B))).
% 37.03/37.23 557 [hyper,195,1,249] {-} is_a_theorem(implies(A,implies(implies(implies(B,B),C),C))).
% 37.03/37.23 809 [hyper,22,1,557] {-} is_a_theorem(implies(implies(A,implies(implies(B,B),C)),implies(D,implies(A,C)))).
% 37.03/37.23 3422 [hyper,809,1,249] {-} is_a_theorem(implies(A,implies(implies(implies(implies(not(B),B),B),C),C))).
% 37.03/37.23 3617 [hyper,3422,1,21] {+} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))).
% 37.03/37.23 4041 [hyper,3617,1,57] {+} is_a_theorem(implies(A,implies(B,A))).
% 37.03/37.23 4044 [hyper,3617,1,43] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 37.03/37.23 4056 [hyper,3617,1,6] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(B,A),A))).
% 37.03/37.23 4074 [hyper,4044,1,3617] {-} is_a_theorem(implies(implies(not(A),not(not(A))),A)).
% 37.03/37.23 4136 [hyper,4074,1,195] {-} is_a_theorem(implies(implies(implies(A,A),not(not(B))),B)).
% 37.03/37.23 4174 [hyper,4041,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 37.03/37.23 4238 [hyper,4174,1,4136] {+} is_a_theorem(implies(not(not(A)),A)).
% 37.03/37.23 5008 [hyper,4056,1,4238] {-} is_a_theorem(implies(implies(A,not(A)),not(A))).
% 37.03/37.23 5054 [hyper,5008,1,4041] {-} is_a_theorem(implies(A,implies(implies(B,not(B)),not(B)))).
% 37.03/37.23 5189 [hyper,5054,1,4056] {-} is_a_theorem(implies(implies(implies(implies(A,not(A)),not(A)),B),B)).
% 37.03/37.23 10510 [hyper,5189,1,6] {-} is_a_theorem(implies(implies(A,implies(B,not(B))),implies(A,not(B)))).
% 37.03/37.23 12735 [hyper,10510,1,43] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,not(A)))).
% 37.03/37.23 12736 [binary,12735.1,2.1] {+} $F.
% 37.03/37.23
% 37.03/37.23 % SZS output end Refutation
% 37.03/37.23 ------------ end of proof -------------
% 37.03/37.23
% 37.03/37.23
% 37.03/37.23 Search stopped by max_proofs option.
% 37.03/37.23
% 37.03/37.23
% 37.03/37.23 Search stopped by max_proofs option.
% 37.03/37.23
% 37.03/37.23 ============ end of search ============
% 37.03/37.23
% 37.03/37.23 ----------- soft-scott stats ----------
% 37.03/37.23
% 37.03/37.23 true clauses given 112 (32.0%)
% 37.03/37.23 false clauses given 238
% 37.03/37.23
% 37.03/37.23 FALSE TRUE
% 37.03/37.23 9 0 3
% 37.03/37.23 10 0 65
% 37.03/37.23 11 0 81
% 37.03/37.23 12 26 205
% 37.03/37.23 13 145 315
% 37.03/37.23 14 238 331
% 37.03/37.23 15 444 474
% 37.03/37.23 16 574 572
% 37.03/37.23 17 433 454
% 37.03/37.23 18 404 0
% 37.03/37.23 19 236 0
% 37.03/37.23 tot: 2500 2500 (50.0% true)
% 37.03/37.23
% 37.03/37.23
% 37.03/37.23 Model 7 [ 1 -567 37 ] (0.00 seconds, 250000 Inserts)
% 37.03/37.23
% 37.03/37.23 That finishes the proof of the theorem.
% 37.03/37.23
% 37.03/37.23 Process 9552 finished Mon Jul 4 00:01:46 2022
%------------------------------------------------------------------------------