TSTP Solution File: LCL112-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL112-1 : 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:35 EDT 2022
% Result : Unsatisfiable 1.84s 2.06s
% Output : Refutation 1.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of clauses : 19 ( 18 unt; 0 nHn; 3 RR)
% Number of literals : 21 ( 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 : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 37 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(implies(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL112-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(implies(a,not(not(a)))),
file('LCL112-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(implies(A,implies(B,A))),
file('LCL112-1.p',unknown),
[] ).
cnf(4,axiom,
is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))),
file('LCL112-1.p',unknown),
[] ).
cnf(5,axiom,
is_a_theorem(implies(implies(implies(A,B),B),implies(implies(B,A),A))),
file('LCL112-1.p',unknown),
[] ).
cnf(6,axiom,
is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))),
file('LCL112-1.p',unknown),
[] ).
cnf(7,plain,
is_a_theorem(implies(A,implies(B,implies(C,B)))),
inference(hyper,[status(thm)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(15,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(implies(not(B),not(A)),C))),
inference(hyper,[status(thm)],[4,1,6]),
[iquote('hyper,4,1,6')] ).
cnf(16,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))),
inference(hyper,[status(thm)],[4,1,3]),
[iquote('hyper,4,1,3')] ).
cnf(20,plain,
is_a_theorem(implies(implies(implies(A,implies(B,A)),C),C)),
inference(hyper,[status(thm)],[5,1,7]),
[iquote('hyper,5,1,7')] ).
cnf(23,plain,
is_a_theorem(implies(not(A),implies(A,B))),
inference(hyper,[status(thm)],[16,1,6]),
[iquote('hyper,16,1,6')] ).
cnf(24,plain,
is_a_theorem(implies(A,implies(implies(A,B),B))),
inference(hyper,[status(thm)],[16,1,5]),
[iquote('hyper,16,1,5')] ).
cnf(27,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))),
inference(hyper,[status(thm)],[23,1,4]),
[iquote('hyper,23,1,4')] ).
cnf(59,plain,
is_a_theorem(implies(A,A)),
inference(hyper,[status(thm)],[20,1,16]),
[iquote('hyper,20,1,16')] ).
cnf(63,plain,
is_a_theorem(implies(implies(implies(A,A),B),B)),
inference(hyper,[status(thm)],[59,1,24]),
[iquote('hyper,59,1,24')] ).
cnf(348,plain,
is_a_theorem(implies(implies(not(A),not(implies(B,B))),A)),
inference(hyper,[status(thm)],[15,1,63]),
[iquote('hyper,15,1,63')] ).
cnf(418,plain,
is_a_theorem(implies(not(not(A)),A)),
inference(hyper,[status(thm)],[348,1,27]),
[iquote('hyper,348,1,27')] ).
cnf(433,plain,
is_a_theorem(implies(A,not(not(A)))),
inference(hyper,[status(thm)],[418,1,6]),
[iquote('hyper,418,1,6')] ).
cnf(434,plain,
$false,
inference(binary,[status(thm)],[433,2]),
[iquote('binary,433.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL112-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/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:13:31 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.84/2.06 ----- Otter 3.3f, August 2004 -----
% 1.84/2.06 The process was started by sandbox on n006.cluster.edu,
% 1.84/2.06 Wed Jul 27 09:13:32 2022
% 1.84/2.06 The command was "./otter". The process ID is 28241.
% 1.84/2.06
% 1.84/2.06 set(prolog_style_variables).
% 1.84/2.06 set(auto).
% 1.84/2.06 dependent: set(auto1).
% 1.84/2.06 dependent: set(process_input).
% 1.84/2.06 dependent: clear(print_kept).
% 1.84/2.06 dependent: clear(print_new_demod).
% 1.84/2.06 dependent: clear(print_back_demod).
% 1.84/2.06 dependent: clear(print_back_sub).
% 1.84/2.06 dependent: set(control_memory).
% 1.84/2.06 dependent: assign(max_mem, 12000).
% 1.84/2.06 dependent: assign(pick_given_ratio, 4).
% 1.84/2.06 dependent: assign(stats_level, 1).
% 1.84/2.06 dependent: assign(max_seconds, 10800).
% 1.84/2.06 clear(print_given).
% 1.84/2.06
% 1.84/2.06 list(usable).
% 1.84/2.06 0 [] -is_a_theorem(implies(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 1.84/2.06 0 [] is_a_theorem(implies(X,implies(Y,X))).
% 1.84/2.06 0 [] is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 1.84/2.06 0 [] is_a_theorem(implies(implies(implies(X,Y),Y),implies(implies(Y,X),X))).
% 1.84/2.06 0 [] is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))).
% 1.84/2.06 0 [] -is_a_theorem(implies(a,not(not(a)))).
% 1.84/2.06 end_of_list.
% 1.84/2.06
% 1.84/2.06 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.84/2.06
% 1.84/2.06 This is a Horn set without equality. The strategy will
% 1.84/2.06 be hyperresolution, with satellites in sos and nuclei
% 1.84/2.06 in usable.
% 1.84/2.06
% 1.84/2.06 dependent: set(hyper_res).
% 1.84/2.06 dependent: clear(order_hyper).
% 1.84/2.06
% 1.84/2.06 ------------> process usable:
% 1.84/2.06 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.84/2.06 ** KEPT (pick-wt=6): 2 [] -is_a_theorem(implies(a,not(not(a)))).
% 1.84/2.06
% 1.84/2.06 ------------> process sos:
% 1.84/2.06 ** KEPT (pick-wt=6): 3 [] is_a_theorem(implies(A,implies(B,A))).
% 1.84/2.06 ** KEPT (pick-wt=12): 4 [] is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 1.84/2.06 ** KEPT (pick-wt=12): 5 [] is_a_theorem(implies(implies(implies(A,B),B),implies(implies(B,A),A))).
% 1.84/2.06 ** KEPT (pick-wt=10): 6 [] is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 1.84/2.06
% 1.84/2.06 ======= end of input processing =======
% 1.84/2.06
% 1.84/2.06 =========== start of search ===========
% 1.84/2.06
% 1.84/2.06 -------- PROOF --------
% 1.84/2.06
% 1.84/2.06 ----> UNIT CONFLICT at 0.01 sec ----> 434 [binary,433.1,2.1] $F.
% 1.84/2.06
% 1.84/2.06 Length of proof is 12. Level of proof is 7.
% 1.84/2.06
% 1.84/2.06 ---------------- PROOF ----------------
% 1.84/2.06 % SZS status Unsatisfiable
% 1.84/2.06 % SZS output start Refutation
% See solution above
% 1.84/2.06 ------------ end of proof -------------
% 1.84/2.06
% 1.84/2.06
% 1.84/2.06 Search stopped by max_proofs option.
% 1.84/2.06
% 1.84/2.06
% 1.84/2.06 Search stopped by max_proofs option.
% 1.84/2.06
% 1.84/2.06 ============ end of search ============
% 1.84/2.06
% 1.84/2.06 -------------- statistics -------------
% 1.84/2.06 clauses given 48
% 1.84/2.06 clauses generated 1614
% 1.84/2.06 clauses kept 433
% 1.84/2.06 clauses forward subsumed 1187
% 1.84/2.06 clauses back subsumed 4
% 1.84/2.06 Kbytes malloced 1953
% 1.84/2.06
% 1.84/2.06 ----------- times (seconds) -----------
% 1.84/2.06 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.84/2.06 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.84/2.06 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.84/2.06
% 1.84/2.06 That finishes the proof of the theorem.
% 1.84/2.06
% 1.84/2.06 Process 28241 finished Wed Jul 27 09:13:33 2022
% 1.84/2.06 Otter interrupted
% 1.84/2.06 PROOF FOUND
%------------------------------------------------------------------------------