TSTP Solution File: LCL387-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL387-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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:51 EDT 2022
% Result : Unsatisfiable 24.89s 25.09s
% Output : Refutation 24.89s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : LCL387-1 : TPTP v8.1.0. Released v2.3.0.
% 0.13/0.14 % Command : sos-script %s
% 0.15/0.36 % Computer : n026.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Mon Jul 4 09:24:22 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.15/0.39 ----- Otter 3.2, August 2001 -----
% 0.15/0.39 The process was started by sandbox2 on n026.cluster.edu,
% 0.15/0.39 Mon Jul 4 09:24:22 2022
% 0.15/0.39 The command was "./sos". The process ID is 25845.
% 0.15/0.39
% 0.15/0.39 set(prolog_style_variables).
% 0.15/0.39 set(auto).
% 0.15/0.39 dependent: set(auto1).
% 0.15/0.39 dependent: set(process_input).
% 0.15/0.39 dependent: clear(print_kept).
% 0.15/0.39 dependent: clear(print_new_demod).
% 0.15/0.39 dependent: clear(print_back_demod).
% 0.15/0.39 dependent: clear(print_back_sub).
% 0.15/0.39 dependent: set(control_memory).
% 0.15/0.39 dependent: assign(max_mem, 12000).
% 0.15/0.39 dependent: assign(pick_given_ratio, 4).
% 0.15/0.39 dependent: assign(stats_level, 1).
% 0.15/0.39 dependent: assign(pick_semantic_ratio, 3).
% 0.15/0.39 dependent: assign(sos_limit, 5000).
% 0.15/0.39 dependent: assign(max_weight, 60).
% 0.15/0.39 clear(print_given).
% 0.15/0.39
% 0.15/0.39 list(usable).
% 0.15/0.39
% 0.15/0.39 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.15/0.39
% 0.15/0.39 This is a Horn set without equality. The strategy will
% 0.15/0.39 be hyperresolution, with satellites in sos and nuclei
% 0.15/0.39 in usable.
% 0.15/0.39
% 0.15/0.39 dependent: set(hyper_res).
% 0.15/0.39 dependent: clear(order_hyper).
% 0.15/0.39
% 0.15/0.39 ------------> process usable:
% 0.15/0.39
% 0.15/0.39 ------------> process sos:
% 0.15/0.39
% 0.15/0.39 ======= end of input processing =======
% 0.15/0.41
% 0.15/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.15/0.41
% 0.15/0.41 Stopped by limit on number of solutions
% 0.15/0.41
% 0.15/0.41
% 0.15/0.41 -------------- Softie stats --------------
% 0.15/0.41
% 0.15/0.41 UPDATE_STOP: 300
% 0.15/0.41 SFINDER_TIME_LIMIT: 2
% 0.15/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.15/0.41 number of clauses in intial UL: 2
% 0.15/0.41 number of clauses initially in problem: 5
% 0.15/0.41 percentage of clauses intially in UL: 40
% 0.15/0.41 percentage of distinct symbols occuring in initial UL: 100
% 0.15/0.41 percent of all initial clauses that are short: 100
% 0.15/0.41 absolute distinct symbol count: 6
% 0.15/0.41 distinct predicate count: 1
% 0.15/0.41 distinct function count: 2
% 0.15/0.41 distinct constant count: 3
% 0.15/0.41
% 0.15/0.41 ---------- no more Softie stats ----------
% 0.15/0.41
% 0.15/0.41
% 0.15/0.41
% 0.15/0.41 =========== start of search ===========
% 5.27/5.51
% 5.27/5.51
% 5.27/5.51 Changing weight limit from 60 to 49.
% 5.27/5.51
% 5.27/5.51 Model 2 (0.00 seconds, 0 Inserts)
% 5.27/5.51
% 5.27/5.51 Stopped by limit on number of solutions
% 5.27/5.51
% 5.27/5.51 Model 3 (0.00 seconds, 0 Inserts)
% 5.27/5.51
% 5.27/5.51 Stopped by limit on number of solutions
% 5.27/5.51
% 5.27/5.51 Model 4 (0.00 seconds, 0 Inserts)
% 5.27/5.51
% 5.27/5.51 Stopped by limit on number of solutions
% 5.27/5.51
% 5.27/5.51 Stopped by limit on insertions
% 5.27/5.51
% 5.27/5.51 Model 5 [ 1 0 156 ] (0.00 seconds, 250000 Inserts)
% 5.27/5.51
% 5.27/5.51 Resetting weight limit to 49 after 140 givens.
% 5.27/5.51
% 15.64/15.81
% 15.64/15.81
% 15.64/15.81 Changing weight limit from 49 to 36.
% 15.64/15.81
% 15.64/15.81 Stopped by limit on insertions
% 15.64/15.81
% 15.64/15.81 Model 6 [ 1 1 337 ] (0.00 seconds, 250000 Inserts)
% 15.64/15.81
% 15.64/15.81 Stopped by limit on insertions
% 15.64/15.81
% 15.64/15.81 Model 7 [ 1 1 273 ] (0.00 seconds, 250000 Inserts)
% 15.64/15.81
% 15.64/15.81 Resetting weight limit to 36 after 300 givens.
% 15.64/15.81
% 15.72/15.90
% 15.72/15.90
% 15.72/15.90 Changing weight limit from 36 to 32.
% 15.72/15.90
% 15.72/15.90 Resetting weight limit to 32 after 305 givens.
% 15.72/15.90
% 15.85/16.02
% 15.85/16.02
% 15.85/16.02 Changing weight limit from 32 to 30.
% 15.85/16.02
% 15.85/16.02 Resetting weight limit to 30 after 310 givens.
% 15.85/16.02
% 15.87/16.06
% 15.87/16.06
% 15.87/16.06 Changing weight limit from 30 to 29.
% 15.87/16.06
% 15.87/16.06 Resetting weight limit to 29 after 315 givens.
% 15.87/16.06
% 15.95/16.14
% 15.95/16.14
% 15.95/16.14 Changing weight limit from 29 to 27.
% 15.95/16.14
% 15.95/16.14 Resetting weight limit to 27 after 320 givens.
% 15.95/16.14
% 16.03/16.26
% 16.03/16.26
% 16.03/16.26 Changing weight limit from 27 to 26.
% 16.03/16.26
% 16.03/16.26 Resetting weight limit to 26 after 330 givens.
% 16.03/16.26
% 16.11/16.35
% 16.11/16.35
% 16.11/16.35 Changing weight limit from 26 to 22.
% 16.11/16.35
% 16.11/16.35 Resetting weight limit to 22 after 335 givens.
% 16.11/16.35
% 16.35/16.53
% 16.35/16.53
% 16.35/16.53 Changing weight limit from 22 to 20.
% 16.35/16.53
% 16.35/16.53 Resetting weight limit to 20 after 350 givens.
% 16.35/16.53
% 21.72/21.93
% 21.72/21.93
% 21.72/21.93 Changing weight limit from 20 to 19.
% 21.72/21.93
% 21.72/21.93 Stopped by limit on insertions
% 21.72/21.93
% 21.72/21.93 Model 8 [ 1 0 2820 ] (0.00 seconds, 250000 Inserts)
% 21.72/21.93
% 21.72/21.93 Modelling stopped after 300 given clauses and 0.00 seconds
% 21.72/21.93
% 21.72/21.93
% 21.72/21.93 Resetting weight limit to 19 after 535 givens.
% 21.72/21.93
% 22.17/22.35
% 22.17/22.35
% 22.17/22.35 Changing weight limit from 19 to 18.
% 22.17/22.35
% 22.17/22.35 Resetting weight limit to 18 after 610 givens.
% 22.17/22.35
% 22.83/23.01
% 22.83/23.01
% 22.83/23.01 Changing weight limit from 18 to 17.
% 22.83/23.01
% 22.83/23.01 Resetting weight limit to 17 after 760 givens.
% 22.83/23.01
% 24.20/24.37
% 24.20/24.37
% 24.20/24.37 Changing weight limit from 17 to 16.
% 24.20/24.37
% 24.20/24.37 Resetting weight limit to 16 after 1060 givens.
% 24.20/24.37
% 24.89/25.09
% 24.89/25.09 -- HEY sandbox2, WE HAVE A PROOF!! --
% 24.89/25.09
% 24.89/25.09 ----> UNIT CONFLICT at 24.46 sec ----> 64991 [binary,64990.1,2.1] {-} $F.
% 24.89/25.09
% 24.89/25.09 Length of proof is 40. Level of proof is 26.
% 24.89/25.09
% 24.89/25.09 ---------------- PROOF ----------------
% 24.89/25.09 % SZS status Unsatisfiable
% 24.89/25.09 % SZS output start Refutation
% 24.89/25.09
% 24.89/25.09 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 24.89/25.09 2 [] {+} -is_a_theorem(implies(implies(implies(not(x),y),z),implies(implies(not(y),x),z))).
% 24.89/25.09 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 24.89/25.09 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 24.89/25.09 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 24.89/25.09 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 24.89/25.09 7 [hyper,4,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 24.89/25.09 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 24.89/25.09 12 [hyper,7,1,7] {+} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(not(A),A),B))).
% 24.89/25.09 17 [hyper,7,1,3] {-} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(B,C),implies(A,C)))).
% 24.89/25.09 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))).
% 24.89/25.09 22 [hyper,6,1,6] {+} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 24.89/25.09 29 [hyper,9,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 24.89/25.09 31 [hyper,9,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(not(A),D),B),C))).
% 24.89/25.09 34 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 24.89/25.09 40 [hyper,29,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 24.89/25.09 43 [hyper,29,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).
% 24.89/25.09 60 [hyper,40,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 24.89/25.09 78 [hyper,60,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 24.89/25.09 91 [hyper,78,1,34] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 24.89/25.09 119 [hyper,91,1,4] {+} is_a_theorem(implies(A,implies(B,B))).
% 24.89/25.09 176 [hyper,31,1,5] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(not(implies(A,C)),D))).
% 24.89/25.09 183 [hyper,119,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 24.89/25.09 184 [hyper,12,1,91] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 24.89/25.09 208 [hyper,183,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(D,D),B),C))).
% 24.89/25.09 280 [hyper,184,1,3] {-} is_a_theorem(implies(implies(implies(implies(not(A),A),A),B),implies(C,B))).
% 24.89/25.09 319 [hyper,280,1,6] {+} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 24.89/25.09 4690 [hyper,319,1,43] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))).
% 24.89/25.09 4734 [hyper,4690,1,319] {-} is_a_theorem(implies(A,implies(implies(not(B),not(C)),implies(C,B)))).
% 24.89/25.09 4828 [hyper,4734,1,4734] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 24.89/25.09 4874 [hyper,4828,1,208] {-} is_a_theorem(implies(implies(implies(A,A),not(B)),implies(B,C))).
% 24.89/25.09 4877 [hyper,4828,1,176] {-} is_a_theorem(implies(not(implies(A,implies(B,A))),C)).
% 24.89/25.09 4915 [hyper,4877,1,17] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 24.89/25.09 6325 [hyper,4915,1,4874] {+} is_a_theorem(implies(not(A),implies(A,B))).
% 24.89/25.09 6423 [hyper,6325,1,3] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))).
% 24.89/25.09 30784 [hyper,6423,1,319] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))).
% 24.89/25.09 30929 [hyper,30784,1,21] {+} is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))).
% 24.89/25.09 32059 [hyper,30929,1,319] {+} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))).
% 24.89/25.09 44523 [hyper,32059,1,6] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(B,A),A))).
% 24.89/25.09 44656 [hyper,44523,1,4915] {-} is_a_theorem(implies(A,implies(implies(A,B),B))).
% 24.89/25.09 45097 [hyper,44656,1,22] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 24.89/25.09 62224 [hyper,45097,1,44523] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(B),A),B))).
% 24.89/25.09 64506 [hyper,62224,1,6423] {-} is_a_theorem(implies(not(A),implies(implies(not(B),A),B))).
% 24.89/25.09 64793 [hyper,64506,1,45097] {-} is_a_theorem(implies(implies(not(A),B),implies(not(B),A))).
% 24.89/25.09 64990 [hyper,64793,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(implies(not(B),A),C))).
% 24.89/25.09 64991 [binary,64990.1,2.1] {-} $F.
% 24.89/25.09
% 24.89/25.09 % SZS output end Refutation
% 24.89/25.09 ------------ end of proof -------------
% 24.89/25.09
% 24.89/25.09
% 24.89/25.09 Search stopped by max_proofs option.
% 24.89/25.09
% 24.89/25.09
% 24.89/25.09 Search stopped by max_proofs option.
% 24.89/25.09
% 24.89/25.09 ============ end of search ============
% 24.89/25.09
% 24.89/25.09 ----------- soft-scott stats ----------
% 24.89/25.09
% 24.89/25.09 true clauses given 281 (23.5%)
% 24.89/25.09 false clauses given 917
% 24.89/25.09
% 24.89/25.09 FALSE TRUE
% 24.89/25.09 11 11 3
% 24.89/25.09 12 172 171
% 24.89/25.09 13 1092 366
% 24.89/25.09 14 1353 630
% 24.89/25.09 15 133 895
% 24.89/25.09 16 159 461
% 24.89/25.09 tot: 2920 2526 (46.4% true)
% 24.89/25.09
% 24.89/25.09
% 24.89/25.09 Model 8 [ 1 0 2820 ] (0.00 seconds, 250000 Inserts)
% 24.89/25.09
% 24.89/25.09 That finishes the proof of the theorem.
% 24.89/25.09
% 24.89/25.09 Process 25845 finished Mon Jul 4 09:24:46 2022
%------------------------------------------------------------------------------