TSTP Solution File: LCL053-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL053-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n007.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:36 EDT 2022
% Result : Unsatisfiable 6.90s 7.09s
% Output : Refutation 6.90s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : LCL053-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.14 % Command : sos-script %s
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jul 2 11:16:25 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox on n007.cluster.edu,
% 0.13/0.37 Sat Jul 2 11:16:25 2022
% 0.13/0.37 The command was "./sos". The process ID is 26402.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.37
% 0.13/0.37 This is a Horn set without equality. The strategy will
% 0.13/0.37 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.37 in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: clear(order_hyper).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.13/0.39
% 0.13/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 -------------- Softie stats --------------
% 0.13/0.39
% 0.13/0.39 UPDATE_STOP: 300
% 0.13/0.39 SFINDER_TIME_LIMIT: 2
% 0.13/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.39 number of clauses in intial UL: 2
% 0.13/0.39 number of clauses initially in problem: 5
% 0.13/0.39 percentage of clauses intially in UL: 40
% 0.13/0.39 percentage of distinct symbols occuring in initial UL: 80
% 0.13/0.39 percent of all initial clauses that are short: 100
% 0.13/0.39 absolute distinct symbol count: 5
% 0.13/0.39 distinct predicate count: 1
% 0.13/0.39 distinct function count: 2
% 0.13/0.39 distinct constant count: 2
% 0.13/0.39
% 0.13/0.39 ---------- no more Softie stats ----------
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 =========== start of search ===========
% 6.90/7.09
% 6.90/7.09 -------- PROOF --------
% 6.90/7.09 % SZS status Unsatisfiable
% 6.90/7.09 % SZS output start Refutation
% 6.90/7.09
% 6.90/7.09 Model 2 (0.00 seconds, 0 Inserts)
% 6.90/7.09
% 6.90/7.09 Stopped by limit on number of solutions
% 6.90/7.09
% 6.90/7.09 Stopped by limit on insertions
% 6.90/7.09
% 6.90/7.09 Model 3 [ 1 0 75 ] (0.00 seconds, 212691 Inserts)
% 6.90/7.09
% 6.90/7.09 Stopped by limit on insertions
% 6.90/7.09
% 6.90/7.09 Model 4 [ 5 0 72 ] (0.00 seconds, 250000 Inserts)
% 6.90/7.09
% 6.90/7.09 Model 5 [ 1 0 118 ] (0.00 seconds, 201824 Inserts)
% 6.90/7.09
% 6.90/7.09 Stopped by limit on insertions
% 6.90/7.09
% 6.90/7.09 Stopped by limit on insertions
% 6.90/7.09
% 6.90/7.09 Model 6 [ 1 87 225551 ] (0.00 seconds, 226966 Inserts)
% 6.90/7.09
% 6.90/7.09 Model 7 [ 1 1 520 ] (0.00 seconds, 178844 Inserts)
% 6.90/7.09
% 6.90/7.09 Model 8 [ 16 1 909 ] (0.00 seconds, 126407 Inserts)
% 6.90/7.09
% 6.90/7.09 ----> UNIT CONFLICT at 6.68 sec ----> 3155 [binary,3154.1,2.1] {+} $F.
% 6.90/7.09
% 6.90/7.09 Length of proof is 30. Level of proof is 18.
% 6.90/7.09
% 6.90/7.09 ---------------- PROOF ----------------
% 6.90/7.09 % SZS status Unsatisfiable
% 6.90/7.09 % SZS output start Refutation
% 6.90/7.09
% 6.90/7.09 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 6.90/7.09 2 [] {+} -is_a_theorem(implies(implies(a,implies(a,b)),implies(a,b))).
% 6.90/7.09 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 6.90/7.09 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 6.90/7.09 5 [] {-} is_a_theorem(implies(A,implies(not(A),B))).
% 6.90/7.09 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 6.90/7.09 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 6.90/7.09 16 [hyper,6,1,6] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 6.90/7.09 21 [hyper,9,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 6.90/7.09 25 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 6.90/7.09 38 [hyper,25,1,5] {+} is_a_theorem(implies(not(implies(A,A)),B)).
% 6.90/7.09 57 [hyper,21,1,9] {-} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 6.90/7.09 61 [hyper,21,1,38] {+} is_a_theorem(implies(A,implies(not(implies(B,B)),C))).
% 6.90/7.09 70 [hyper,57,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 6.90/7.09 110 [hyper,61,1,3] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 6.90/7.09 263 [hyper,110,1,4] {+} is_a_theorem(implies(A,implies(B,B))).
% 6.90/7.09 270 [hyper,263,1,16] {+} is_a_theorem(implies(implies(A,B),implies(C,implies(A,B)))).
% 6.90/7.09 300 [hyper,270,1,5] {+} is_a_theorem(implies(A,implies(B,implies(not(B),C)))).
% 6.90/7.09 301 [hyper,270,1,4] {-} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 6.90/7.09 323 [hyper,301,1,16] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 6.90/7.09 457 [hyper,323,1,323] {-} is_a_theorem(implies(A,implies(implies(B,implies(not(C),C)),implies(B,C)))).
% 6.90/7.09 460 [hyper,323,1,70] {+} is_a_theorem(implies(A,implies(B,implies(C,A)))).
% 6.90/7.09 477 [hyper,323,1,9] {-} is_a_theorem(implies(A,implies(implies(implies(not(not(B)),C),B),B))).
% 6.90/7.09 479 [hyper,460,1,323] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 6.90/7.09 607 [hyper,479,1,479] {+} is_a_theorem(implies(A,implies(B,A))).
% 6.90/7.09 638 [hyper,477,1,477] {-} is_a_theorem(implies(implies(implies(not(not(A)),B),A),A)).
% 6.90/7.09 660 [hyper,607,1,3] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 6.90/7.09 758 [hyper,457,1,638] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))).
% 6.90/7.09 792 [hyper,758,1,6] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(B,A),A))).
% 6.90/7.09 839 [hyper,792,1,300] {-} is_a_theorem(implies(implies(implies(A,implies(not(A),B)),C),C)).
% 6.90/7.09 1628 [hyper,660,1,792] {-} is_a_theorem(implies(A,implies(implies(A,B),B))).
% 6.90/7.09 1662 [hyper,1628,1,16] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 6.90/7.09 2981 [hyper,1662,1,839] {+} is_a_theorem(implies(not(A),implies(A,B))).
% 6.90/7.09 3080 [hyper,2981,1,792] {+} is_a_theorem(implies(implies(implies(A,B),A),A)).
% 6.90/7.09 3154 [hyper,3080,1,6] {-} is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))).
% 6.90/7.09 3155 [binary,3154.1,2.1] {+} $F.
% 6.90/7.09
% 6.90/7.09 % SZS output end Refutation
% 6.90/7.09 ------------ end of proof -------------
% 6.90/7.09
% 6.90/7.09
% 6.90/7.09 Search stopped by max_proofs option.
% 6.90/7.09
% 6.90/7.09
% 6.90/7.09 Search stopped by max_proofs option.
% 6.90/7.09
% 6.90/7.09 ============ end of search ============
% 6.90/7.09
% 6.90/7.09 ----------- soft-scott stats ----------
% 6.90/7.09
% 6.90/7.09 true clauses given 39 (29.1%)
% 6.90/7.09 false clauses given 95
% 6.90/7.09
% 6.90/7.09 FALSE TRUE
% 6.90/7.09 8 1 2
% 6.90/7.09 9 0 6
% 6.90/7.09 10 3 5
% 6.90/7.09 11 16 14
% 6.90/7.09 12 38 15
% 6.90/7.09 13 83 32
% 6.90/7.09 14 135 58
% 6.90/7.09 15 188 81
% 6.90/7.09 16 215 99
% 6.90/7.09 17 218 114
% 6.90/7.09 18 203 128
% 6.90/7.09 19 189 119
% 6.90/7.09 20 115 117
% 6.90/7.09 21 79 95
% 6.90/7.09 22 55 59
% 6.90/7.09 23 61 36
% 6.90/7.09 24 33 24
% 6.90/7.09 25 49 21
% 6.90/7.09 26 10 15
% 6.90/7.09 27 35 8
% 6.90/7.09 28 7 5
% 6.90/7.09 29 39 2
% 6.90/7.09 30 1 3
% 6.90/7.09 31 22 1
% 6.90/7.09 32 0 1
% 6.90/7.09 33 5 0
% 6.90/7.09 35 5 0
% 6.90/7.09 37 8 0
% 6.90/7.09 39 5 0
% 6.90/7.09 41 2 0
% 6.90/7.09 43 1 0
% 6.90/7.09 45 1 0
% 6.90/7.09 49 1 0
% 6.90/7.09 tot: 1823 1060 (36.8% true)
% 6.90/7.09
% 6.90/7.09
% 6.90/7.09 Model 8 [ 16 1 909 ] (0.00 seconds, 126407 Inserts)
% 6.90/7.09
% 6.90/7.09 That finishes the proof of the theorem.
% 6.90/7.09
% 6.90/7.09 Process 26402 finished Sat Jul 2 11:16:32 2022
%------------------------------------------------------------------------------