TSTP Solution File: LCL384-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL384-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n018.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:50 EDT 2022
% Result : Unsatisfiable 5.70s 5.93s
% Output : Refutation 5.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL384-1 : TPTP v8.1.0. Released v2.3.0.
% 0.06/0.13 % Command : sos-script %s
% 0.14/0.33 % Computer : n018.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Sun Jul 3 12:35:50 EDT 2022
% 0.14/0.33 % CPUTime :
% 0.14/0.35 ----- Otter 3.2, August 2001 -----
% 0.14/0.35 The process was started by sandbox on n018.cluster.edu,
% 0.14/0.35 Sun Jul 3 12:35:50 2022
% 0.14/0.35 The command was "./sos". The process ID is 786.
% 0.14/0.35
% 0.14/0.35 set(prolog_style_variables).
% 0.14/0.35 set(auto).
% 0.14/0.35 dependent: set(auto1).
% 0.14/0.35 dependent: set(process_input).
% 0.14/0.35 dependent: clear(print_kept).
% 0.14/0.35 dependent: clear(print_new_demod).
% 0.14/0.35 dependent: clear(print_back_demod).
% 0.14/0.35 dependent: clear(print_back_sub).
% 0.14/0.35 dependent: set(control_memory).
% 0.14/0.35 dependent: assign(max_mem, 12000).
% 0.14/0.35 dependent: assign(pick_given_ratio, 4).
% 0.14/0.35 dependent: assign(stats_level, 1).
% 0.14/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.35 dependent: assign(sos_limit, 5000).
% 0.14/0.35 dependent: assign(max_weight, 60).
% 0.14/0.35 clear(print_given).
% 0.14/0.35
% 0.14/0.35 list(usable).
% 0.14/0.35
% 0.14/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.14/0.35
% 0.14/0.35 This is a Horn set without equality. The strategy will
% 0.14/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.14/0.35 in usable.
% 0.14/0.35
% 0.14/0.35 dependent: set(hyper_res).
% 0.14/0.35 dependent: clear(order_hyper).
% 0.14/0.35
% 0.14/0.35 ------------> process usable:
% 0.14/0.35
% 0.14/0.35 ------------> process sos:
% 0.14/0.35
% 0.14/0.35 ======= end of input processing =======
% 0.14/0.38
% 0.14/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.38
% 0.14/0.38 Stopped by limit on number of solutions
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 -------------- Softie stats --------------
% 0.14/0.38
% 0.14/0.38 UPDATE_STOP: 300
% 0.14/0.38 SFINDER_TIME_LIMIT: 2
% 0.14/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.38 number of clauses in intial UL: 2
% 0.14/0.38 number of clauses initially in problem: 5
% 0.14/0.38 percentage of clauses intially in UL: 40
% 0.14/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.14/0.38 percent of all initial clauses that are short: 100
% 0.14/0.38 absolute distinct symbol count: 6
% 0.14/0.38 distinct predicate count: 1
% 0.14/0.38 distinct function count: 2
% 0.14/0.38 distinct constant count: 3
% 0.14/0.38
% 0.14/0.38 ---------- no more Softie stats ----------
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 =========== start of search ===========
% 5.70/5.93
% 5.70/5.93 -------- PROOF --------
% 5.70/5.93 % SZS status Unsatisfiable
% 5.70/5.93 % SZS output start Refutation
% 5.70/5.93
% 5.70/5.93 Model 2 (0.00 seconds, 0 Inserts)
% 5.70/5.93
% 5.70/5.93 Stopped by limit on number of solutions
% 5.70/5.93
% 5.70/5.93 Model 3 (0.00 seconds, 0 Inserts)
% 5.70/5.93
% 5.70/5.93 Stopped by limit on number of solutions
% 5.70/5.93
% 5.70/5.93 Model 4 (0.00 seconds, 0 Inserts)
% 5.70/5.93
% 5.70/5.93 Stopped by limit on number of solutions
% 5.70/5.93
% 5.70/5.93 Stopped by limit on insertions
% 5.70/5.93
% 5.70/5.93 Model 5 [ 1 1 29 ] (0.00 seconds, 250000 Inserts)
% 5.70/5.93
% 5.70/5.93 Stopped by limit on insertions
% 5.70/5.93
% 5.70/5.93 Model 6 [ 1 0 352 ] (0.00 seconds, 250000 Inserts)
% 5.70/5.93
% 5.70/5.93 ----> UNIT CONFLICT at 5.55 sec ----> 1462 [binary,1461.1,2.1] {-} $F.
% 5.70/5.93
% 5.70/5.93 Length of proof is 18. Level of proof is 14.
% 5.70/5.93
% 5.70/5.93 ---------------- PROOF ----------------
% 5.70/5.93 % SZS status Unsatisfiable
% 5.70/5.93 % SZS output start Refutation
% 5.70/5.93
% 5.70/5.93 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 5.70/5.93 2 [] {+} -is_a_theorem(implies(implies(x,implies(y,z)),implies(implies(not(z),y),implies(x,z)))).
% 5.70/5.93 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 5.70/5.93 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 5.70/5.93 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 5.70/5.93 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 5.70/5.93 7 [hyper,4,1,3] {+} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 5.70/5.93 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 5.70/5.93 15 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 5.70/5.93 18 [hyper,6,1,6] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 5.70/5.93 21 [hyper,6,1,9] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 5.70/5.93 24 [hyper,21,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 5.70/5.93 55 [hyper,24,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 5.70/5.93 71 [hyper,55,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 5.70/5.93 85 [hyper,71,1,15] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 5.70/5.93 111 [hyper,85,1,4] {+} is_a_theorem(implies(A,implies(B,B))).
% 5.70/5.93 162 [hyper,111,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 5.70/5.93 203 [hyper,162,1,7] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 5.70/5.93 437 [hyper,203,1,18] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 5.70/5.93 929 [hyper,437,1,437] {-} is_a_theorem(implies(A,implies(implies(B,implies(not(C),C)),implies(B,C)))).
% 5.70/5.93 1371 [hyper,929,1,929] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))).
% 5.70/5.93 1418 [hyper,1371,1,6] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(B,A),A))).
% 5.70/5.93 1461 [hyper,1418,1,18] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(not(C),B),implies(A,C)))).
% 5.70/5.93 1462 [binary,1461.1,2.1] {-} $F.
% 5.70/5.93
% 5.70/5.93 % SZS output end Refutation
% 5.70/5.93 ------------ end of proof -------------
% 5.70/5.93
% 5.70/5.93
% 5.70/5.93 Search stopped by max_proofs option.
% 5.70/5.93
% 5.70/5.93
% 5.70/5.93 Search stopped by max_proofs option.
% 5.70/5.93
% 5.70/5.93 ============ end of search ============
% 5.70/5.93
% 5.70/5.93 ----------- soft-scott stats ----------
% 5.70/5.93
% 5.70/5.93 true clauses given 27 (27.0%)
% 5.70/5.93 false clauses given 73
% 5.70/5.93
% 5.70/5.93 FALSE TRUE
% 5.70/5.93 10 0 3
% 5.70/5.93 11 1 17
% 5.70/5.93 12 1 27
% 5.70/5.93 13 11 37
% 5.70/5.93 14 18 48
% 5.70/5.93 15 38 63
% 5.70/5.93 16 34 72
% 5.70/5.93 17 47 82
% 5.70/5.93 18 31 79
% 5.70/5.93 19 47 69
% 5.70/5.93 20 31 61
% 5.70/5.93 21 38 42
% 5.70/5.93 22 24 43
% 5.70/5.93 23 17 35
% 5.70/5.93 24 12 29
% 5.70/5.93 25 20 24
% 5.70/5.93 26 5 18
% 5.70/5.93 27 15 6
% 5.70/5.93 28 7 16
% 5.70/5.93 29 15 6
% 5.70/5.93 30 6 7
% 5.70/5.93 31 19 10
% 5.70/5.93 32 5 7
% 5.70/5.93 33 4 9
% 5.70/5.93 34 8 12
% 5.70/5.93 35 1 4
% 5.70/5.93 36 1 9
% 5.70/5.93 37 4 5
% 5.70/5.93 38 0 4
% 5.70/5.93 39 2 2
% 5.70/5.93 40 1 5
% 5.70/5.93 42 0 3
% 5.70/5.93 43 0 1
% 5.70/5.93 45 0 1
% 5.70/5.93 46 0 1
% 5.70/5.93 48 0 1
% 5.70/5.93 tot: 463 858 (65.0% true)
% 5.70/5.93
% 5.70/5.93
% 5.70/5.93 Model 6 [ 1 0 352 ] (0.00 seconds, 250000 Inserts)
% 5.70/5.93
% 5.70/5.93 That finishes the proof of the theorem.
% 5.70/5.93
% 5.70/5.93 Process 786 finished Sun Jul 3 12:35:55 2022
%------------------------------------------------------------------------------