TSTP Solution File: LCL399-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL399-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n003.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:55 EDT 2022
% Result : Unsatisfiable 4.89s 5.07s
% Output : Refutation 4.89s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL399-1 : TPTP v8.1.0. Released v2.3.0.
% 0.06/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n003.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 : Mon Jul 4 03:44:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n003.cluster.edu,
% 0.13/0.36 Mon Jul 4 03:44:39 2022
% 0.13/0.36 The command was "./sos". The process ID is 21253.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.36
% 0.13/0.36 This is a Horn set without equality. The strategy will
% 0.13/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.36 in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: clear(order_hyper).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.20/0.38
% 0.20/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.38
% 0.20/0.38 Stopped by limit on number of solutions
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 -------------- Softie stats --------------
% 0.20/0.38
% 0.20/0.38 UPDATE_STOP: 300
% 0.20/0.38 SFINDER_TIME_LIMIT: 2
% 0.20/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.38 number of clauses in intial UL: 2
% 0.20/0.38 number of clauses initially in problem: 5
% 0.20/0.38 percentage of clauses intially in UL: 40
% 0.20/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.38 percent of all initial clauses that are short: 100
% 0.20/0.38 absolute distinct symbol count: 5
% 0.20/0.38 distinct predicate count: 1
% 0.20/0.38 distinct function count: 2
% 0.20/0.38 distinct constant count: 2
% 0.20/0.38
% 0.20/0.38 ---------- no more Softie stats ----------
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 =========== start of search ===========
% 4.89/5.07
% 4.89/5.07 -------- PROOF --------
% 4.89/5.07 % SZS status Unsatisfiable
% 4.89/5.07 % SZS output start Refutation
% 4.89/5.07
% 4.89/5.07 Model 2 (0.00 seconds, 0 Inserts)
% 4.89/5.07
% 4.89/5.07 Stopped by limit on number of solutions
% 4.89/5.07
% 4.89/5.07 Model 3 (0.00 seconds, 0 Inserts)
% 4.89/5.07
% 4.89/5.07 Stopped by limit on number of solutions
% 4.89/5.07
% 4.89/5.07 Stopped by limit on insertions
% 4.89/5.07
% 4.89/5.07 Model 4 [ 1 1 69 ] (0.00 seconds, 250000 Inserts)
% 4.89/5.07
% 4.89/5.07 ----> UNIT CONFLICT at 4.67 sec ----> 2825 [binary,2824.1,2.1] {-} $F.
% 4.89/5.07
% 4.89/5.07 Length of proof is 22. Level of proof is 15.
% 4.89/5.07
% 4.89/5.07 ---------------- PROOF ----------------
% 4.89/5.07 % SZS status Unsatisfiable
% 4.89/5.07 % SZS output start Refutation
% 4.89/5.07
% 4.89/5.07 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 4.89/5.07 2 [] {+} -is_a_theorem(implies(implies(not(x),not(implies(y,y))),x)).
% 4.89/5.07 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 4.89/5.07 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 4.89/5.07 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 4.89/5.07 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 4.89/5.07 7 [hyper,4,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 4.89/5.07 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 4.89/5.07 14 [hyper,7,1,3] {-} is_a_theorem(implies(implies(implies(implies(not(A),A),B),C),implies(implies(A,B),C))).
% 4.89/5.07 31 [hyper,9,1,3] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(not(A),D),B),C))).
% 4.89/5.07 32 [hyper,9,1,7] {-} is_a_theorem(implies(A,implies(implies(not(not(A)),not(A)),B))).
% 4.89/5.07 34 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 4.89/5.07 36 [hyper,34,1,5] {+} is_a_theorem(implies(not(implies(A,A)),B)).
% 4.89/5.07 45 [hyper,32,1,3] {-} is_a_theorem(implies(implies(implies(implies(not(not(A)),not(A)),B),C),implies(A,C))).
% 4.89/5.07 97 [hyper,14,1,6] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(implies(B,C),implies(A,C)))).
% 4.89/5.07 107 [hyper,45,1,6] {-} is_a_theorem(implies(implies(A,implies(not(not(B)),not(B))),implies(B,implies(A,C)))).
% 4.89/5.07 166 [hyper,107,1,36] {+} is_a_theorem(implies(A,implies(not(implies(B,B)),C))).
% 4.89/5.07 275 [hyper,166,1,97] {+} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 4.89/5.07 411 [hyper,275,1,7] {-} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 4.89/5.07 423 [hyper,411,1,3] {-} is_a_theorem(implies(implies(implies(implies(not(A),A),A),B),implies(C,B))).
% 4.89/5.07 459 [hyper,423,1,6] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 4.89/5.07 479 [hyper,459,1,459] {-} is_a_theorem(implies(A,implies(implies(B,implies(not(C),C)),implies(B,C)))).
% 4.89/5.07 514 [hyper,479,1,479] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))).
% 4.89/5.07 542 [hyper,514,1,275] {+} is_a_theorem(implies(implies(implies(A,A),B),B)).
% 4.89/5.07 640 [hyper,542,1,514] {-} is_a_theorem(implies(implies(implies(A,A),implies(not(B),B)),B)).
% 4.89/5.07 1684 [hyper,31,1,640] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),implies(not(C),C)),C)).
% 4.89/5.07 2824 [hyper,1684,1,6] {-} is_a_theorem(implies(implies(not(A),not(implies(B,B))),A)).
% 4.89/5.07 2825 [binary,2824.1,2.1] {-} $F.
% 4.89/5.07
% 4.89/5.07 % SZS output end Refutation
% 4.89/5.07 ------------ end of proof -------------
% 4.89/5.07
% 4.89/5.07
% 4.89/5.07 Search stopped by max_proofs option.
% 4.89/5.07
% 4.89/5.07
% 4.89/5.07 Search stopped by max_proofs option.
% 4.89/5.07
% 4.89/5.07 ============ end of search ============
% 4.89/5.07
% 4.89/5.07 ----------- soft-scott stats ----------
% 4.89/5.07
% 4.89/5.07 true clauses given 36 (30.0%)
% 4.89/5.07 false clauses given 84
% 4.89/5.07
% 4.89/5.07 FALSE TRUE
% 4.89/5.07 11 0 10
% 4.89/5.07 12 0 37
% 4.89/5.07 13 0 39
% 4.89/5.07 14 8 60
% 4.89/5.07 15 62 46
% 4.89/5.07 16 49 92
% 4.89/5.07 17 112 61
% 4.89/5.07 18 64 85
% 4.89/5.07 19 116 66
% 4.89/5.07 20 55 70
% 4.89/5.07 21 126 33
% 4.89/5.07 22 58 37
% 4.89/5.07 23 121 13
% 4.89/5.07 24 47 30
% 4.89/5.07 25 106 6
% 4.89/5.07 26 24 9
% 4.89/5.07 27 107 2
% 4.89/5.07 28 20 4
% 4.89/5.07 29 83 0
% 4.89/5.07 30 42 9
% 4.89/5.07 31 96 1
% 4.89/5.07 32 17 7
% 4.89/5.07 33 119 3
% 4.89/5.07 34 12 6
% 4.89/5.07 35 67 0
% 4.89/5.07 36 4 3
% 4.89/5.07 37 86 0
% 4.89/5.07 38 5 1
% 4.89/5.07 39 67 0
% 4.89/5.07 40 7 0
% 4.89/5.07 41 34 0
% 4.89/5.07 42 3 1
% 4.89/5.07 43 21 0
% 4.89/5.07 44 0 1
% 4.89/5.07 45 16 0
% 4.89/5.07 47 5 0
% 4.89/5.07 49 7 0
% 4.89/5.07 51 8 0
% 4.89/5.07 53 5 0
% 4.89/5.07 54 1 0
% 4.89/5.07 55 8 0
% 4.89/5.07 57 2 0
% 4.89/5.07 58 3 0
% 4.89/5.07 59 3 0
% 4.89/5.07 tot: 1796 732 (29.0% true)
% 4.89/5.07
% 4.89/5.07
% 4.89/5.07 Model 4 [ 1 1 69 ] (0.00 seconds, 250000 Inserts)
% 4.89/5.07
% 4.89/5.07 That finishes the proof of the theorem.
% 4.89/5.07
% 4.89/5.07 Process 21253 finished Mon Jul 4 03:44:44 2022
%------------------------------------------------------------------------------