TSTP Solution File: LCL401-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL401-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n011.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:56 EDT 2022
% Result : Unsatisfiable 18.51s 18.71s
% Output : Refutation 18.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : LCL401-1 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 4 12:26:51 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n011.cluster.edu,
% 0.12/0.35 Mon Jul 4 12:26:51 2022
% 0.12/0.35 The command was "./sos". The process ID is 28547.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.12/0.35
% 0.12/0.35 This is a Horn set without equality. The strategy will
% 0.12/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.35 in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: clear(order_hyper).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.37
% 0.12/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.37
% 0.12/0.37 Stopped by limit on number of solutions
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 -------------- Softie stats --------------
% 0.12/0.37
% 0.12/0.37 UPDATE_STOP: 300
% 0.12/0.37 SFINDER_TIME_LIMIT: 2
% 0.12/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.37 number of clauses in intial UL: 2
% 0.12/0.37 number of clauses initially in problem: 5
% 0.12/0.37 percentage of clauses intially in UL: 40
% 0.12/0.37 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.37 percent of all initial clauses that are short: 100
% 0.12/0.37 absolute distinct symbol count: 5
% 0.12/0.37 distinct predicate count: 1
% 0.12/0.37 distinct function count: 2
% 0.12/0.37 distinct constant count: 2
% 0.12/0.37
% 0.12/0.37 ---------- no more Softie stats ----------
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 =========== start of search ===========
% 17.39/17.57
% 17.39/17.57
% 17.39/17.57 Changing weight limit from 60 to 40.
% 17.39/17.57
% 17.39/17.57 Model 2 (0.00 seconds, 0 Inserts)
% 17.39/17.57
% 17.39/17.57 Stopped by limit on number of solutions
% 17.39/17.57
% 17.39/17.57 Model 3 (0.00 seconds, 0 Inserts)
% 17.39/17.57
% 17.39/17.57 Stopped by limit on number of solutions
% 17.39/17.57
% 17.39/17.57 Stopped by limit on insertions
% 17.39/17.57
% 17.39/17.57 Model 4 [ 1 1 123 ] (0.00 seconds, 250000 Inserts)
% 17.39/17.57
% 17.39/17.57 Model 5 (0.00 seconds, 250000 Inserts)
% 17.39/17.57
% 17.39/17.57 Stopped by limit on number of solutions
% 17.39/17.57
% 17.39/17.57 Stopped by limit on insertions
% 17.39/17.57
% 17.39/17.57 Model 6 [ 1 1 55 ] (0.00 seconds, 250000 Inserts)
% 17.39/17.57
% 17.39/17.57 Stopped by limit on insertions
% 17.39/17.57
% 17.39/17.57 Model 7 [ 1 0 72 ] (0.00 seconds, 250000 Inserts)
% 17.39/17.57
% 17.39/17.57 Stopped by limit on insertions
% 17.39/17.57
% 17.39/17.57 Model 8 [ 1 0 60 ] (0.00 seconds, 250000 Inserts)
% 17.39/17.57
% 17.39/17.57 Stopped by limit on insertions
% 17.39/17.57
% 17.39/17.57 Model 9 [ 1 0 36 ] (0.00 seconds, 250000 Inserts)
% 17.39/17.57
% 17.39/17.57 Stopped by limit on insertions
% 17.39/17.57
% 17.39/17.57 Model 10 [ 1 1 4966 ] (0.00 seconds, 250000 Inserts)
% 17.39/17.57
% 17.39/17.57 Resetting weight limit to 40 after 160 givens.
% 17.39/17.57
% 18.51/18.71
% 18.51/18.71 -- HEY sandbox2, WE HAVE A PROOF!! --
% 18.51/18.71
% 18.51/18.71 ----> UNIT CONFLICT at 18.32 sec ----> 6867 [binary,6866.1,2.1] {+} $F.
% 18.51/18.71
% 18.51/18.71 Length of proof is 36. Level of proof is 24.
% 18.51/18.71
% 18.51/18.71 ---------------- PROOF ----------------
% 18.51/18.71 % SZS status Unsatisfiable
% 18.51/18.71 % SZS output start Refutation
% 18.51/18.71
% 18.51/18.71 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 18.51/18.71 2 [] {+} -is_a_theorem(implies(not(implies(x,y)),not(y))).
% 18.51/18.71 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 18.51/18.71 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 18.51/18.71 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 18.51/18.71 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 18.51/18.71 7 [hyper,4,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 18.51/18.71 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 18.51/18.71 12 [hyper,7,1,7] {+} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(not(A),A),B))).
% 18.51/18.71 17 [hyper,7,1,3] {-} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(B,C),implies(A,C)))).
% 18.51/18.71 29 [hyper,9,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 18.51/18.71 34 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 18.51/18.71 40 [hyper,29,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 18.51/18.71 43 [hyper,29,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).
% 18.51/18.71 60 [hyper,40,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 18.51/18.71 78 [hyper,60,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 18.51/18.71 91 [hyper,78,1,34] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 18.51/18.71 119 [hyper,91,1,4] {+} is_a_theorem(implies(A,implies(B,B))).
% 18.51/18.71 183 [hyper,119,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 18.51/18.71 184 [hyper,12,1,91] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 18.51/18.71 208 [hyper,183,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(D,D),B),C))).
% 18.51/18.71 280 [hyper,184,1,3] {-} is_a_theorem(implies(implies(implies(implies(not(A),A),A),B),implies(C,B))).
% 18.51/18.71 319 [hyper,280,1,6] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 18.51/18.71 2251 [hyper,319,1,60] {+} is_a_theorem(implies(A,implies(B,implies(C,A)))).
% 18.51/18.71 2253 [hyper,319,1,43] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))).
% 18.51/18.71 2291 [hyper,2251,1,319] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 18.51/18.71 2319 [hyper,2253,1,319] {-} is_a_theorem(implies(A,implies(implies(not(B),not(C)),implies(C,B)))).
% 18.51/18.71 2357 [hyper,2291,1,17] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 18.51/18.71 2472 [hyper,2319,1,2319] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 18.51/18.71 2519 [hyper,2472,1,208] {-} is_a_theorem(implies(implies(implies(A,A),not(B)),implies(B,C))).
% 18.51/18.71 3247 [hyper,2357,1,2519] {+} is_a_theorem(implies(not(A),implies(A,B))).
% 18.51/18.71 3276 [hyper,3247,1,319] {-} is_a_theorem(implies(A,implies(not(not(B)),B))).
% 18.51/18.71 3293 [hyper,3276,1,3276] {+} is_a_theorem(implies(not(not(A)),A)).
% 18.51/18.71 3340 [hyper,3293,1,2472] {+} is_a_theorem(implies(A,not(not(A)))).
% 18.51/18.71 3362 [hyper,3340,1,2357] {+} is_a_theorem(implies(A,not(not(implies(B,A))))).
% 18.51/18.71 3948 [hyper,3362,1,2472] {-} is_a_theorem(implies(not(implies(A,not(B))),B)).
% 18.51/18.71 4149 [hyper,3948,1,3] {-} is_a_theorem(implies(implies(A,B),implies(not(implies(C,not(A))),B))).
% 18.51/18.71 5731 [hyper,4149,1,3362] {-} is_a_theorem(implies(not(implies(A,not(B))),not(not(implies(C,B))))).
% 18.51/18.71 6783 [hyper,5731,1,2472] {-} is_a_theorem(implies(not(implies(A,B)),implies(C,not(B)))).
% 18.51/18.71 6824 [hyper,6783,1,319] {-} is_a_theorem(implies(A,implies(not(implies(B,C)),not(C)))).
% 18.51/18.71 6866 [hyper,6824,1,6824] {-} is_a_theorem(implies(not(implies(A,B)),not(B))).
% 18.51/18.71 6867 [binary,6866.1,2.1] {+} $F.
% 18.51/18.71
% 18.51/18.71 % SZS output end Refutation
% 18.51/18.71 ------------ end of proof -------------
% 18.51/18.71
% 18.51/18.71
% 18.51/18.71 Search stopped by max_proofs option.
% 18.51/18.71
% 18.51/18.71
% 18.51/18.71 Search stopped by max_proofs option.
% 18.51/18.71
% 18.51/18.71 ============ end of search ============
% 18.51/18.71
% 18.51/18.71 ----------- soft-scott stats ----------
% 18.51/18.71
% 18.51/18.71 true clauses given 65 (26.9%)
% 18.51/18.71 false clauses given 177
% 18.51/18.71
% 18.51/18.71 FALSE TRUE
% 18.51/18.71 9 0 5
% 18.51/18.71 10 0 37
% 18.51/18.71 11 0 43
% 18.51/18.71 12 8 92
% 18.51/18.71 13 74 149
% 18.51/18.71 14 115 200
% 18.51/18.71 15 166 294
% 18.51/18.71 16 230 334
% 18.51/18.71 17 184 377
% 18.51/18.71 18 173 357
% 18.51/18.71 19 192 333
% 18.51/18.71 20 186 281
% 18.51/18.71 21 134 4
% 18.51/18.71 22 67 2
% 18.51/18.71 23 64 2
% 18.51/18.71 24 56 2
% 18.51/18.71 25 48 3
% 18.51/18.71 26 47 1
% 18.51/18.71 27 37 0
% 18.51/18.71 28 16 1
% 18.51/18.71 29 33 0
% 18.51/18.71 30 26 1
% 18.51/18.71 31 6 1
% 18.51/18.71 32 26 0
% 18.51/18.71 33 2 0
% 18.51/18.71 34 5 1
% 18.51/18.71 35 1 0
% 18.51/18.71 36 2 0
% 18.51/18.71 37 3 1
% 18.51/18.71 38 1 0
% 18.51/18.71 40 2 1
% 18.51/18.71 tot: 1904 2522 (57.0% true)
% 18.51/18.71
% 18.51/18.71
% 18.51/18.71 Model 10 [ 1 1 4966 ] (0.00 seconds, 250000 Inserts)
% 18.51/18.71
% 18.51/18.71 That finishes the proof of the theorem.
% 18.51/18.71
% 18.51/18.71 Process 28547 finished Mon Jul 4 12:27:09 2022
%------------------------------------------------------------------------------