TSTP Solution File: LCL380-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL380-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n008.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:48 EDT 2022
% Result : Unsatisfiable 21.12s 21.36s
% Output : Refutation 21.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL380-1 : TPTP v8.1.0. Released v2.3.0.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n008.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 4 02:02:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n008.cluster.edu,
% 0.12/0.35 Mon Jul 4 02:02:53 2022
% 0.12/0.35 The command was "./sos". The process ID is 4774.
% 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.38
% 0.12/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 -------------- Softie stats --------------
% 0.12/0.38
% 0.12/0.38 UPDATE_STOP: 300
% 0.12/0.38 SFINDER_TIME_LIMIT: 2
% 0.12/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38 number of clauses in intial UL: 2
% 0.12/0.38 number of clauses initially in problem: 5
% 0.12/0.38 percentage of clauses intially in UL: 40
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 5
% 0.12/0.38 distinct predicate count: 1
% 0.12/0.38 distinct function count: 2
% 0.12/0.38 distinct constant count: 2
% 0.12/0.38
% 0.12/0.38 ---------- no more Softie stats ----------
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 =========== start of search ===========
% 16.73/16.92
% 16.73/16.92
% 16.73/16.92 Changing weight limit from 60 to 39.
% 16.73/16.92
% 16.73/16.92 Model 2 (0.00 seconds, 0 Inserts)
% 16.73/16.92
% 16.73/16.92 Stopped by limit on number of solutions
% 16.73/16.92
% 16.73/16.92 Stopped by limit on insertions
% 16.73/16.92
% 16.73/16.92 Model 3 (0.00 seconds, 0 Inserts)
% 16.73/16.92
% 16.73/16.92 Stopped by limit on number of solutions
% 16.73/16.92
% 16.73/16.92 Stopped by limit on insertions
% 16.73/16.92
% 16.73/16.92 Stopped by limit on insertions
% 16.73/16.92
% 16.73/16.92 Model 4 [ 1 0 224 ] (0.00 seconds, 250000 Inserts)
% 16.73/16.92
% 16.73/16.92 Stopped by limit on insertions
% 16.73/16.92
% 16.73/16.92 Model 5 [ 1 0 120 ] (0.00 seconds, 250000 Inserts)
% 16.73/16.92
% 16.73/16.92 Resetting weight limit to 39 after 155 givens.
% 16.73/16.92
% 21.12/21.36
% 21.12/21.36 -- HEY sandbox2, WE HAVE A PROOF!! --
% 21.12/21.36
% 21.12/21.36 Stopped by limit on insertions
% 21.12/21.36
% 21.12/21.36 Model 6 [ 6 1 767 ] (0.00 seconds, 250000 Inserts)
% 21.12/21.36
% 21.12/21.36 ----> UNIT CONFLICT at 20.97 sec ----> 4844 [binary,4843.1,2.1] {-} $F.
% 21.12/21.36
% 21.12/21.36 Length of proof is 33. Level of proof is 21.
% 21.12/21.36
% 21.12/21.36 ---------------- PROOF ----------------
% 21.12/21.36 % SZS status Unsatisfiable
% 21.12/21.36 % SZS output start Refutation
% 21.12/21.36
% 21.12/21.36 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 21.12/21.36 2 [] {+} -is_a_theorem(implies(implies(x,y),implies(not(not(x)),y))).
% 21.12/21.36 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 21.12/21.36 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 21.12/21.36 5 [] {-} is_a_theorem(implies(A,implies(not(A),B))).
% 21.12/21.36 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 21.12/21.36 7 [hyper,4,1,3] {+} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 21.12/21.36 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 21.12/21.36 16 [hyper,6,1,6] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 21.12/21.36 21 [hyper,9,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 21.12/21.36 25 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 21.12/21.36 57 [hyper,21,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 21.12/21.36 60 [hyper,21,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).
% 21.12/21.36 70 [hyper,57,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 21.12/21.36 89 [hyper,70,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 21.12/21.36 102 [hyper,89,1,25] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 21.12/21.36 133 [hyper,102,1,4] {+} is_a_theorem(implies(A,implies(B,B))).
% 21.12/21.36 193 [hyper,133,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 21.12/21.36 199 [hyper,193,1,193] {+} is_a_theorem(implies(A,implies(B,implies(C,C)))).
% 21.12/21.36 206 [hyper,193,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(D,D),B),C))).
% 21.12/21.36 211 [hyper,193,1,7] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 21.12/21.36 223 [hyper,199,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,B)),C),implies(D,C))).
% 21.12/21.36 282 [hyper,206,1,4] {-} is_a_theorem(implies(implies(implies(A,A),B),B)).
% 21.12/21.36 293 [hyper,282,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(implies(C,C),A),B))).
% 21.12/21.36 399 [hyper,293,1,193] {-} is_a_theorem(implies(A,implies(implies(implies(B,B),C),C))).
% 21.12/21.36 436 [hyper,399,1,16] {-} is_a_theorem(implies(implies(A,implies(implies(B,B),C)),implies(D,implies(A,C)))).
% 21.12/21.36 456 [hyper,211,1,3] {-} is_a_theorem(implies(implies(implies(implies(not(A),A),A),B),implies(C,B))).
% 21.12/21.36 1806 [hyper,436,1,456] {-} is_a_theorem(implies(A,implies(implies(implies(implies(not(B),B),B),C),C))).
% 21.12/21.36 1810 [hyper,436,1,223] {-} is_a_theorem(implies(A,implies(implies(implies(B,implies(C,C)),D),D))).
% 21.12/21.36 1816 [hyper,1810,1,1810] {-} is_a_theorem(implies(implies(implies(A,implies(B,B)),C),C)).
% 21.12/21.36 1947 [hyper,1806,1,1816] {-} is_a_theorem(implies(implies(implies(implies(not(A),A),A),B),B)).
% 21.12/21.36 1987 [hyper,1947,1,6] {+} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))).
% 21.12/21.36 2060 [hyper,1987,1,1987] {+} is_a_theorem(implies(implies(not(A),implies(not(A),A)),A)).
% 21.12/21.36 2068 [hyper,1987,1,70] {+} is_a_theorem(implies(A,implies(B,A))).
% 21.12/21.36 2349 [hyper,2068,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 21.12/21.36 4728 [hyper,60,1,2060] {-} is_a_theorem(implies(implies(not(A),not(not(A))),A)).
% 21.12/21.36 4779 [hyper,4728,1,2349] {+} is_a_theorem(implies(not(not(A)),A)).
% 21.12/21.36 4843 [hyper,4779,1,3] {-} is_a_theorem(implies(implies(A,B),implies(not(not(A)),B))).
% 21.12/21.36 4844 [binary,4843.1,2.1] {-} $F.
% 21.12/21.36
% 21.12/21.36 % SZS output end Refutation
% 21.12/21.36 ------------ end of proof -------------
% 21.12/21.36
% 21.12/21.36
% 21.12/21.36 Search stopped by max_proofs option.
% 21.12/21.36
% 21.12/21.36
% 21.12/21.36 Search stopped by max_proofs option.
% 21.12/21.36
% 21.12/21.36 ============ end of search ============
% 21.12/21.36
% 21.12/21.36 ----------- soft-scott stats ----------
% 21.12/21.36
% 21.12/21.36 true clauses given 50 (27.3%)
% 21.12/21.36 false clauses given 133
% 21.12/21.36
% 21.12/21.36 FALSE TRUE
% 21.12/21.36 10 5 1
% 21.12/21.36 11 7 0
% 21.12/21.36 12 34 14
% 21.12/21.36 13 85 21
% 21.12/21.36 14 133 56
% 21.12/21.36 15 225 66
% 21.12/21.36 16 224 121
% 21.12/21.36 17 312 155
% 21.12/21.36 18 310 221
% 21.12/21.36 19 326 191
% 21.12/21.36 20 283 224
% 21.12/21.36 21 130 37
% 21.12/21.36 22 29 5
% 21.12/21.36 23 18 1
% 21.12/21.36 24 17 1
% 21.12/21.36 25 19 1
% 21.12/21.36 26 4 0
% 21.12/21.36 27 6 0
% 21.12/21.36 28 2 0
% 21.12/21.36 29 11 0
% 21.12/21.36 30 1 0
% 21.12/21.36 31 12 0
% 21.12/21.36 32 1 0
% 21.12/21.36 33 4 0
% 21.12/21.36 35 3 0
% 21.12/21.36 37 1 0
% 21.12/21.36 39 1 0
% 21.12/21.36 tot: 2203 1115 (33.6% true)
% 21.12/21.36
% 21.12/21.36
% 21.12/21.36 Model 6 [ 6 1 767 ] (0.00 seconds, 250000 Inserts)
% 21.12/21.36
% 21.12/21.36 That finishes the proof of the theorem.
% 21.12/21.36
% 21.12/21.36 Process 4774 finished Mon Jul 4 02:03:14 2022
%------------------------------------------------------------------------------