TSTP Solution File: LCL034-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL034-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n016.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:27:29 EDT 2022
% Result : Unsatisfiable 1.35s 1.56s
% Output : Refutation 1.35s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL034-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 3 23:01:46 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.35 ----- Otter 3.2, August 2001 -----
% 0.19/0.35 The process was started by sandbox on n016.cluster.edu,
% 0.19/0.35 Sun Jul 3 23:01:46 2022
% 0.19/0.35 The command was "./sos". The process ID is 9579.
% 0.19/0.35
% 0.19/0.35 set(prolog_style_variables).
% 0.19/0.35 set(auto).
% 0.19/0.35 dependent: set(auto1).
% 0.19/0.35 dependent: set(process_input).
% 0.19/0.35 dependent: clear(print_kept).
% 0.19/0.35 dependent: clear(print_new_demod).
% 0.19/0.35 dependent: clear(print_back_demod).
% 0.19/0.35 dependent: clear(print_back_sub).
% 0.19/0.35 dependent: set(control_memory).
% 0.19/0.35 dependent: assign(max_mem, 12000).
% 0.19/0.35 dependent: assign(pick_given_ratio, 4).
% 0.19/0.35 dependent: assign(stats_level, 1).
% 0.19/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.35 dependent: assign(sos_limit, 5000).
% 0.19/0.35 dependent: assign(max_weight, 60).
% 0.19/0.35 clear(print_given).
% 0.19/0.35
% 0.19/0.35 list(usable).
% 0.19/0.35
% 0.19/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.19/0.35
% 0.19/0.35 This is a Horn set without equality. The strategy will
% 0.19/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.19/0.35 in usable.
% 0.19/0.35
% 0.19/0.35 dependent: set(hyper_res).
% 0.19/0.35 dependent: clear(order_hyper).
% 0.19/0.35
% 0.19/0.35 ------------> process usable:
% 0.19/0.35
% 0.19/0.35 ------------> process sos:
% 0.19/0.35
% 0.19/0.35 ======= end of input processing =======
% 0.19/0.38
% 0.19/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.38
% 0.19/0.38 Stopped by limit on number of solutions
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 -------------- Softie stats --------------
% 0.19/0.38
% 0.19/0.38 UPDATE_STOP: 300
% 0.19/0.38 SFINDER_TIME_LIMIT: 2
% 0.19/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.38 number of clauses in intial UL: 2
% 0.19/0.38 number of clauses initially in problem: 3
% 0.19/0.38 percentage of clauses intially in UL: 66
% 0.19/0.38 percentage of distinct symbols occuring in initial UL: 80
% 0.19/0.38 percent of all initial clauses that are short: 100
% 0.19/0.38 absolute distinct symbol count: 5
% 0.19/0.38 distinct predicate count: 1
% 0.19/0.38 distinct function count: 1
% 0.19/0.38 distinct constant count: 3
% 0.19/0.38
% 0.19/0.38 ---------- no more Softie stats ----------
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 =========== start of search ===========
% 1.35/1.56
% 1.35/1.56 -------- PROOF --------
% 1.35/1.56 % SZS status Unsatisfiable
% 1.35/1.56 % SZS output start Refutation
% 1.35/1.56
% 1.35/1.56 Model 2 (0.00 seconds, 0 Inserts)
% 1.35/1.56
% 1.35/1.56 Stopped by limit on number of solutions
% 1.35/1.56
% 1.35/1.56 Model 3 (0.00 seconds, 0 Inserts)
% 1.35/1.56
% 1.35/1.56 Stopped by limit on number of solutions
% 1.35/1.56
% 1.35/1.56 Model 4 (0.00 seconds, 0 Inserts)
% 1.35/1.56
% 1.35/1.56 Stopped by limit on number of solutions
% 1.35/1.56
% 1.35/1.56 Model 5 (0.00 seconds, 0 Inserts)
% 1.35/1.56
% 1.35/1.56 Stopped by limit on number of solutions
% 1.35/1.56
% 1.35/1.56 Model 6 (0.00 seconds, 0 Inserts)
% 1.35/1.56
% 1.35/1.56 Stopped by limit on number of solutions
% 1.35/1.56
% 1.35/1.56 Model 7 (0.00 seconds, 0 Inserts)
% 1.35/1.56
% 1.35/1.56 Stopped by limit on number of solutions
% 1.35/1.56
% 1.35/1.56 ----> UNIT CONFLICT at 1.17 sec ----> 1335 [binary,1334.1,2.1] {-} $F.
% 1.35/1.56
% 1.35/1.56 Length of proof is 28. Level of proof is 22.
% 1.35/1.56
% 1.35/1.56 ---------------- PROOF ----------------
% 1.35/1.56 % SZS status Unsatisfiable
% 1.35/1.56 % SZS output start Refutation
% 1.35/1.56
% 1.35/1.56 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.35/1.56 2 [] {+} -is_a_theorem(implies(implies(implies(a,b),a),a)).
% 1.35/1.56 3 [] {-} is_a_theorem(implies(implies(implies(implies(implies(A,B),implies(C,falsehood)),D),E),implies(implies(E,A),implies(C,A)))).
% 1.35/1.56 4 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),implies(B,D)),implies(E,implies(B,D)))).
% 1.35/1.56 6 [hyper,4,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(falsehood,B)),C),implies(D,C))).
% 1.35/1.56 14 [hyper,6,1,6] {-} is_a_theorem(implies(A,implies(B,implies(falsehood,C)))).
% 1.35/1.56 23 [hyper,14,1,14] {+} is_a_theorem(implies(A,implies(falsehood,B))).
% 1.35/1.56 26 [hyper,23,1,3] {+} is_a_theorem(implies(implies(implies(falsehood,A),B),implies(C,B))).
% 1.35/1.56 32 [hyper,26,1,4] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 1.35/1.56 33 [hyper,32,1,32] {+} is_a_theorem(implies(A,implies(B,A))).
% 1.35/1.56 39 [hyper,33,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(implies(implies(B,C),implies(D,falsehood)),E)),B),implies(D,B))).
% 1.35/1.56 89 [hyper,39,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(B,D),implies(A,falsehood)),C))).
% 1.35/1.56 139 [hyper,89,1,33] {-} is_a_theorem(implies(implies(implies(A,B),implies(C,falsehood)),implies(D,implies(C,A)))).
% 1.35/1.56 140 [hyper,89,1,26] {-} is_a_theorem(implies(implies(implies(A,B),implies(implies(falsehood,C),falsehood)),implies(D,A))).
% 1.35/1.56 151 [hyper,140,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),B),implies(D,B))).
% 1.35/1.56 159 [hyper,151,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 1.35/1.56 165 [hyper,159,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,falsehood),B),C),implies(A,C))).
% 1.35/1.56 207 [hyper,165,1,165] {-} is_a_theorem(implies(implies(A,falsehood),implies(A,B))).
% 1.35/1.56 213 [hyper,165,1,3] {-} is_a_theorem(implies(implies(implies(A,B),A),implies(C,A))).
% 1.35/1.56 218 [hyper,207,1,165] {-} is_a_theorem(implies(A,implies(implies(A,falsehood),B))).
% 1.35/1.56 219 [hyper,207,1,139] {+} is_a_theorem(implies(A,implies(B,B))).
% 1.35/1.56 225 [hyper,219,1,219] {+} is_a_theorem(implies(A,A)).
% 1.35/1.56 228 [hyper,219,1,3] {+} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 1.35/1.56 231 [hyper,218,1,165] {-} is_a_theorem(implies(A,implies(implies(implies(implies(A,falsehood),B),falsehood),C))).
% 1.35/1.56 360 [hyper,225,1,89] {-} is_a_theorem(implies(implies(implies(A,B),implies(C,falsehood)),implies(C,A))).
% 1.35/1.56 1046 [hyper,360,1,231] {-} is_a_theorem(implies(implies(implies(implies(implies(A,B),falsehood),C),falsehood),A)).
% 1.35/1.56 1251 [hyper,1046,1,3] {-} is_a_theorem(implies(implies(A,implies(A,B)),implies(C,implies(A,B)))).
% 1.35/1.56 1281 [hyper,1251,1,228] {-} is_a_theorem(implies(A,implies(implies(implies(B,B),C),C))).
% 1.35/1.56 1282 [hyper,1251,1,213] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))).
% 1.35/1.56 1297 [hyper,1281,1,1281] {+} is_a_theorem(implies(implies(implies(A,A),B),B)).
% 1.35/1.56 1334 [hyper,1282,1,1297] {-} is_a_theorem(implies(implies(implies(A,B),A),A)).
% 1.35/1.56 1335 [binary,1334.1,2.1] {-} $F.
% 1.35/1.56
% 1.35/1.56 % SZS output end Refutation
% 1.35/1.56 ------------ end of proof -------------
% 1.35/1.56
% 1.35/1.56
% 1.35/1.56 Search stopped by max_proofs option.
% 1.35/1.56
% 1.35/1.56
% 1.35/1.56 Search stopped by max_proofs option.
% 1.35/1.56
% 1.35/1.56 ============ end of search ============
% 1.35/1.56
% 1.35/1.56 ----------- soft-scott stats ----------
% 1.35/1.56
% 1.35/1.56 true clauses given 32 (25.0%)
% 1.35/1.56 false clauses given 96
% 1.35/1.56
% 1.35/1.56 FALSE TRUE
% 1.35/1.56 10 0 1
% 1.35/1.56 12 2 17
% 1.35/1.56 14 15 84
% 1.35/1.56 16 24 152
% 1.35/1.56 18 28 241
% 1.35/1.56 20 12 245
% 1.35/1.56 22 14 93
% 1.35/1.56 24 11 82
% 1.35/1.56 26 4 60
% 1.35/1.56 28 2 25
% 1.35/1.56 30 0 5
% 1.35/1.56 32 0 1
% 1.35/1.56 34 1 0
% 1.35/1.56 36 2 1
% 1.35/1.56 38 2 2
% 1.35/1.56 40 0 5
% 1.35/1.56 56 0 1
% 1.35/1.56 tot: 117 1015 (89.7% true)
% 1.35/1.56
% 1.35/1.56
% 1.35/1.56 Model 7 (0.00 seconds, 0 Inserts)
% 1.35/1.56
% 1.35/1.56 That finishes the proof of the theorem.
% 1.35/1.56
% 1.35/1.56 Process 9579 finished Sun Jul 3 23:01:47 2022
%------------------------------------------------------------------------------