TSTP Solution File: LCL091-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL091-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n027.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:31 EDT 2022
% Result : Unsatisfiable 1.68s 1.89s
% Output : Refutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 3
% Syntax : Number of clauses : 23 ( 22 unt; 0 nHn; 3 RR)
% Number of literals : 25 ( 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 : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 70 ( 38 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(implies(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL091-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(implies(a,implies(b,a))),
file('LCL091-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(implies(implies(implies(A,B),implies(C,D)),implies(implies(D,A),implies(E,implies(C,A))))),
file('LCL091-1.p',unknown),
[] ).
cnf(4,plain,
is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(C,D)),implies(E,implies(implies(F,C),implies(C,D))))),
inference(hyper,[status(thm)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(5,plain,
is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(implies(D,E),implies(E,C)))))),
inference(hyper,[status(thm)],[4,1,4]),
[iquote('hyper,4,1,4')] ).
cnf(7,plain,
is_a_theorem(implies(implies(A,B),implies(B,implies(implies(C,D),implies(D,B))))),
inference(hyper,[status(thm)],[5,1,5]),
[iquote('hyper,5,1,5')] ).
cnf(11,plain,
is_a_theorem(implies(implies(implies(implies(A,B),implies(B,C)),D),implies(E,implies(C,D)))),
inference(hyper,[status(thm)],[7,1,3]),
[iquote('hyper,7,1,3')] ).
cnf(18,plain,
is_a_theorem(implies(implies(implies(A,B),implies(implies(C,D),implies(D,A))),implies(E,implies(F,implies(implies(C,D),implies(D,A)))))),
inference(hyper,[status(thm)],[11,1,3]),
[iquote('hyper,11,1,3')] ).
cnf(54,plain,
is_a_theorem(implies(A,implies(B,implies(implies(C,D),implies(D,implies(D,D)))))),
inference(hyper,[status(thm)],[18,1,3]),
[iquote('hyper,18,1,3')] ).
cnf(106,plain,
is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(C,C))))),
inference(hyper,[status(thm)],[54,1,54]),
[iquote('hyper,54,1,54')] ).
cnf(109,plain,
is_a_theorem(implies(implies(A,B),implies(B,implies(B,B)))),
inference(hyper,[status(thm)],[106,1,106]),
[iquote('hyper,106,1,106')] ).
cnf(114,plain,
is_a_theorem(implies(implies(implies(A,A),B),implies(C,implies(A,B)))),
inference(hyper,[status(thm)],[109,1,3]),
[iquote('hyper,109,1,3')] ).
cnf(122,plain,
is_a_theorem(implies(implies(implies(A,B),implies(A,A)),implies(C,implies(D,implies(A,A))))),
inference(hyper,[status(thm)],[114,1,3]),
[iquote('hyper,114,1,3')] ).
cnf(373,plain,
is_a_theorem(implies(A,implies(B,implies(implies(C,C),implies(C,C))))),
inference(hyper,[status(thm)],[122,1,114]),
[iquote('hyper,122,1,114')] ).
cnf(380,plain,
is_a_theorem(implies(A,implies(implies(B,B),implies(B,B)))),
inference(hyper,[status(thm)],[373,1,373]),
[iquote('hyper,373,1,373')] ).
cnf(389,plain,
is_a_theorem(implies(implies(A,A),implies(A,A))),
inference(hyper,[status(thm)],[380,1,380]),
[iquote('hyper,380,1,380')] ).
cnf(402,plain,
is_a_theorem(implies(A,implies(B,implies(C,C)))),
inference(hyper,[status(thm)],[389,1,122]),
[iquote('hyper,389,1,122')] ).
cnf(404,plain,
is_a_theorem(implies(A,implies(B,B))),
inference(hyper,[status(thm)],[402,1,402]),
[iquote('hyper,402,1,402')] ).
cnf(413,plain,
is_a_theorem(implies(A,A)),
inference(hyper,[status(thm)],[404,1,404]),
[iquote('hyper,404,1,404')] ).
cnf(420,plain,
is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(D,C))))),
inference(hyper,[status(thm)],[413,1,4]),
[iquote('hyper,413,1,4')] ).
cnf(477,plain,
is_a_theorem(implies(implies(A,B),implies(B,implies(C,B)))),
inference(hyper,[status(thm)],[420,1,420]),
[iquote('hyper,420,1,420')] ).
cnf(485,plain,
is_a_theorem(implies(A,implies(B,A))),
inference(hyper,[status(thm)],[477,1,413]),
[iquote('hyper,477,1,413')] ).
cnf(486,plain,
$false,
inference(binary,[status(thm)],[485,2]),
[iquote('binary,485.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : LCL091-1 : TPTP v8.1.0. Released v1.0.0.
% 0.02/0.11 % Command : otter-tptp-script %s
% 0.11/0.30 % Computer : n027.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Wed Jul 27 09:28:06 EDT 2022
% 0.11/0.30 % CPUTime :
% 1.68/1.89 ----- Otter 3.3f, August 2004 -----
% 1.68/1.89 The process was started by sandbox on n027.cluster.edu,
% 1.68/1.89 Wed Jul 27 09:28:06 2022
% 1.68/1.89 The command was "./otter". The process ID is 924.
% 1.68/1.89
% 1.68/1.89 set(prolog_style_variables).
% 1.68/1.89 set(auto).
% 1.68/1.89 dependent: set(auto1).
% 1.68/1.89 dependent: set(process_input).
% 1.68/1.89 dependent: clear(print_kept).
% 1.68/1.89 dependent: clear(print_new_demod).
% 1.68/1.89 dependent: clear(print_back_demod).
% 1.68/1.89 dependent: clear(print_back_sub).
% 1.68/1.89 dependent: set(control_memory).
% 1.68/1.89 dependent: assign(max_mem, 12000).
% 1.68/1.89 dependent: assign(pick_given_ratio, 4).
% 1.68/1.89 dependent: assign(stats_level, 1).
% 1.68/1.89 dependent: assign(max_seconds, 10800).
% 1.68/1.89 clear(print_given).
% 1.68/1.89
% 1.68/1.89 list(usable).
% 1.68/1.89 0 [] -is_a_theorem(implies(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 1.68/1.89 0 [] is_a_theorem(implies(implies(implies(P,Q),implies(R,S)),implies(implies(S,P),implies(T,implies(R,P))))).
% 1.68/1.89 0 [] -is_a_theorem(implies(a,implies(b,a))).
% 1.68/1.89 end_of_list.
% 1.68/1.89
% 1.68/1.89 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.68/1.89
% 1.68/1.89 This is a Horn set without equality. The strategy will
% 1.68/1.89 be hyperresolution, with satellites in sos and nuclei
% 1.68/1.89 in usable.
% 1.68/1.89
% 1.68/1.89 dependent: set(hyper_res).
% 1.68/1.89 dependent: clear(order_hyper).
% 1.68/1.89
% 1.68/1.89 ------------> process usable:
% 1.68/1.89 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.68/1.89 ** KEPT (pick-wt=6): 2 [] -is_a_theorem(implies(a,implies(b,a))).
% 1.68/1.89
% 1.68/1.89 ------------> process sos:
% 1.68/1.89 ** KEPT (pick-wt=18): 3 [] is_a_theorem(implies(implies(implies(A,B),implies(C,D)),implies(implies(D,A),implies(E,implies(C,A))))).
% 1.68/1.89
% 1.68/1.89 ======= end of input processing =======
% 1.68/1.89
% 1.68/1.89 =========== start of search ===========
% 1.68/1.89
% 1.68/1.89 -------- PROOF --------
% 1.68/1.89
% 1.68/1.89 ----> UNIT CONFLICT at 0.02 sec ----> 486 [binary,485.1,2.1] $F.
% 1.68/1.89
% 1.68/1.89 Length of proof is 19. Level of proof is 19.
% 1.68/1.89
% 1.68/1.89 ---------------- PROOF ----------------
% 1.68/1.89 % SZS status Unsatisfiable
% 1.68/1.89 % SZS output start Refutation
% See solution above
% 1.68/1.89 ------------ end of proof -------------
% 1.68/1.89
% 1.68/1.89
% 1.68/1.89 Search stopped by max_proofs option.
% 1.68/1.89
% 1.68/1.89
% 1.68/1.89 Search stopped by max_proofs option.
% 1.68/1.89
% 1.68/1.89 ============ end of search ============
% 1.68/1.89
% 1.68/1.89 -------------- statistics -------------
% 1.68/1.89 clauses given 70
% 1.68/1.89 clauses generated 3122
% 1.68/1.89 clauses kept 485
% 1.68/1.89 clauses forward subsumed 2640
% 1.68/1.89 clauses back subsumed 246
% 1.68/1.89 Kbytes malloced 976
% 1.68/1.89
% 1.68/1.89 ----------- times (seconds) -----------
% 1.68/1.89 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 1.68/1.89 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/1.89 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.68/1.89
% 1.68/1.89 That finishes the proof of the theorem.
% 1.68/1.89
% 1.68/1.89 Process 924 finished Wed Jul 27 09:28:08 2022
% 1.68/1.89 Otter interrupted
% 1.68/1.89 PROOF FOUND
%------------------------------------------------------------------------------