TSTP Solution File: LCL043-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL043-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n028.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:23 EDT 2022
% Result : Unsatisfiable 1.74s 1.97s
% Output : Refutation 1.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 13 ( 12 unt; 0 nHn; 3 RR)
% Number of literals : 15 ( 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; 1 con; 0-2 aty)
% Number of variables : 22 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(implies(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL043-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(implies(not(not(a)),a)),
file('LCL043-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(implies(A,implies(not(A),B))),
file('LCL043-1.p',unknown),
[] ).
cnf(4,axiom,
is_a_theorem(implies(A,implies(B,A))),
file('LCL043-1.p',unknown),
[] ).
cnf(5,axiom,
is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))),
file('LCL043-1.p',unknown),
[] ).
cnf(7,axiom,
is_a_theorem(implies(implies(A,B),implies(implies(not(A),B),B))),
file('LCL043-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(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(75,plain,
is_a_theorem(implies(implies(implies(A,implies(not(A),B)),C),C)),
inference(hyper,[status(thm)],[28,1,3]),
[iquote('hyper,28,1,3')] ).
cnf(98,plain,
is_a_theorem(implies(implies(not(A),implies(B,A)),implies(B,A))),
inference(hyper,[status(thm)],[7,1,4]),
[iquote('hyper,7,1,4')] ).
cnf(1891,plain,
is_a_theorem(implies(not(not(A)),A)),
inference(hyper,[status(thm)],[98,1,75]),
[iquote('hyper,98,1,75')] ).
cnf(1892,plain,
$false,
inference(binary,[status(thm)],[1891,2]),
[iquote('binary,1891.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL043-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n028.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:38:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.74/1.97 ----- Otter 3.3f, August 2004 -----
% 1.74/1.97 The process was started by sandbox2 on n028.cluster.edu,
% 1.74/1.97 Wed Jul 27 09:38:34 2022
% 1.74/1.97 The command was "./otter". The process ID is 11923.
% 1.74/1.97
% 1.74/1.97 set(prolog_style_variables).
% 1.74/1.97 set(auto).
% 1.74/1.97 dependent: set(auto1).
% 1.74/1.97 dependent: set(process_input).
% 1.74/1.97 dependent: clear(print_kept).
% 1.74/1.97 dependent: clear(print_new_demod).
% 1.74/1.97 dependent: clear(print_back_demod).
% 1.74/1.97 dependent: clear(print_back_sub).
% 1.74/1.97 dependent: set(control_memory).
% 1.74/1.97 dependent: assign(max_mem, 12000).
% 1.74/1.97 dependent: assign(pick_given_ratio, 4).
% 1.74/1.97 dependent: assign(stats_level, 1).
% 1.74/1.97 dependent: assign(max_seconds, 10800).
% 1.74/1.97 clear(print_given).
% 1.74/1.97
% 1.74/1.97 list(usable).
% 1.74/1.97 0 [] -is_a_theorem(implies(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 1.74/1.97 0 [] is_a_theorem(implies(X,implies(not(X),Y))).
% 1.74/1.97 0 [] is_a_theorem(implies(X,implies(Y,X))).
% 1.74/1.97 0 [] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 1.74/1.97 0 [] is_a_theorem(implies(implies(Y,Z),implies(implies(X,Y),implies(X,Z)))).
% 1.74/1.97 0 [] is_a_theorem(implies(implies(X,Y),implies(implies(not(X),Y),Y))).
% 1.74/1.97 0 [] -is_a_theorem(implies(not(not(a)),a)).
% 1.74/1.97 end_of_list.
% 1.74/1.97
% 1.74/1.97 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.74/1.97
% 1.74/1.97 This is a Horn set without equality. The strategy will
% 1.74/1.97 be hyperresolution, with satellites in sos and nuclei
% 1.74/1.97 in usable.
% 1.74/1.97
% 1.74/1.97 dependent: set(hyper_res).
% 1.74/1.97 dependent: clear(order_hyper).
% 1.74/1.97
% 1.74/1.97 ------------> process usable:
% 1.74/1.97 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.74/1.97 ** KEPT (pick-wt=6): 2 [] -is_a_theorem(implies(not(not(a)),a)).
% 1.74/1.97
% 1.74/1.97 ------------> process sos:
% 1.74/1.97 ** KEPT (pick-wt=7): 3 [] is_a_theorem(implies(A,implies(not(A),B))).
% 1.74/1.97 ** KEPT (pick-wt=6): 4 [] is_a_theorem(implies(A,implies(B,A))).
% 1.74/1.97 ** KEPT (pick-wt=12): 5 [] is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 1.74/1.97 ** KEPT (pick-wt=12): 6 [] is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))).
% 1.74/1.97 ** KEPT (pick-wt=11): 7 [] is_a_theorem(implies(implies(A,B),implies(implies(not(A),B),B))).
% 1.74/1.97
% 1.74/1.97 ======= end of input processing =======
% 1.74/1.97
% 1.74/1.97 =========== start of search ===========
% 1.74/1.97
% 1.74/1.97 -------- PROOF --------
% 1.74/1.97
% 1.74/1.97 ----> UNIT CONFLICT at 0.05 sec ----> 1892 [binary,1891.1,2.1] $F.
% 1.74/1.97
% 1.74/1.97 Length of proof is 6. Level of proof is 5.
% 1.74/1.97
% 1.74/1.97 ---------------- PROOF ----------------
% 1.74/1.97 % SZS status Unsatisfiable
% 1.74/1.97 % SZS output start Refutation
% See solution above
% 1.74/1.97 ------------ end of proof -------------
% 1.74/1.97
% 1.74/1.97
% 1.74/1.97 Search stopped by max_proofs option.
% 1.74/1.97
% 1.74/1.97
% 1.74/1.97 Search stopped by max_proofs option.
% 1.74/1.97
% 1.74/1.97 ============ end of search ============
% 1.74/1.97
% 1.74/1.97 -------------- statistics -------------
% 1.74/1.97 clauses given 109
% 1.74/1.97 clauses generated 6282
% 1.74/1.97 clauses kept 1891
% 1.74/1.97 clauses forward subsumed 4398
% 1.74/1.97 clauses back subsumed 4
% 1.74/1.97 Kbytes malloced 3906
% 1.74/1.97
% 1.74/1.97 ----------- times (seconds) -----------
% 1.74/1.97 user CPU time 0.05 (0 hr, 0 min, 0 sec)
% 1.74/1.97 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.74/1.97 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.74/1.97
% 1.74/1.97 That finishes the proof of the theorem.
% 1.74/1.97
% 1.74/1.97 Process 11923 finished Wed Jul 27 09:38:35 2022
% 1.74/1.97 Otter interrupted
% 1.74/1.97 PROOF FOUND
%------------------------------------------------------------------------------