TSTP Solution File: LCL402-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL402-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:57 EDT 2022
% Result : Unsatisfiable 27.20s 27.44s
% Output : Refutation 27.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.15 % Problem : LCL402-1 : TPTP v8.1.0. Released v2.3.0.
% 0.08/0.16 % Command : sos-script %s
% 0.15/0.38 % Computer : n021.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 300
% 0.15/0.38 % WCLimit : 600
% 0.15/0.38 % DateTime : Mon Jul 4 08:17:46 EDT 2022
% 0.15/0.38 % CPUTime :
% 0.15/0.40 ----- Otter 3.2, August 2001 -----
% 0.15/0.40 The process was started by sandbox2 on n021.cluster.edu,
% 0.15/0.40 Mon Jul 4 08:17:46 2022
% 0.15/0.40 The command was "./sos". The process ID is 7120.
% 0.15/0.40
% 0.15/0.40 set(prolog_style_variables).
% 0.15/0.40 set(auto).
% 0.15/0.40 dependent: set(auto1).
% 0.15/0.40 dependent: set(process_input).
% 0.15/0.40 dependent: clear(print_kept).
% 0.15/0.40 dependent: clear(print_new_demod).
% 0.15/0.40 dependent: clear(print_back_demod).
% 0.15/0.40 dependent: clear(print_back_sub).
% 0.15/0.40 dependent: set(control_memory).
% 0.15/0.40 dependent: assign(max_mem, 12000).
% 0.15/0.40 dependent: assign(pick_given_ratio, 4).
% 0.15/0.40 dependent: assign(stats_level, 1).
% 0.15/0.40 dependent: assign(pick_semantic_ratio, 3).
% 0.15/0.40 dependent: assign(sos_limit, 5000).
% 0.15/0.40 dependent: assign(max_weight, 60).
% 0.15/0.40 clear(print_given).
% 0.15/0.40
% 0.15/0.40 list(usable).
% 0.15/0.40
% 0.15/0.40 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.15/0.40
% 0.15/0.40 This is a Horn set without equality. The strategy will
% 0.15/0.40 be hyperresolution, with satellites in sos and nuclei
% 0.15/0.40 in usable.
% 0.15/0.40
% 0.15/0.40 dependent: set(hyper_res).
% 0.15/0.40 dependent: clear(order_hyper).
% 0.15/0.40
% 0.15/0.40 ------------> process usable:
% 0.15/0.40
% 0.15/0.40 ------------> process sos:
% 0.15/0.40
% 0.15/0.40 ======= end of input processing =======
% 0.23/0.42
% 0.23/0.42 Model 1 (0.00 seconds, 0 Inserts)
% 0.23/0.42
% 0.23/0.42 Stopped by limit on number of solutions
% 0.23/0.42
% 0.23/0.42
% 0.23/0.42 -------------- Softie stats --------------
% 0.23/0.42
% 0.23/0.42 UPDATE_STOP: 300
% 0.23/0.42 SFINDER_TIME_LIMIT: 2
% 0.23/0.42 SHORT_CLAUSE_CUTOFF: 4
% 0.23/0.42 number of clauses in intial UL: 2
% 0.23/0.42 number of clauses initially in problem: 5
% 0.23/0.42 percentage of clauses intially in UL: 40
% 0.23/0.42 percentage of distinct symbols occuring in initial UL: 100
% 0.23/0.42 percent of all initial clauses that are short: 100
% 0.23/0.42 absolute distinct symbol count: 5
% 0.23/0.42 distinct predicate count: 1
% 0.23/0.42 distinct function count: 2
% 0.23/0.42 distinct constant count: 2
% 0.23/0.42
% 0.23/0.42 ---------- no more Softie stats ----------
% 0.23/0.42
% 0.23/0.42
% 0.23/0.42
% 0.23/0.42 =========== start of search ===========
% 27.20/27.44
% 27.20/27.44 -- HEY sandbox2, WE HAVE A PROOF!! --
% 27.20/27.44
% 27.20/27.44 Model 2 (0.00 seconds, 0 Inserts)
% 27.20/27.44
% 27.20/27.44 Stopped by limit on number of solutions
% 27.20/27.44
% 27.20/27.44 Model 3 (0.00 seconds, 0 Inserts)
% 27.20/27.44
% 27.20/27.44 Stopped by limit on number of solutions
% 27.20/27.44
% 27.20/27.44 Model 4 (0.00 seconds, 0 Inserts)
% 27.20/27.44
% 27.20/27.44 Stopped by limit on number of solutions
% 27.20/27.44
% 27.20/27.44 Stopped by limit on insertions
% 27.20/27.44
% 27.20/27.44 Model 5 [ 1 0 205 ] (0.00 seconds, 250000 Inserts)
% 27.20/27.44
% 27.20/27.44 Stopped by limit on insertions
% 27.20/27.44
% 27.20/27.44 Model 6 [ 1 0 141 ] (0.00 seconds, 250000 Inserts)
% 27.20/27.44
% 27.20/27.44 Stopped by limit on insertions
% 27.20/27.44
% 27.20/27.44 Model 7 [ 1 0 330 ] (0.00 seconds, 250000 Inserts)
% 27.20/27.44
% 27.20/27.44 Stopped by limit on insertions
% 27.20/27.44
% 27.20/27.44 Model 8 [ 1 0 92 ] (0.00 seconds, 250000 Inserts)
% 27.20/27.44
% 27.20/27.44 Stopped by limit on insertions
% 27.20/27.44
% 27.20/27.44 Model 9 [ 1 1 488 ] (0.00 seconds, 250000 Inserts)
% 27.20/27.44
% 27.20/27.44 Stopped by limit on insertions
% 27.20/27.44
% 27.20/27.44 Model 10 [ 2 0 80 ] (0.00 seconds, 250000 Inserts)
% 27.20/27.44
% 27.20/27.44 ----> UNIT CONFLICT at 27.00 sec ----> 3282 [binary,3281.1,2.1] {+} $F.
% 27.20/27.44
% 27.20/27.44 Length of proof is 33. Level of proof is 19.
% 27.20/27.44
% 27.20/27.44 ---------------- PROOF ----------------
% 27.20/27.44 % SZS status Unsatisfiable
% 27.20/27.44 % SZS output start Refutation
% 27.20/27.44
% 27.20/27.44 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 27.20/27.44 2 [] {+} -is_a_theorem(implies(not(implies(x,not(y))),y)).
% 27.20/27.44 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 27.20/27.44 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 27.20/27.44 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 27.20/27.44 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 27.20/27.44 7 [hyper,4,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 27.20/27.44 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 27.20/27.44 12 [hyper,7,1,7] {+} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(not(A),A),B))).
% 27.20/27.44 29 [hyper,9,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 27.20/27.44 34 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 27.20/27.44 40 [hyper,29,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 27.20/27.44 43 [hyper,29,1,3] {+} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).
% 27.20/27.44 60 [hyper,40,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 27.20/27.44 78 [hyper,60,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 27.20/27.44 91 [hyper,78,1,34] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 27.20/27.44 119 [hyper,91,1,4] {+} is_a_theorem(implies(A,implies(B,B))).
% 27.20/27.44 183 [hyper,119,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 27.20/27.44 184 [hyper,12,1,91] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 27.20/27.44 208 [hyper,183,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(D,D),B),C))).
% 27.20/27.44 280 [hyper,184,1,3] {-} is_a_theorem(implies(implies(implies(implies(not(A),A),A),B),implies(C,B))).
% 27.20/27.44 319 [hyper,280,1,6] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 27.20/27.44 918 [hyper,319,1,319] {-} is_a_theorem(implies(A,implies(implies(B,implies(not(C),C)),implies(B,C)))).
% 27.20/27.44 925 [hyper,319,1,60] {+} is_a_theorem(implies(A,implies(B,implies(C,A)))).
% 27.20/27.44 1005 [hyper,925,1,7] {-} is_a_theorem(implies(implies(not(A),A),implies(B,implies(C,A)))).
% 27.20/27.44 1054 [hyper,1005,1,319] {-} is_a_theorem(implies(A,implies(implies(not(B),B),implies(C,B)))).
% 27.20/27.44 1066 [hyper,1054,1,1054] {-} is_a_theorem(implies(implies(not(A),A),implies(B,A))).
% 27.20/27.44 1090 [hyper,1066,1,9] {+} is_a_theorem(implies(A,implies(B,A))).
% 27.20/27.44 1201 [hyper,1090,1,3] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 27.20/27.44 1422 [hyper,918,1,918] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))).
% 27.20/27.44 1438 [hyper,1422,1,1422] {-} is_a_theorem(implies(implies(not(A),implies(not(A),A)),A)).
% 27.20/27.44 1600 [hyper,43,1,1438] {-} is_a_theorem(implies(implies(not(A),not(not(A))),A)).
% 27.20/27.44 1602 [hyper,43,1,1422] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 27.20/27.44 1645 [hyper,1600,1,208] {-} is_a_theorem(implies(implies(implies(A,A),not(not(B))),B)).
% 27.20/27.44 1904 [hyper,1201,1,1645] {+} is_a_theorem(implies(not(not(A)),A)).
% 27.20/27.44 1923 [hyper,1904,1,1602] {+} is_a_theorem(implies(A,not(not(A)))).
% 27.20/27.44 2086 [hyper,1923,1,1201] {+} is_a_theorem(implies(A,not(not(implies(B,A))))).
% 27.20/27.44 3281 [hyper,2086,1,1602] {-} is_a_theorem(implies(not(implies(A,not(B))),B)).
% 27.20/27.44 3282 [binary,3281.1,2.1] {+} $F.
% 27.20/27.44
% 27.20/27.44 % SZS output end Refutation
% 27.20/27.44 ------------ end of proof -------------
% 27.20/27.44
% 27.20/27.44
% 27.20/27.44 Search stopped by max_proofs option.
% 27.20/27.44
% 27.20/27.44
% 27.20/27.44 Search stopped by max_proofs option.
% 27.20/27.44
% 27.20/27.44 ============ end of search ============
% 27.20/27.44
% 27.20/27.44 ----------- soft-scott stats ----------
% 27.20/27.44
% 27.20/27.44 true clauses given 56 (33.1%)
% 27.20/27.44 false clauses given 113
% 27.20/27.44
% 27.20/27.44 FALSE TRUE
% 27.20/27.44 8 0 2
% 27.20/27.44 9 0 12
% 27.20/27.44 10 0 36
% 27.20/27.44 11 0 48
% 27.20/27.44 12 15 80
% 27.20/27.44 13 76 68
% 27.20/27.44 14 80 109
% 27.20/27.44 15 135 127
% 27.20/27.44 16 101 149
% 27.20/27.44 17 108 167
% 27.20/27.44 18 91 147
% 27.20/27.44 19 110 137
% 27.20/27.44 20 103 110
% 27.20/27.44 21 63 143
% 27.20/27.44 22 32 107
% 27.20/27.44 23 28 85
% 27.20/27.44 24 16 68
% 27.20/27.44 25 19 60
% 27.20/27.44 26 14 37
% 27.20/27.44 27 38 25
% 27.20/27.44 28 10 31
% 27.20/27.44 29 18 28
% 27.20/27.44 30 29 14
% 27.20/27.44 31 13 34
% 27.20/27.44 32 11 15
% 27.20/27.44 33 2 16
% 27.20/27.44 34 9 19
% 27.20/27.44 35 1 10
% 27.20/27.44 36 2 14
% 27.20/27.44 37 1 8
% 27.20/27.44 38 1 7
% 27.20/27.44 39 0 8
% 27.20/27.44 40 1 7
% 27.20/27.44 41 0 2
% 27.20/27.44 42 0 5
% 27.20/27.44 43 0 3
% 27.20/27.44 44 0 1
% 27.20/27.44 45 0 1
% 27.20/27.44 46 0 3
% 27.20/27.44 48 0 1
% 27.20/27.44 49 0 2
% 27.20/27.44 51 0 1
% 27.20/27.44 52 0 2
% 27.20/27.44 59 0 1
% 27.20/27.44 tot: 1127 1950 (63.4% true)
% 27.20/27.44
% 27.20/27.44
% 27.20/27.44 Model 10 [ 2 0 80 ] (0.00 seconds, 250000 Inserts)
% 27.20/27.44
% 27.20/27.44 That finishes the proof of the theorem.
% 27.20/27.44
% 27.20/27.44 Process 7120 finished Mon Jul 4 08:18:13 2022
%------------------------------------------------------------------------------