TSTP Solution File: LCL379-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL379-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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:48 EDT 2022
% Result : Unsatisfiable 0.69s 0.88s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : LCL379-1 : TPTP v8.1.0. Released v2.3.0.
% 0.02/0.12 % Command : sos-script %s
% 0.12/0.31 % Computer : n028.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 600
% 0.12/0.31 % DateTime : Mon Jul 4 22:17:50 EDT 2022
% 0.12/0.31 % CPUTime :
% 0.17/0.33 ----- Otter 3.2, August 2001 -----
% 0.17/0.33 The process was started by sandbox on n028.cluster.edu,
% 0.17/0.33 Mon Jul 4 22:17:50 2022
% 0.17/0.33 The command was "./sos". The process ID is 11339.
% 0.17/0.33
% 0.17/0.33 set(prolog_style_variables).
% 0.17/0.33 set(auto).
% 0.17/0.33 dependent: set(auto1).
% 0.17/0.33 dependent: set(process_input).
% 0.17/0.33 dependent: clear(print_kept).
% 0.17/0.33 dependent: clear(print_new_demod).
% 0.17/0.33 dependent: clear(print_back_demod).
% 0.17/0.33 dependent: clear(print_back_sub).
% 0.17/0.33 dependent: set(control_memory).
% 0.17/0.33 dependent: assign(max_mem, 12000).
% 0.17/0.33 dependent: assign(pick_given_ratio, 4).
% 0.17/0.33 dependent: assign(stats_level, 1).
% 0.17/0.33 dependent: assign(pick_semantic_ratio, 3).
% 0.17/0.33 dependent: assign(sos_limit, 5000).
% 0.17/0.33 dependent: assign(max_weight, 60).
% 0.17/0.33 clear(print_given).
% 0.17/0.33
% 0.17/0.33 list(usable).
% 0.17/0.33
% 0.17/0.33 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.17/0.33
% 0.17/0.33 This is a Horn set without equality. The strategy will
% 0.17/0.33 be hyperresolution, with satellites in sos and nuclei
% 0.17/0.33 in usable.
% 0.17/0.33
% 0.17/0.33 dependent: set(hyper_res).
% 0.17/0.33 dependent: clear(order_hyper).
% 0.17/0.33
% 0.17/0.33 ------------> process usable:
% 0.17/0.33
% 0.17/0.33 ------------> process sos:
% 0.17/0.33
% 0.17/0.33 ======= end of input processing =======
% 0.17/0.35
% 0.17/0.35 Model 1 (0.00 seconds, 0 Inserts)
% 0.17/0.35
% 0.17/0.35 Stopped by limit on number of solutions
% 0.17/0.35
% 0.17/0.35
% 0.17/0.35 -------------- Softie stats --------------
% 0.17/0.35
% 0.17/0.35 UPDATE_STOP: 300
% 0.17/0.35 SFINDER_TIME_LIMIT: 2
% 0.17/0.35 SHORT_CLAUSE_CUTOFF: 4
% 0.17/0.35 number of clauses in intial UL: 2
% 0.17/0.35 number of clauses initially in problem: 5
% 0.17/0.35 percentage of clauses intially in UL: 40
% 0.17/0.35 percentage of distinct symbols occuring in initial UL: 100
% 0.17/0.35 percent of all initial clauses that are short: 100
% 0.17/0.35 absolute distinct symbol count: 4
% 0.17/0.35 distinct predicate count: 1
% 0.17/0.35 distinct function count: 2
% 0.17/0.35 distinct constant count: 1
% 0.17/0.35
% 0.17/0.35 ---------- no more Softie stats ----------
% 0.17/0.35
% 0.17/0.35
% 0.17/0.35
% 0.17/0.35 =========== start of search ===========
% 0.69/0.88
% 0.69/0.88 -------- PROOF --------
% 0.69/0.88 % SZS status Unsatisfiable
% 0.69/0.88 % SZS output start Refutation
% 0.69/0.88
% 0.69/0.88 Model 2 (0.00 seconds, 0 Inserts)
% 0.69/0.88
% 0.69/0.88 Stopped by limit on number of solutions
% 0.69/0.88
% 0.69/0.88 Model 3 (0.00 seconds, 0 Inserts)
% 0.69/0.88
% 0.69/0.88 Stopped by limit on number of solutions
% 0.69/0.88
% 0.69/0.88 Model 4 [ 1 1 175 ] (0.00 seconds, 54317 Inserts)
% 0.69/0.88
% 0.69/0.88 Model 5 [ 1 0 25 ] (0.00 seconds, 38006 Inserts)
% 0.69/0.88
% 0.69/0.88 ----> UNIT CONFLICT at 0.52 sec ----> 1987 [binary,1986.1,2.1] {-} $F.
% 0.69/0.88
% 0.69/0.88 Length of proof is 31. Level of proof is 18.
% 0.69/0.88
% 0.69/0.88 ---------------- PROOF ----------------
% 0.69/0.88 % SZS status Unsatisfiable
% 0.69/0.88 % SZS output start Refutation
% 0.69/0.88
% 0.69/0.88 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 0.69/0.88 2 [] {+} -is_a_theorem(implies(implies(x,not(x)),not(x))).
% 0.69/0.88 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 0.69/0.88 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 0.69/0.88 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 0.69/0.88 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 0.69/0.88 7 [hyper,4,1,3] {+} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 0.69/0.88 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 0.69/0.88 15 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 0.69/0.88 18 [hyper,6,1,6] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 0.69/0.88 21 [hyper,6,1,9] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 0.69/0.88 24 [hyper,21,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 0.69/0.88 26 [hyper,21,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).
% 0.69/0.88 55 [hyper,24,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 0.69/0.88 71 [hyper,55,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 0.69/0.88 85 [hyper,71,1,15] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 0.69/0.88 111 [hyper,85,1,4] {+} is_a_theorem(implies(A,implies(B,B))).
% 0.69/0.88 162 [hyper,111,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 0.69/0.88 198 [hyper,162,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(D,D),B),C))).
% 0.69/0.88 203 [hyper,162,1,7] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 0.69/0.88 437 [hyper,203,1,18] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 0.69/0.88 931 [hyper,437,1,437] {-} is_a_theorem(implies(A,implies(implies(B,implies(not(C),C)),implies(B,C)))).
% 0.69/0.88 937 [hyper,437,1,55] {+} is_a_theorem(implies(A,implies(B,implies(C,A)))).
% 0.69/0.88 939 [hyper,437,1,26] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))).
% 0.69/0.88 971 [hyper,939,1,437] {-} is_a_theorem(implies(A,implies(implies(not(B),not(C)),implies(C,B)))).
% 0.69/0.88 991 [hyper,937,1,437] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 0.69/0.88 1097 [hyper,991,1,991] {+} is_a_theorem(implies(A,implies(B,A))).
% 0.69/0.88 1124 [hyper,971,1,971] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 0.69/0.88 1137 [hyper,1124,1,437] {-} is_a_theorem(implies(A,implies(implies(not(B),not(not(B))),B))).
% 0.69/0.88 1166 [hyper,1137,1,1137] {-} is_a_theorem(implies(implies(not(A),not(not(A))),A)).
% 0.69/0.88 1182 [hyper,1166,1,198] {+} is_a_theorem(implies(implies(implies(A,A),not(not(B))),B)).
% 0.69/0.88 1213 [hyper,1097,1,3] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 0.69/0.88 1474 [hyper,931,1,931] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))).
% 0.69/0.88 1505 [hyper,1474,1,6] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(B,A),A))).
% 0.69/0.88 1893 [hyper,1213,1,1182] {+} is_a_theorem(implies(not(not(A)),A)).
% 0.69/0.88 1986 [hyper,1893,1,1505] {-} is_a_theorem(implies(implies(A,not(A)),not(A))).
% 0.69/0.88 1987 [binary,1986.1,2.1] {-} $F.
% 0.69/0.88
% 0.69/0.88 % SZS output end Refutation
% 0.69/0.88 ------------ end of proof -------------
% 0.69/0.88
% 0.69/0.88
% 0.69/0.88 Search stopped by max_proofs option.
% 0.69/0.88
% 0.69/0.88
% 0.69/0.88 Search stopped by max_proofs option.
% 0.69/0.88
% 0.69/0.88 ============ end of search ============
% 0.69/0.88
% 0.69/0.88 ----------- soft-scott stats ----------
% 0.69/0.88
% 0.69/0.88 true clauses given 31 (26.5%)
% 0.69/0.88 false clauses given 86
% 0.69/0.88
% 0.69/0.88 FALSE TRUE
% 0.69/0.88 7 0 1
% 0.69/0.88 8 0 1
% 0.69/0.88 9 0 3
% 0.69/0.88 10 0 5
% 0.69/0.88 11 2 21
% 0.69/0.88 12 0 41
% 0.69/0.88 13 23 44
% 0.69/0.88 14 19 84
% 0.69/0.88 15 72 77
% 0.69/0.88 16 26 118
% 0.69/0.88 17 76 99
% 0.69/0.88 18 27 127
% 0.69/0.88 19 68 91
% 0.69/0.88 20 41 94
% 0.69/0.88 21 63 43
% 0.69/0.88 22 39 62
% 0.69/0.88 23 38 32
% 0.69/0.88 24 19 34
% 0.69/0.88 25 40 15
% 0.69/0.88 26 8 23
% 0.69/0.88 27 24 3
% 0.69/0.88 28 9 22
% 0.69/0.88 29 23 1
% 0.69/0.88 30 3 19
% 0.69/0.88 31 41 0
% 0.69/0.88 32 1 13
% 0.69/0.88 33 13 2
% 0.69/0.88 34 0 27
% 0.69/0.88 35 9 0
% 0.69/0.88 36 2 12
% 0.69/0.88 37 9 0
% 0.69/0.88 38 1 5
% 0.69/0.88 39 5 0
% 0.69/0.88 40 0 6
% 0.69/0.88 42 0 4
% 0.69/0.88 43 2 0
% 0.69/0.88 45 1 0
% 0.69/0.88 46 0 2
% 0.69/0.88 48 0 1
% 0.69/0.88 53 2 0
% 0.69/0.88 56 2 0
% 0.69/0.88 59 2 0
% 0.69/0.88 tot: 710 1132 (61.5% true)
% 0.69/0.88
% 0.69/0.88
% 0.69/0.88 Model 5 [ 1 0 25 ] (0.00 seconds, 38006 Inserts)
% 0.69/0.88
% 0.69/0.88 That finishes the proof of the theorem.
% 0.69/0.88
% 0.69/0.88 Process 11339 finished Mon Jul 4 22:17:50 2022
%------------------------------------------------------------------------------