TSTP Solution File: LCL405-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL405-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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:58 EDT 2022
% Result : Unsatisfiable 27.15s 27.33s
% Output : Refutation 27.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL405-1 : TPTP v8.1.0. Released v2.3.0.
% 0.06/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n021.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 17:02:17 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox on n021.cluster.edu,
% 0.13/0.35 Mon Jul 4 17:02:17 2022
% 0.13/0.35 The command was "./sos". The process ID is 22900.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.35
% 0.13/0.35 This is a Horn set without equality. The strategy will
% 0.13/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.35 in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: clear(order_hyper).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.13/0.38
% 0.13/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.38
% 0.13/0.38 Stopped by limit on number of solutions
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 -------------- Softie stats --------------
% 0.13/0.38
% 0.13/0.38 UPDATE_STOP: 300
% 0.13/0.38 SFINDER_TIME_LIMIT: 2
% 0.13/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.38 number of clauses in intial UL: 2
% 0.13/0.38 number of clauses initially in problem: 5
% 0.13/0.38 percentage of clauses intially in UL: 40
% 0.13/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.38 percent of all initial clauses that are short: 100
% 0.13/0.38 absolute distinct symbol count: 5
% 0.13/0.38 distinct predicate count: 1
% 0.13/0.38 distinct function count: 2
% 0.13/0.38 distinct constant count: 2
% 0.13/0.38
% 0.13/0.38 ---------- no more Softie stats ----------
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 =========== start of search ===========
% 26.85/27.09
% 26.85/27.09
% 26.85/27.09 Changing weight limit from 60 to 58.
% 26.85/27.09
% 26.85/27.09 Model 2 (0.00 seconds, 0 Inserts)
% 26.85/27.09
% 26.85/27.09 Stopped by limit on number of solutions
% 26.85/27.09
% 26.85/27.09 Model 3 (0.00 seconds, 0 Inserts)
% 26.85/27.09
% 26.85/27.09 Stopped by limit on number of solutions
% 26.85/27.09
% 26.85/27.09 Stopped by limit on insertions
% 26.85/27.09
% 26.85/27.09 Model 4 [ 1 1 171 ] (0.00 seconds, 250000 Inserts)
% 26.85/27.09
% 26.85/27.09 Stopped by limit on insertions
% 26.85/27.09
% 26.85/27.09 Model 5 [ 1 0 75 ] (0.00 seconds, 250000 Inserts)
% 26.85/27.09
% 26.85/27.09 Stopped by limit on insertions
% 26.85/27.09
% 26.85/27.09 Model 6 [ 1 1 227 ] (0.00 seconds, 250000 Inserts)
% 26.85/27.09
% 26.85/27.09 Stopped by limit on insertions
% 26.85/27.09
% 26.85/27.09 Model 7 [ 2 1 3270 ] (0.00 seconds, 250000 Inserts)
% 26.85/27.09
% 26.85/27.09 Stopped by limit on insertions
% 26.85/27.09
% 26.85/27.09 Model 8 [ 2 0 333 ] (0.00 seconds, 250000 Inserts)
% 26.85/27.09
% 26.85/27.09 Stopped by limit on insertions
% 26.85/27.09
% 26.85/27.09 Model 9 [ 3 0 54 ] (0.00 seconds, 250000 Inserts)
% 26.85/27.09
% 26.85/27.09 Resetting weight limit to 58 after 145 givens.
% 26.85/27.09
% 27.15/27.33
% 27.15/27.33 -- HEY sandbox, WE HAVE A PROOF!! --
% 27.15/27.33
% 27.15/27.33 ----> UNIT CONFLICT at 26.93 sec ----> 5713 [binary,5712.1,2.1] {-} $F.
% 27.15/27.33
% 27.15/27.33 Length of proof is 35. Level of proof is 23.
% 27.15/27.33
% 27.15/27.33 ---------------- PROOF ----------------
% 27.15/27.33 % SZS status Unsatisfiable
% 27.15/27.33 % SZS output start Refutation
% 27.15/27.33
% 27.15/27.33 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 27.15/27.33 2 [] {+} -is_a_theorem(not(implies(implies(x,x),not(implies(y,y))))).
% 27.15/27.33 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 27.15/27.33 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 27.15/27.33 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 27.15/27.33 6 [hyper,3,1,3] {+} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 27.15/27.33 7 [hyper,4,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 27.15/27.33 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 27.15/27.33 13 [hyper,9,1,3] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(not(A),D),B),C))).
% 27.15/27.33 15 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 27.15/27.33 17 [hyper,15,1,5] {+} is_a_theorem(implies(not(implies(A,A)),B)).
% 27.15/27.33 18 [hyper,6,1,6] {+} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 27.15/27.33 26 [hyper,7,1,9] {-} is_a_theorem(implies(A,implies(implies(not(not(A)),not(A)),B))).
% 27.15/27.33 30 [hyper,7,1,3] {-} is_a_theorem(implies(implies(implies(implies(not(A),A),B),C),implies(implies(A,B),C))).
% 27.15/27.33 45 [hyper,26,1,3] {-} is_a_theorem(implies(implies(implies(implies(not(not(A)),not(A)),B),C),implies(A,C))).
% 27.15/27.33 95 [hyper,30,1,6] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(implies(B,C),implies(A,C)))).
% 27.15/27.33 105 [hyper,45,1,6] {-} is_a_theorem(implies(implies(A,implies(not(not(B)),not(B))),implies(B,implies(A,C)))).
% 27.15/27.33 166 [hyper,105,1,17] {+} is_a_theorem(implies(A,implies(not(implies(B,B)),C))).
% 27.15/27.33 298 [hyper,166,1,95] {+} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 27.15/27.33 658 [hyper,298,1,7] {-} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 27.15/27.33 684 [hyper,658,1,18] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 27.15/27.33 774 [hyper,684,1,684] {-} is_a_theorem(implies(A,implies(implies(B,implies(not(C),C)),implies(B,C)))).
% 27.15/27.33 927 [hyper,774,1,774] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))).
% 27.15/27.33 946 [hyper,927,1,927] {-} is_a_theorem(implies(implies(not(A),implies(not(A),A)),A)).
% 27.15/27.33 962 [hyper,927,1,13] {-} is_a_theorem(implies(implies(implies(not(A),B),implies(not(C),C)),implies(A,C))).
% 27.15/27.33 963 [hyper,927,1,6] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(B,A),A))).
% 27.15/27.33 965 [hyper,927,1,298] {+} is_a_theorem(implies(implies(implies(A,A),B),B)).
% 27.15/27.33 985 [hyper,946,1,13] {-} is_a_theorem(implies(implies(implies(not(not(A)),B),implies(not(A),A)),A)).
% 27.15/27.33 1295 [hyper,985,1,6] {-} is_a_theorem(implies(implies(not(A),not(not(A))),A)).
% 27.15/27.33 1330 [hyper,1295,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),not(not(A))),B))).
% 27.15/27.33 1508 [hyper,1330,1,298] {-} is_a_theorem(implies(A,implies(implies(not(B),not(not(B))),B))).
% 27.15/27.33 1580 [hyper,1508,1,963] {-} is_a_theorem(implies(implies(implies(implies(not(A),not(not(A))),A),B),B)).
% 27.15/27.33 1711 [hyper,1580,1,6] {-} is_a_theorem(implies(implies(A,implies(not(B),not(not(B)))),implies(A,B))).
% 27.15/27.33 2890 [hyper,962,1,6] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 27.15/27.33 2894 [hyper,2890,1,1711] {-} is_a_theorem(implies(implies(not(not(not(A))),not(not(A))),A)).
% 27.15/27.33 2957 [hyper,2894,1,9] {+} is_a_theorem(implies(not(not(A)),A)).
% 27.15/27.33 3136 [hyper,2957,1,3] {-} is_a_theorem(implies(implies(A,B),implies(not(not(A)),B))).
% 27.15/27.33 4046 [hyper,3136,1,965] {-} is_a_theorem(implies(not(not(implies(implies(A,A),B))),B)).
% 27.15/27.33 5099 [hyper,4046,1,2890] {-} is_a_theorem(implies(A,not(implies(implies(B,B),not(A))))).
% 27.15/27.33 5712 [hyper,5099,1,965] {-} is_a_theorem(not(implies(implies(A,A),not(implies(B,B))))).
% 27.15/27.33 5713 [binary,5712.1,2.1] {-} $F.
% 27.15/27.33
% 27.15/27.33 % SZS output end Refutation
% 27.15/27.33 ------------ end of proof -------------
% 27.15/27.33
% 27.15/27.33
% 27.15/27.33 Search stopped by max_proofs option.
% 27.15/27.33
% 27.15/27.33
% 27.15/27.33 Search stopped by max_proofs option.
% 27.15/27.33
% 27.15/27.33 ============ end of search ============
% 27.15/27.33
% 27.15/27.33 ----------- soft-scott stats ----------
% 27.15/27.33
% 27.15/27.33 true clauses given 49 (26.2%)
% 27.15/27.33 false clauses given 138
% 27.15/27.33
% 27.15/27.33 FALSE TRUE
% 27.15/27.33 8 0 1
% 27.15/27.33 9 0 7
% 27.15/27.33 10 1 34
% 27.15/27.33 11 56 24
% 27.15/27.33 12 100 59
% 27.15/27.33 13 136 20
% 27.15/27.33 14 152 36
% 27.15/27.33 15 201 69
% 27.15/27.33 16 204 43
% 27.15/27.33 17 228 60
% 27.15/27.33 18 269 43
% 27.15/27.33 19 259 52
% 27.15/27.33 20 232 33
% 27.15/27.33 21 210 54
% 27.15/27.33 22 189 23
% 27.15/27.33 23 248 27
% 27.15/27.33 24 38 25
% 27.15/27.33 25 0 24
% 27.15/27.33 26 1 9
% 27.15/27.33 27 3 22
% 27.15/27.33 28 1 11
% 27.15/27.33 29 2 20
% 27.15/27.33 30 2 21
% 27.15/27.33 31 1 22
% 27.15/27.33 32 0 7
% 27.15/27.33 33 2 8
% 27.15/27.33 34 0 4
% 27.15/27.33 35 0 4
% 27.15/27.33 36 0 5
% 27.15/27.33 37 2 12
% 27.15/27.33 38 0 7
% 27.15/27.33 39 2 4
% 27.15/27.33 40 0 2
% 27.15/27.33 41 0 2
% 27.15/27.33 43 0 1
% 27.15/27.33 44 0 1
% 27.15/27.33 45 0 1
% 27.15/27.33 46 0 1
% 27.15/27.33 47 0 2
% 27.15/27.33 49 1 4
% 27.15/27.33 51 0 1
% 27.15/27.33 53 0 2
% 27.15/27.33 58 0 1
% 27.15/27.33 tot: 2540 808 (24.1% true)
% 27.15/27.33
% 27.15/27.33
% 27.15/27.33 Model 9 [ 3 0 54 ] (0.00 seconds, 250000 Inserts)
% 27.15/27.33
% 27.15/27.33 That finishes the proof of the theorem.
% 27.15/27.33
% 27.15/27.33 Process 22900 finished Mon Jul 4 17:02:44 2022
%------------------------------------------------------------------------------