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