TSTP Solution File: LCL041-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL041-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-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 : 300s
% DateTime : Wed Jul 27 13:03:22 EDT 2022
% Result : Unsatisfiable 1.68s 1.91s
% Output : Refutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 14 ( 13 unt; 0 nHn; 3 RR)
% Number of literals : 16 ( 0 equ; 3 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 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 : 25 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(implies(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL041-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(implies(implies(a,implies(a,b)),implies(a,b))),
file('LCL041-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(implies(A,implies(not(A),B))),
file('LCL041-1.p',unknown),
[] ).
cnf(4,axiom,
is_a_theorem(implies(A,implies(B,A))),
file('LCL041-1.p',unknown),
[] ).
cnf(5,axiom,
is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))),
file('LCL041-1.p',unknown),
[] ).
cnf(7,axiom,
is_a_theorem(implies(implies(A,B),implies(implies(not(A),B),B))),
file('LCL041-1.p',unknown),
[] ).
cnf(23,plain,
is_a_theorem(implies(A,implies(B,B))),
inference(hyper,[status(thm)],[5,1,4]),
[iquote('hyper,5,1,4')] ).
cnf(24,plain,
is_a_theorem(implies(not(A),implies(A,B))),
inference(hyper,[status(thm)],[5,1,3]),
[iquote('hyper,5,1,3')] ).
cnf(25,plain,
is_a_theorem(implies(A,A)),
inference(hyper,[status(thm)],[23,1,23]),
[iquote('hyper,23,1,23')] ).
cnf(28,plain,
is_a_theorem(implies(A,implies(implies(A,B),B))),
inference(hyper,[status(thm)],[25,1,5]),
[iquote('hyper,25,1,5')] ).
cnf(66,plain,
is_a_theorem(implies(implies(implies(not(A),implies(A,B)),C),C)),
inference(hyper,[status(thm)],[28,1,24]),
[iquote('hyper,28,1,24')] ).
cnf(87,plain,
is_a_theorem(implies(implies(not(A),B),implies(implies(A,B),B))),
inference(hyper,[status(thm)],[7,1,5]),
[iquote('hyper,7,1,5')] ).
cnf(1144,plain,
is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))),
inference(hyper,[status(thm)],[87,1,66]),
[iquote('hyper,87,1,66')] ).
cnf(1145,plain,
$false,
inference(binary,[status(thm)],[1144,2]),
[iquote('binary,1144.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL041-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n008.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 09:18:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.68/1.91 ----- Otter 3.3f, August 2004 -----
% 1.68/1.91 The process was started by sandbox2 on n008.cluster.edu,
% 1.68/1.91 Wed Jul 27 09:18:23 2022
% 1.68/1.91 The command was "./otter". The process ID is 17540.
% 1.68/1.91
% 1.68/1.91 set(prolog_style_variables).
% 1.68/1.91 set(auto).
% 1.68/1.91 dependent: set(auto1).
% 1.68/1.91 dependent: set(process_input).
% 1.68/1.91 dependent: clear(print_kept).
% 1.68/1.91 dependent: clear(print_new_demod).
% 1.68/1.91 dependent: clear(print_back_demod).
% 1.68/1.91 dependent: clear(print_back_sub).
% 1.68/1.91 dependent: set(control_memory).
% 1.68/1.91 dependent: assign(max_mem, 12000).
% 1.68/1.91 dependent: assign(pick_given_ratio, 4).
% 1.68/1.91 dependent: assign(stats_level, 1).
% 1.68/1.91 dependent: assign(max_seconds, 10800).
% 1.68/1.91 clear(print_given).
% 1.68/1.91
% 1.68/1.91 list(usable).
% 1.68/1.91 0 [] -is_a_theorem(implies(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 1.68/1.91 0 [] is_a_theorem(implies(X,implies(not(X),Y))).
% 1.68/1.91 0 [] is_a_theorem(implies(X,implies(Y,X))).
% 1.68/1.91 0 [] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 1.68/1.91 0 [] is_a_theorem(implies(implies(Y,Z),implies(implies(X,Y),implies(X,Z)))).
% 1.68/1.91 0 [] is_a_theorem(implies(implies(X,Y),implies(implies(not(X),Y),Y))).
% 1.68/1.91 0 [] -is_a_theorem(implies(implies(a,implies(a,b)),implies(a,b))).
% 1.68/1.91 end_of_list.
% 1.68/1.91
% 1.68/1.91 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.68/1.91
% 1.68/1.91 This is a Horn set without equality. The strategy will
% 1.68/1.91 be hyperresolution, with satellites in sos and nuclei
% 1.68/1.91 in usable.
% 1.68/1.91
% 1.68/1.91 dependent: set(hyper_res).
% 1.68/1.91 dependent: clear(order_hyper).
% 1.68/1.91
% 1.68/1.91 ------------> process usable:
% 1.68/1.91 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.68/1.91 ** KEPT (pick-wt=10): 2 [] -is_a_theorem(implies(implies(a,implies(a,b)),implies(a,b))).
% 1.68/1.91
% 1.68/1.91 ------------> process sos:
% 1.68/1.91 ** KEPT (pick-wt=7): 3 [] is_a_theorem(implies(A,implies(not(A),B))).
% 1.68/1.91 ** KEPT (pick-wt=6): 4 [] is_a_theorem(implies(A,implies(B,A))).
% 1.68/1.91 ** KEPT (pick-wt=12): 5 [] is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 1.68/1.91 ** KEPT (pick-wt=12): 6 [] is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))).
% 1.68/1.91 ** KEPT (pick-wt=11): 7 [] is_a_theorem(implies(implies(A,B),implies(implies(not(A),B),B))).
% 1.68/1.91
% 1.68/1.91 ======= end of input processing =======
% 1.68/1.91
% 1.68/1.91 =========== start of search ===========
% 1.68/1.91
% 1.68/1.91 -------- PROOF --------
% 1.68/1.91
% 1.68/1.91 ----> UNIT CONFLICT at 0.03 sec ----> 1145 [binary,1144.1,2.1] $F.
% 1.68/1.91
% 1.68/1.91 Length of proof is 7. Level of proof is 5.
% 1.68/1.91
% 1.68/1.91 ---------------- PROOF ----------------
% 1.68/1.91 % SZS status Unsatisfiable
% 1.68/1.91 % SZS output start Refutation
% See solution above
% 1.68/1.91 ------------ end of proof -------------
% 1.68/1.91
% 1.68/1.91
% 1.68/1.91 Search stopped by max_proofs option.
% 1.68/1.91
% 1.68/1.91
% 1.68/1.91 Search stopped by max_proofs option.
% 1.68/1.91
% 1.68/1.91 ============ end of search ============
% 1.68/1.91
% 1.68/1.91 -------------- statistics -------------
% 1.68/1.91 clauses given 79
% 1.68/1.91 clauses generated 3706
% 1.68/1.91 clauses kept 1144
% 1.68/1.91 clauses forward subsumed 2569
% 1.68/1.91 clauses back subsumed 0
% 1.68/1.91 Kbytes malloced 2929
% 1.68/1.91
% 1.68/1.91 ----------- times (seconds) -----------
% 1.68/1.91 user CPU time 0.03 (0 hr, 0 min, 0 sec)
% 1.68/1.91 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/1.91 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.68/1.91
% 1.68/1.91 That finishes the proof of the theorem.
% 1.68/1.91
% 1.68/1.91 Process 17540 finished Wed Jul 27 09:18:25 2022
% 1.68/1.91 Otter interrupted
% 1.68/1.91 PROOF FOUND
%------------------------------------------------------------------------------