TSTP Solution File: LCL072-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL072-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n026.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:27 EDT 2022
% Result : Unsatisfiable 2.40s 2.63s
% Output : Refutation 2.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of clauses : 25 ( 24 unt; 0 nHn; 3 RR)
% Number of literals : 27 ( 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 : 76 ( 28 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(implies(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL072-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(implies(a,implies(not(a),b))),
file('LCL072-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))),
file('LCL072-1.p',unknown),
[] ).
cnf(4,axiom,
is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))),
file('LCL072-1.p',unknown),
[] ).
cnf(5,axiom,
is_a_theorem(implies(implies(A,implies(not(B),C)),implies(A,implies(implies(D,C),implies(implies(B,D),C))))),
file('LCL072-1.p',unknown),
[] ).
cnf(6,plain,
is_a_theorem(implies(A,implies(B,A))),
inference(hyper,[status(thm)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(8,plain,
is_a_theorem(implies(A,implies(B,implies(C,A)))),
inference(hyper,[status(thm)],[6,1,3]),
[iquote('hyper,6,1,3')] ).
cnf(21,plain,
is_a_theorem(implies(not(A),implies(B,implies(A,C)))),
inference(hyper,[status(thm)],[4,1,6]),
[iquote('hyper,4,1,6')] ).
cnf(48,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(implies(D,C),implies(implies(A,D),C)))),
inference(hyper,[status(thm)],[5,1,4]),
[iquote('hyper,5,1,4')] ).
cnf(162,plain,
is_a_theorem(implies(implies(A,implies(B,implies(C,implies(D,E)))),implies(implies(D,A),implies(B,implies(C,implies(D,E)))))),
inference(hyper,[status(thm)],[48,1,8]),
[iquote('hyper,48,1,8')] ).
cnf(166,plain,
is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(implies(D,B),A),implies(B,C)))),
inference(hyper,[status(thm)],[48,1,3]),
[iquote('hyper,48,1,3')] ).
cnf(220,plain,
is_a_theorem(implies(implies(implies(A,B),not(C)),implies(B,implies(C,D)))),
inference(hyper,[status(thm)],[166,1,21]),
[iquote('hyper,166,1,21')] ).
cnf(224,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(B,implies(D,C)))),
inference(hyper,[status(thm)],[166,1,8]),
[iquote('hyper,166,1,8')] ).
cnf(227,plain,
is_a_theorem(implies(implies(implies(A,B),implies(implies(C,B),D)),implies(B,D))),
inference(hyper,[status(thm)],[166,1,3]),
[iquote('hyper,166,1,3')] ).
cnf(291,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(D,implies(B,C)))),
inference(hyper,[status(thm)],[227,1,224]),
[iquote('hyper,227,1,224')] ).
cnf(301,plain,
is_a_theorem(implies(not(A),implies(A,B))),
inference(hyper,[status(thm)],[227,1,220]),
[iquote('hyper,227,1,220')] ).
cnf(304,plain,
is_a_theorem(implies(A,A)),
inference(hyper,[status(thm)],[227,1,3]),
[iquote('hyper,227,1,3')] ).
cnf(336,plain,
is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(B,A),implies(B,C)))),
inference(hyper,[status(thm)],[304,1,48]),
[iquote('hyper,304,1,48')] ).
cnf(456,plain,
is_a_theorem(implies(implies(A,implies(implies(B,C),D)),implies(A,implies(C,D)))),
inference(hyper,[status(thm)],[336,1,291]),
[iquote('hyper,336,1,291')] ).
cnf(1659,plain,
is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(C,D))),
inference(hyper,[status(thm)],[456,1,3]),
[iquote('hyper,456,1,3')] ).
cnf(1666,plain,
is_a_theorem(implies(implies(A,implies(implies(B,implies(C,A)),D)),implies(A,D))),
inference(hyper,[status(thm)],[1659,1,336]),
[iquote('hyper,1659,1,336')] ).
cnf(4364,plain,
is_a_theorem(implies(implies(A,not(B)),implies(B,implies(C,implies(A,D))))),
inference(hyper,[status(thm)],[162,1,301]),
[iquote('hyper,162,1,301')] ).
cnf(4394,plain,
is_a_theorem(implies(A,implies(B,implies(not(A),C)))),
inference(hyper,[status(thm)],[4364,1,304]),
[iquote('hyper,4364,1,304')] ).
cnf(4400,plain,
is_a_theorem(implies(A,implies(not(A),B))),
inference(hyper,[status(thm)],[4394,1,1666]),
[iquote('hyper,4394,1,1666')] ).
cnf(4401,plain,
$false,
inference(binary,[status(thm)],[4400,2]),
[iquote('binary,4400.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL072-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n026.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 : 300
% 0.13/0.34 % DateTime : Wed Jul 27 09:23:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.40/2.63 ----- Otter 3.3f, August 2004 -----
% 2.40/2.63 The process was started by sandbox on n026.cluster.edu,
% 2.40/2.63 Wed Jul 27 09:23:24 2022
% 2.40/2.63 The command was "./otter". The process ID is 27675.
% 2.40/2.63
% 2.40/2.63 set(prolog_style_variables).
% 2.40/2.63 set(auto).
% 2.40/2.63 dependent: set(auto1).
% 2.40/2.63 dependent: set(process_input).
% 2.40/2.63 dependent: clear(print_kept).
% 2.40/2.63 dependent: clear(print_new_demod).
% 2.40/2.63 dependent: clear(print_back_demod).
% 2.40/2.63 dependent: clear(print_back_sub).
% 2.40/2.63 dependent: set(control_memory).
% 2.40/2.63 dependent: assign(max_mem, 12000).
% 2.40/2.63 dependent: assign(pick_given_ratio, 4).
% 2.40/2.63 dependent: assign(stats_level, 1).
% 2.40/2.63 dependent: assign(max_seconds, 10800).
% 2.40/2.63 clear(print_given).
% 2.40/2.63
% 2.40/2.63 list(usable).
% 2.40/2.63 0 [] -is_a_theorem(implies(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 2.40/2.63 0 [] is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))).
% 2.40/2.63 0 [] is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(X),Z))).
% 2.40/2.63 0 [] is_a_theorem(implies(implies(X,implies(not(Y),Z)),implies(X,implies(implies(U,Z),implies(implies(Y,U),Z))))).
% 2.40/2.63 0 [] -is_a_theorem(implies(a,implies(not(a),b))).
% 2.40/2.63 end_of_list.
% 2.40/2.63
% 2.40/2.63 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 2.40/2.63
% 2.40/2.63 This is a Horn set without equality. The strategy will
% 2.40/2.63 be hyperresolution, with satellites in sos and nuclei
% 2.40/2.63 in usable.
% 2.40/2.63
% 2.40/2.63 dependent: set(hyper_res).
% 2.40/2.63 dependent: clear(order_hyper).
% 2.40/2.63
% 2.40/2.63 ------------> process usable:
% 2.40/2.63 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 2.40/2.63 ** KEPT (pick-wt=7): 2 [] -is_a_theorem(implies(a,implies(not(a),b))).
% 2.40/2.63
% 2.40/2.63 ------------> process sos:
% 2.40/2.63 ** KEPT (pick-wt=10): 3 [] is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 2.40/2.63 ** KEPT (pick-wt=11): 4 [] is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))).
% 2.40/2.63 ** KEPT (pick-wt=19): 5 [] is_a_theorem(implies(implies(A,implies(not(B),C)),implies(A,implies(implies(D,C),implies(implies(B,D),C))))).
% 2.40/2.63
% 2.40/2.63 ======= end of input processing =======
% 2.40/2.63
% 2.40/2.63 =========== start of search ===========
% 2.40/2.63
% 2.40/2.63
% 2.40/2.63 Resetting weight limit to 15.
% 2.40/2.63
% 2.40/2.63
% 2.40/2.63 Resetting weight limit to 15.
% 2.40/2.63
% 2.40/2.63 sos_size=3791
% 2.40/2.63
% 2.40/2.63 -------- PROOF --------
% 2.40/2.63
% 2.40/2.63 ----> UNIT CONFLICT at 0.57 sec ----> 4401 [binary,4400.1,2.1] $F.
% 2.40/2.63
% 2.40/2.63 Length of proof is 19. Level of proof is 9.
% 2.40/2.63
% 2.40/2.63 ---------------- PROOF ----------------
% 2.40/2.63 % SZS status Unsatisfiable
% 2.40/2.63 % SZS output start Refutation
% See solution above
% 2.40/2.63 ------------ end of proof -------------
% 2.40/2.63
% 2.40/2.63
% 2.40/2.63 Search stopped by max_proofs option.
% 2.40/2.63
% 2.40/2.63
% 2.40/2.63 Search stopped by max_proofs option.
% 2.40/2.63
% 2.40/2.63 ============ end of search ============
% 2.40/2.63
% 2.40/2.63 -------------- statistics -------------
% 2.40/2.63 clauses given 548
% 2.40/2.63 clauses generated 161139
% 2.40/2.63 clauses kept 4400
% 2.40/2.63 clauses forward subsumed 136710
% 2.40/2.63 clauses back subsumed 88
% 2.40/2.63 Kbytes malloced 4882
% 2.40/2.63
% 2.40/2.63 ----------- times (seconds) -----------
% 2.40/2.63 user CPU time 0.57 (0 hr, 0 min, 0 sec)
% 2.40/2.63 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.40/2.63 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.40/2.63
% 2.40/2.63 That finishes the proof of the theorem.
% 2.40/2.63
% 2.40/2.63 Process 27675 finished Wed Jul 27 09:23:26 2022
% 2.40/2.63 Otter interrupted
% 2.40/2.63 PROOF FOUND
%------------------------------------------------------------------------------