TSTP Solution File: LCL388-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL388-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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 29.64s 29.84s
% Output : Refutation 29.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL388-1 : TPTP v8.1.0. Released v2.3.0.
% 0.00/0.12 % Command : sos-script %s
% 0.13/0.31 % Computer : n027.cluster.edu
% 0.13/0.31 % Model : x86_64 x86_64
% 0.13/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.31 % Memory : 8042.1875MB
% 0.13/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.31 % CPULimit : 300
% 0.13/0.31 % WCLimit : 600
% 0.13/0.31 % DateTime : Sat Jul 2 20:02:54 EDT 2022
% 0.13/0.31 % CPUTime :
% 0.13/0.33 ----- Otter 3.2, August 2001 -----
% 0.13/0.33 The process was started by sandbox on n027.cluster.edu,
% 0.13/0.33 Sat Jul 2 20:02:54 2022
% 0.13/0.33 The command was "./sos". The process ID is 5919.
% 0.13/0.33
% 0.13/0.33 set(prolog_style_variables).
% 0.13/0.33 set(auto).
% 0.13/0.33 dependent: set(auto1).
% 0.13/0.33 dependent: set(process_input).
% 0.13/0.33 dependent: clear(print_kept).
% 0.13/0.33 dependent: clear(print_new_demod).
% 0.13/0.33 dependent: clear(print_back_demod).
% 0.13/0.33 dependent: clear(print_back_sub).
% 0.13/0.33 dependent: set(control_memory).
% 0.13/0.33 dependent: assign(max_mem, 12000).
% 0.13/0.33 dependent: assign(pick_given_ratio, 4).
% 0.13/0.33 dependent: assign(stats_level, 1).
% 0.13/0.33 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.33 dependent: assign(sos_limit, 5000).
% 0.13/0.33 dependent: assign(max_weight, 60).
% 0.13/0.33 clear(print_given).
% 0.13/0.33
% 0.13/0.33 list(usable).
% 0.13/0.33
% 0.13/0.33 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.33
% 0.13/0.33 This is a Horn set without equality. The strategy will
% 0.13/0.33 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.33 in usable.
% 0.13/0.33
% 0.13/0.33 dependent: set(hyper_res).
% 0.13/0.33 dependent: clear(order_hyper).
% 0.13/0.33
% 0.13/0.33 ------------> process usable:
% 0.13/0.33
% 0.13/0.33 ------------> process sos:
% 0.13/0.33
% 0.13/0.33 ======= end of input processing =======
% 0.18/0.36
% 0.18/0.36 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.36
% 0.18/0.36 Stopped by limit on number of solutions
% 0.18/0.36
% 0.18/0.36
% 0.18/0.36 -------------- Softie stats --------------
% 0.18/0.36
% 0.18/0.36 UPDATE_STOP: 300
% 0.18/0.36 SFINDER_TIME_LIMIT: 2
% 0.18/0.36 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.36 number of clauses in intial UL: 2
% 0.18/0.36 number of clauses initially in problem: 5
% 0.18/0.36 percentage of clauses intially in UL: 40
% 0.18/0.36 percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.36 percent of all initial clauses that are short: 100
% 0.18/0.36 absolute distinct symbol count: 6
% 0.18/0.36 distinct predicate count: 1
% 0.18/0.36 distinct function count: 2
% 0.18/0.36 distinct constant count: 3
% 0.18/0.36
% 0.18/0.36 ---------- no more Softie stats ----------
% 0.18/0.36
% 0.18/0.36
% 0.18/0.36
% 0.18/0.36 =========== start of search ===========
% 4.11/4.32
% 4.11/4.32
% 4.11/4.32 Changing weight limit from 60 to 49.
% 4.11/4.32
% 4.11/4.32 Model 2 (0.00 seconds, 0 Inserts)
% 4.11/4.32
% 4.11/4.32 Stopped by limit on number of solutions
% 4.11/4.32
% 4.11/4.32 Model 3 (0.00 seconds, 0 Inserts)
% 4.11/4.32
% 4.11/4.32 Stopped by limit on number of solutions
% 4.11/4.32
% 4.11/4.32 Model 4 (0.00 seconds, 0 Inserts)
% 4.11/4.32
% 4.11/4.32 Stopped by limit on number of solutions
% 4.11/4.32
% 4.11/4.32 Stopped by limit on insertions
% 4.11/4.32
% 4.11/4.32 Model 5 [ 1 1 117 ] (0.00 seconds, 250000 Inserts)
% 4.11/4.32
% 4.11/4.32 Resetting weight limit to 49 after 145 givens.
% 4.11/4.32
% 22.54/22.70
% 22.54/22.70
% 22.54/22.70 Changing weight limit from 49 to 30.
% 22.54/22.70
% 22.54/22.70 Stopped by limit on insertions
% 22.54/22.70
% 22.54/22.70 Model 6 [ 1 1 623 ] (0.00 seconds, 250000 Inserts)
% 22.54/22.70
% 22.54/22.70 Stopped by limit on insertions
% 22.54/22.70
% 22.54/22.70 Model 7 [ 1 0 133 ] (0.00 seconds, 250000 Inserts)
% 22.54/22.70
% 22.54/22.70 Stopped by limit on insertions
% 22.54/22.70
% 22.54/22.70 Stopped by limit on insertions
% 22.54/22.70
% 22.54/22.70 Model 8 [ 1 2 9756 ] (0.00 seconds, 250000 Inserts)
% 22.54/22.70
% 22.54/22.70 Stopped by limit on insertions
% 22.54/22.70
% 22.54/22.70 Model 9 [ 2 1 1951 ] (0.00 seconds, 250000 Inserts)
% 22.54/22.70
% 22.54/22.70 Resetting weight limit to 30 after 300 givens.
% 22.54/22.70
% 23.87/24.08
% 23.87/24.08
% 23.87/24.08 Changing weight limit from 30 to 27.
% 23.87/24.08
% 23.87/24.08 Modelling stopped after 300 given clauses and 0.00 seconds
% 23.87/24.08
% 23.87/24.08
% 23.87/24.08 Resetting weight limit to 27 after 435 givens.
% 23.87/24.08
% 23.95/24.14
% 23.95/24.14
% 23.95/24.14 Changing weight limit from 27 to 26.
% 23.95/24.14
% 23.95/24.14 Resetting weight limit to 26 after 440 givens.
% 23.95/24.14
% 24.02/24.24
% 24.02/24.24
% 24.02/24.24 Changing weight limit from 26 to 25.
% 24.02/24.24
% 24.02/24.24 Resetting weight limit to 25 after 450 givens.
% 24.02/24.24
% 24.12/24.29
% 24.12/24.29
% 24.12/24.29 Changing weight limit from 25 to 24.
% 24.12/24.29
% 24.12/24.29 Resetting weight limit to 24 after 455 givens.
% 24.12/24.29
% 24.17/24.34
% 24.17/24.34
% 24.17/24.34 Changing weight limit from 24 to 23.
% 24.17/24.34
% 24.17/24.34 Resetting weight limit to 23 after 460 givens.
% 24.17/24.34
% 24.27/24.46
% 24.27/24.46
% 24.27/24.46 Changing weight limit from 23 to 22.
% 24.27/24.46
% 24.27/24.46 Resetting weight limit to 22 after 470 givens.
% 24.27/24.46
% 24.34/24.56
% 24.34/24.56
% 24.34/24.56 Changing weight limit from 22 to 21.
% 24.34/24.56
% 24.34/24.56 Resetting weight limit to 21 after 490 givens.
% 24.34/24.56
% 24.47/24.71
% 24.47/24.71
% 24.47/24.71 Changing weight limit from 21 to 20.
% 24.47/24.71
% 24.47/24.71 Resetting weight limit to 20 after 510 givens.
% 24.47/24.71
% 24.63/24.83
% 24.63/24.83
% 24.63/24.83 Changing weight limit from 20 to 19.
% 24.63/24.83
% 24.63/24.83 Resetting weight limit to 19 after 525 givens.
% 24.63/24.83
% 24.85/25.06
% 24.85/25.06
% 24.85/25.06 Changing weight limit from 19 to 18.
% 24.85/25.06
% 24.85/25.06 Resetting weight limit to 18 after 575 givens.
% 24.85/25.06
% 25.36/25.56
% 25.36/25.56
% 25.36/25.56 Changing weight limit from 18 to 17.
% 25.36/25.56
% 25.36/25.56 Resetting weight limit to 17 after 715 givens.
% 25.36/25.56
% 26.64/26.80
% 26.64/26.80
% 26.64/26.80 Changing weight limit from 17 to 16.
% 26.64/26.80
% 26.64/26.80 Resetting weight limit to 16 after 1005 givens.
% 26.64/26.80
% 29.16/29.35
% 29.16/29.35
% 29.16/29.35 Changing weight limit from 16 to 15.
% 29.16/29.35
% 29.16/29.35 Resetting weight limit to 15 after 1485 givens.
% 29.16/29.35
% 29.64/29.84
% 29.64/29.84 -- HEY sandbox, WE HAVE A PROOF!! --
% 29.64/29.84
% 29.64/29.84 ----> UNIT CONFLICT at 29.11 sec ----> 94605 [binary,94604.1,2.1] {+} $F.
% 29.64/29.84
% 29.64/29.84 Length of proof is 42. Level of proof is 28.
% 29.64/29.84
% 29.64/29.84 ---------------- PROOF ----------------
% 29.64/29.84 % SZS status Unsatisfiable
% 29.64/29.84 % SZS output start Refutation
% 29.64/29.84
% 29.64/29.84 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 29.64/29.84 2 [] {+} -is_a_theorem(implies(implies(x,implies(y,z)),implies(x,implies(not(z),not(y))))).
% 29.64/29.84 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 29.64/29.84 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 29.64/29.84 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 29.64/29.84 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 29.64/29.84 7 [hyper,4,1,3] {+} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 29.64/29.84 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 29.64/29.84 15 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 29.64/29.84 18 [hyper,6,1,6] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 29.64/29.84 21 [hyper,6,1,9] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 29.64/29.84 24 [hyper,21,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 29.64/29.84 26 [hyper,21,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).
% 29.64/29.84 37 [hyper,7,1,3] {+} is_a_theorem(implies(implies(implies(implies(not(A),A),B),C),implies(implies(A,B),C))).
% 29.64/29.84 42 [hyper,7,1,9] {-} is_a_theorem(implies(implies(not(implies(implies(not(A),B),C)),implies(implies(not(A),B),C)),implies(A,C))).
% 29.64/29.84 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))).
% 29.64/29.84 55 [hyper,24,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 29.64/29.84 71 [hyper,55,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 29.64/29.84 85 [hyper,71,1,15] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 29.64/29.84 111 [hyper,85,1,4] {+} is_a_theorem(implies(A,implies(B,B))).
% 29.64/29.84 162 [hyper,111,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 29.64/29.84 198 [hyper,162,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(D,D),B),C))).
% 29.64/29.84 203 [hyper,162,1,7] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 29.64/29.84 437 [hyper,203,1,18] {+} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 29.64/29.84 4075 [hyper,437,1,26] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))).
% 29.64/29.84 4139 [hyper,4075,1,437] {-} is_a_theorem(implies(A,implies(implies(not(B),not(C)),implies(C,B)))).
% 29.64/29.84 4210 [hyper,4139,1,4139] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 29.64/29.84 4232 [hyper,4139,1,42] {+} is_a_theorem(implies(A,implies(B,A))).
% 29.64/29.84 4276 [hyper,4210,1,198] {-} is_a_theorem(implies(implies(implies(A,A),not(B)),implies(B,C))).
% 29.64/29.84 4315 [hyper,4232,1,3] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 29.64/29.84 4986 [hyper,4315,1,4276] {-} is_a_theorem(implies(not(A),implies(A,B))).
% 29.64/29.84 5312 [hyper,4986,1,3] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))).
% 29.64/29.84 29069 [hyper,5312,1,437] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))).
% 29.64/29.84 29212 [hyper,29069,1,43] {+} is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))).
% 29.64/29.84 30688 [hyper,29212,1,437] {+} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))).
% 29.64/29.84 45193 [hyper,30688,1,6] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(B,A),A))).
% 29.64/29.84 45321 [hyper,45193,1,4315] {-} is_a_theorem(implies(A,implies(implies(A,B),B))).
% 29.64/29.84 45369 [hyper,45193,1,29069] {-} is_a_theorem(implies(implies(implies(implies(implies(A,B),A),A),C),C)).
% 29.64/29.84 45716 [hyper,45321,1,18] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 29.64/29.84 61916 [hyper,45369,1,6] {-} is_a_theorem(implies(implies(A,implies(implies(B,C),B)),implies(A,B))).
% 29.64/29.84 64960 [hyper,45716,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))).
% 29.64/29.84 73476 [hyper,61916,1,6] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,A),A))).
% 29.64/29.84 89370 [hyper,73476,1,45716] {-} is_a_theorem(implies(implies(A,B),implies(implies(implies(B,C),A),B))).
% 29.64/29.84 94134 [hyper,89370,1,5312] {-} is_a_theorem(implies(not(A),implies(implies(implies(B,C),A),B))).
% 29.64/29.84 94329 [hyper,94134,1,45716] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(not(C),A))).
% 29.64/29.84 94441 [hyper,94329,1,37] {-} is_a_theorem(implies(implies(A,B),implies(not(B),not(A)))).
% 29.64/29.84 94604 [hyper,94441,1,64960] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(A,implies(not(C),not(B))))).
% 29.64/29.84 94605 [binary,94604.1,2.1] {+} $F.
% 29.64/29.84
% 29.64/29.84 % SZS output end Refutation
% 29.64/29.84 ------------ end of proof -------------
% 29.64/29.84
% 29.64/29.84
% 29.64/29.84 Search stopped by max_proofs option.
% 29.64/29.84
% 29.64/29.84
% 29.64/29.84 Search stopped by max_proofs option.
% 29.64/29.84
% 29.64/29.84 ============ end of search ============
% 29.64/29.84
% 29.64/29.84 ----------- soft-scott stats ----------
% 29.64/29.84
% 29.64/29.84 true clauses given 285 (17.9%)
% 29.64/29.84 false clauses given 1310
% 29.64/29.84
% 29.64/29.84 FALSE TRUE
% 29.64/29.84 12 27 208
% 29.64/29.84 13 1392 389
% 29.64/29.84 14 1081 820
% 29.64/29.84 15 0 1083
% 29.64/29.84 tot: 2500 2500 (50.0% true)
% 29.64/29.84
% 29.64/29.84
% 29.64/29.84 Model 9 [ 2 1 1951 ] (0.00 seconds, 250000 Inserts)
% 29.64/29.84
% 29.64/29.84 That finishes the proof of the theorem.
% 29.64/29.84
% 29.64/29.84 Process 5919 finished Sat Jul 2 20:03:23 2022
%------------------------------------------------------------------------------