TSTP Solution File: LCL059-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL059-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n015.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 : 300s
% DateTime : Wed Jul 27 13:03:25 EDT 2022
% Result : Unsatisfiable 2.01s 2.20s
% Output : Refutation 2.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of clauses : 29 ( 28 unt; 0 nHn; 3 RR)
% Number of literals : 31 ( 0 equ; 3 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 77 ( 27 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(implies(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL059-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(implies(implies(not(a),not(b)),implies(b,a))),
file('LCL059-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))),
file('LCL059-1.p',unknown),
[] ).
cnf(4,axiom,
is_a_theorem(implies(implies(not(A),A),A)),
file('LCL059-1.p',unknown),
[] ).
cnf(5,axiom,
is_a_theorem(implies(A,implies(not(A),B))),
file('LCL059-1.p',unknown),
[] ).
cnf(6,plain,
is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))),
inference(hyper,[status(thm)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(9,plain,
is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))),
inference(hyper,[status(thm)],[5,1,3]),
[iquote('hyper,5,1,3')] ).
cnf(16,plain,
is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))),
inference(hyper,[status(thm)],[6,1,6]),
[iquote('hyper,6,1,6')] ).
cnf(35,plain,
is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))),
inference(hyper,[status(thm)],[9,1,6]),
[iquote('hyper,9,1,6')] ).
cnf(40,plain,
is_a_theorem(implies(A,A)),
inference(hyper,[status(thm)],[9,1,4]),
[iquote('hyper,9,1,4')] ).
cnf(42,plain,
is_a_theorem(implies(not(implies(A,A)),B)),
inference(hyper,[status(thm)],[40,1,5]),
[iquote('hyper,40,1,5')] ).
cnf(67,plain,
is_a_theorem(implies(A,implies(B,implies(not(A),C)))),
inference(hyper,[status(thm)],[35,1,9]),
[iquote('hyper,35,1,9')] ).
cnf(70,plain,
is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))),
inference(hyper,[status(thm)],[35,1,3]),
[iquote('hyper,35,1,3')] ).
cnf(72,plain,
is_a_theorem(implies(A,implies(not(implies(B,B)),C))),
inference(hyper,[status(thm)],[35,1,42]),
[iquote('hyper,35,1,42')] ).
cnf(85,plain,
is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))),
inference(hyper,[status(thm)],[67,1,3]),
[iquote('hyper,67,1,3')] ).
cnf(99,plain,
is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))),
inference(hyper,[status(thm)],[72,1,3]),
[iquote('hyper,72,1,3')] ).
cnf(370,plain,
is_a_theorem(implies(A,implies(B,B))),
inference(hyper,[status(thm)],[99,1,4]),
[iquote('hyper,99,1,4')] ).
cnf(412,plain,
is_a_theorem(implies(implies(A,B),implies(C,implies(A,B)))),
inference(hyper,[status(thm)],[370,1,16]),
[iquote('hyper,370,1,16')] ).
cnf(456,plain,
is_a_theorem(implies(A,implies(implies(not(B),B),B))),
inference(hyper,[status(thm)],[412,1,4]),
[iquote('hyper,412,1,4')] ).
cnf(538,plain,
is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))),
inference(hyper,[status(thm)],[456,1,16]),
[iquote('hyper,456,1,16')] ).
cnf(1308,plain,
is_a_theorem(implies(A,implies(implies(B,implies(not(C),C)),implies(B,C)))),
inference(hyper,[status(thm)],[538,1,538]),
[iquote('hyper,538,1,538')] ).
cnf(1315,plain,
is_a_theorem(implies(A,implies(B,implies(C,A)))),
inference(hyper,[status(thm)],[538,1,85]),
[iquote('hyper,538,1,85')] ).
cnf(1341,plain,
is_a_theorem(implies(A,implies(B,implies(C,B)))),
inference(hyper,[status(thm)],[1315,1,538]),
[iquote('hyper,1315,1,538')] ).
cnf(1431,plain,
is_a_theorem(implies(implies(implies(A,implies(B,A)),C),implies(D,C))),
inference(hyper,[status(thm)],[1341,1,3]),
[iquote('hyper,1341,1,3')] ).
cnf(2315,plain,
is_a_theorem(implies(A,implies(implies(implies(B,implies(C,B)),D),D))),
inference(hyper,[status(thm)],[1431,1,538]),
[iquote('hyper,1431,1,538')] ).
cnf(2406,plain,
is_a_theorem(implies(implies(implies(A,implies(B,A)),C),C)),
inference(hyper,[status(thm)],[2315,1,2315]),
[iquote('hyper,2315,1,2315')] ).
cnf(2420,plain,
is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))),
inference(hyper,[status(thm)],[1308,1,2406]),
[iquote('hyper,1308,1,2406')] ).
cnf(2445,plain,
is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))),
inference(hyper,[status(thm)],[70,1,2420]),
[iquote('hyper,70,1,2420')] ).
cnf(2446,plain,
$false,
inference(binary,[status(thm)],[2445,2]),
[iquote('binary,2445.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL059-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n015.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 : 300
% 0.12/0.33 % DateTime : Wed Jul 27 09:29:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.01/2.20 ----- Otter 3.3f, August 2004 -----
% 2.01/2.20 The process was started by sandbox on n015.cluster.edu,
% 2.01/2.20 Wed Jul 27 09:29:42 2022
% 2.01/2.20 The command was "./otter". The process ID is 30767.
% 2.01/2.20
% 2.01/2.20 set(prolog_style_variables).
% 2.01/2.20 set(auto).
% 2.01/2.20 dependent: set(auto1).
% 2.01/2.20 dependent: set(process_input).
% 2.01/2.20 dependent: clear(print_kept).
% 2.01/2.20 dependent: clear(print_new_demod).
% 2.01/2.20 dependent: clear(print_back_demod).
% 2.01/2.20 dependent: clear(print_back_sub).
% 2.01/2.20 dependent: set(control_memory).
% 2.01/2.20 dependent: assign(max_mem, 12000).
% 2.01/2.20 dependent: assign(pick_given_ratio, 4).
% 2.01/2.20 dependent: assign(stats_level, 1).
% 2.01/2.20 dependent: assign(max_seconds, 10800).
% 2.01/2.20 clear(print_given).
% 2.01/2.20
% 2.01/2.20 list(usable).
% 2.01/2.20 0 [] -is_a_theorem(implies(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 2.01/2.20 0 [] is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 2.01/2.20 0 [] is_a_theorem(implies(implies(not(X),X),X)).
% 2.01/2.20 0 [] is_a_theorem(implies(X,implies(not(X),Y))).
% 2.01/2.20 0 [] -is_a_theorem(implies(implies(not(a),not(b)),implies(b,a))).
% 2.01/2.20 end_of_list.
% 2.01/2.20
% 2.01/2.20 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 2.01/2.20
% 2.01/2.20 This is a Horn set without equality. The strategy will
% 2.01/2.20 be hyperresolution, with satellites in sos and nuclei
% 2.01/2.20 in usable.
% 2.01/2.20
% 2.01/2.20 dependent: set(hyper_res).
% 2.01/2.20 dependent: clear(order_hyper).
% 2.01/2.20
% 2.01/2.20 ------------> process usable:
% 2.01/2.20 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 2.01/2.20 ** KEPT (pick-wt=10): 2 [] -is_a_theorem(implies(implies(not(a),not(b)),implies(b,a))).
% 2.01/2.20
% 2.01/2.20 ------------> process sos:
% 2.01/2.20 ** KEPT (pick-wt=12): 3 [] is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 2.01/2.20 ** KEPT (pick-wt=7): 4 [] is_a_theorem(implies(implies(not(A),A),A)).
% 2.01/2.20 ** KEPT (pick-wt=7): 5 [] is_a_theorem(implies(A,implies(not(A),B))).
% 2.01/2.20
% 2.01/2.20 ======= end of input processing =======
% 2.01/2.20
% 2.01/2.20 =========== start of search ===========
% 2.01/2.20
% 2.01/2.20
% 2.01/2.20 Resetting weight limit to 14.
% 2.01/2.20
% 2.01/2.20
% 2.01/2.20 Resetting weight limit to 14.
% 2.01/2.20
% 2.01/2.20 sos_size=2074
% 2.01/2.20
% 2.01/2.20 -------- PROOF --------
% 2.01/2.20
% 2.01/2.20 ----> UNIT CONFLICT at 0.11 sec ----> 2446 [binary,2445.1,2.1] $F.
% 2.01/2.20
% 2.01/2.20 Length of proof is 23. Level of proof is 16.
% 2.01/2.20
% 2.01/2.20 ---------------- PROOF ----------------
% 2.01/2.20 % SZS status Unsatisfiable
% 2.01/2.20 % SZS output start Refutation
% See solution above
% 2.01/2.20 ------------ end of proof -------------
% 2.01/2.20
% 2.01/2.20
% 2.01/2.20 Search stopped by max_proofs option.
% 2.01/2.20
% 2.01/2.20
% 2.01/2.20 Search stopped by max_proofs option.
% 2.01/2.20
% 2.01/2.20 ============ end of search ============
% 2.01/2.20
% 2.01/2.20 -------------- statistics -------------
% 2.01/2.20 clauses given 201
% 2.01/2.20 clauses generated 22685
% 2.01/2.20 clauses kept 2445
% 2.01/2.20 clauses forward subsumed 15646
% 2.01/2.20 clauses back subsumed 76
% 2.01/2.20 Kbytes malloced 4882
% 2.01/2.20
% 2.01/2.20 ----------- times (seconds) -----------
% 2.01/2.20 user CPU time 0.11 (0 hr, 0 min, 0 sec)
% 2.01/2.20 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.01/2.20 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 2.01/2.20
% 2.01/2.20 That finishes the proof of the theorem.
% 2.01/2.20
% 2.01/2.20 Process 30767 finished Wed Jul 27 09:29:43 2022
% 2.01/2.20 Otter interrupted
% 2.01/2.20 PROOF FOUND
%------------------------------------------------------------------------------