TSTP Solution File: LCL366-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL366-1 : TPTP v8.1.0. Bugfixed v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n029.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:43 EDT 2022
% Result : Unsatisfiable 2.10s 2.29s
% Output : Refutation 2.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL366-1 : TPTP v8.1.0. Bugfixed v5.5.0.
% 0.11/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 3 12:19:10 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox2 on n029.cluster.edu,
% 0.12/0.36 Sun Jul 3 12:19:10 2022
% 0.12/0.36 The command was "./sos". The process ID is 31434.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.12/0.36
% 0.12/0.36 This is a Horn set without equality. The strategy will
% 0.12/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.36 in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: clear(order_hyper).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36
% 0.12/0.36 ======= 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: 5
% 0.19/0.38 percentage of clauses intially in UL: 40
% 0.19/0.38 percentage of distinct symbols occuring in initial UL: 100
% 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: 2
% 0.19/0.38 distinct constant count: 2
% 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 ===========
% 2.10/2.29
% 2.10/2.29 -------- PROOF --------
% 2.10/2.29 % SZS status Unsatisfiable
% 2.10/2.29 % SZS output start Refutation
% 2.10/2.29
% 2.10/2.29 Model 2 (0.00 seconds, 0 Inserts)
% 2.10/2.29
% 2.10/2.29 Stopped by limit on number of solutions
% 2.10/2.29
% 2.10/2.29 Model 3 (0.00 seconds, 0 Inserts)
% 2.10/2.29
% 2.10/2.29 Stopped by limit on number of solutions
% 2.10/2.29
% 2.10/2.29 Model 4 (0.00 seconds, 0 Inserts)
% 2.10/2.29
% 2.10/2.29 Stopped by limit on number of solutions
% 2.10/2.29
% 2.10/2.29 Model 5 [ 1 0 295 ] (0.00 seconds, 208386 Inserts)
% 2.10/2.29
% 2.10/2.29 ----> UNIT CONFLICT at 1.91 sec ----> 1180 [binary,1179.1,2.1] {-} $F.
% 2.10/2.29
% 2.10/2.29 Length of proof is 16. Level of proof is 11.
% 2.10/2.29
% 2.10/2.29 ---------------- PROOF ----------------
% 2.10/2.29 % SZS status Unsatisfiable
% 2.10/2.29 % SZS output start Refutation
% 2.10/2.29
% 2.10/2.29 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 2.10/2.29 2 [] {+} -is_a_theorem(implies(implies(not(x),y),implies(implies(y,x),x))).
% 2.10/2.29 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 2.10/2.29 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 2.10/2.29 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 2.10/2.29 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 2.10/2.29 7 [hyper,4,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 2.10/2.29 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 2.10/2.29 12 [hyper,7,1,7] {+} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(not(A),A),B))).
% 2.10/2.29 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))).
% 2.10/2.29 29 [hyper,9,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 2.10/2.29 34 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 2.10/2.29 40 [hyper,29,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 2.10/2.29 60 [hyper,40,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 2.10/2.29 78 [hyper,60,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 2.10/2.29 91 [hyper,78,1,34] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 2.10/2.29 184 [hyper,12,1,91] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 2.10/2.29 280 [hyper,184,1,3] {-} is_a_theorem(implies(implies(implies(implies(not(A),A),A),B),implies(C,B))).
% 2.10/2.29 319 [hyper,280,1,6] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 2.10/2.29 810 [hyper,319,1,319] {-} is_a_theorem(implies(A,implies(implies(B,implies(not(C),C)),implies(B,C)))).
% 2.10/2.29 1179 [hyper,810,1,21] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(B,A),A))).
% 2.10/2.29 1180 [binary,1179.1,2.1] {-} $F.
% 2.10/2.29
% 2.10/2.29 % SZS output end Refutation
% 2.10/2.29 ------------ end of proof -------------
% 2.10/2.29
% 2.10/2.29
% 2.10/2.29 Search stopped by max_proofs option.
% 2.10/2.29
% 2.10/2.29
% 2.10/2.29 Search stopped by max_proofs option.
% 2.10/2.29
% 2.10/2.29 ============ end of search ============
% 2.10/2.29
% 2.10/2.29 ----------- soft-scott stats ----------
% 2.10/2.29
% 2.10/2.29 true clauses given 26 (31.3%)
% 2.10/2.29 false clauses given 57
% 2.10/2.29
% 2.10/2.29 FALSE TRUE
% 2.10/2.29 6 0 1
% 2.10/2.29 9 0 1
% 2.10/2.29 10 0 3
% 2.10/2.29 11 0 13
% 2.10/2.29 12 0 24
% 2.10/2.29 13 5 29
% 2.10/2.29 14 6 48
% 2.10/2.29 15 23 56
% 2.10/2.29 16 12 82
% 2.10/2.29 17 25 85
% 2.10/2.29 18 9 86
% 2.10/2.29 19 17 77
% 2.10/2.29 20 13 65
% 2.10/2.29 21 23 34
% 2.10/2.29 22 8 46
% 2.10/2.29 23 18 26
% 2.10/2.29 24 17 22
% 2.10/2.29 25 17 13
% 2.10/2.29 26 8 13
% 2.10/2.29 27 9 7
% 2.10/2.29 28 10 13
% 2.10/2.29 29 8 5
% 2.10/2.29 30 4 10
% 2.10/2.29 31 12 2
% 2.10/2.29 32 2 7
% 2.10/2.29 33 3 1
% 2.10/2.29 34 0 21
% 2.10/2.29 36 0 12
% 2.10/2.29 37 1 1
% 2.10/2.29 38 0 4
% 2.10/2.29 39 1 1
% 2.10/2.29 40 1 4
% 2.10/2.29 42 0 2
% 2.10/2.29 46 0 1
% 2.10/2.29 48 0 1
% 2.10/2.29 49 1 0
% 2.10/2.29 51 1 0
% 2.10/2.29 52 1 0
% 2.10/2.29 tot: 255 816 (76.2% true)
% 2.10/2.29
% 2.10/2.29
% 2.10/2.29 Model 5 [ 1 0 295 ] (0.00 seconds, 208386 Inserts)
% 2.10/2.29
% 2.10/2.29 That finishes the proof of the theorem.
% 2.10/2.29
% 2.10/2.29 Process 31434 finished Sun Jul 3 12:19:12 2022
%------------------------------------------------------------------------------