TSTP Solution File: LCL069-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL069-1 : TPTP v8.1.0. Bugfixed v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n016.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:26 EDT 2022
% Result : Unsatisfiable 1.60s 1.81s
% Output : Refutation 1.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of clauses : 17 ( 16 unt; 0 nHn; 3 RR)
% Number of literals : 19 ( 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 : 43 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(implies(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL069-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(implies(a,implies(not(a),b))),
file('LCL069-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))),
file('LCL069-1.p',unknown),
[] ).
cnf(4,axiom,
is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))),
file('LCL069-1.p',unknown),
[] ).
cnf(5,axiom,
is_a_theorem(implies(implies(not(A),B),implies(implies(C,B),implies(implies(A,C),B)))),
file('LCL069-1.p',unknown),
[] ).
cnf(6,plain,
is_a_theorem(implies(A,implies(B,A))),
inference(hyper,[status(thm)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(21,plain,
is_a_theorem(implies(not(A),implies(B,implies(A,C)))),
inference(hyper,[status(thm)],[4,1,6]),
[iquote('hyper,4,1,6')] ).
cnf(22,plain,
is_a_theorem(implies(not(implies(A,B)),implies(B,C))),
inference(hyper,[status(thm)],[4,1,3]),
[iquote('hyper,4,1,3')] ).
cnf(43,plain,
is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(implies(D,B),A),implies(B,C)))),
inference(hyper,[status(thm)],[5,1,22]),
[iquote('hyper,5,1,22')] ).
cnf(44,plain,
is_a_theorem(implies(implies(A,implies(B,implies(C,D))),implies(implies(C,A),implies(B,implies(C,D))))),
inference(hyper,[status(thm)],[5,1,21]),
[iquote('hyper,5,1,21')] ).
cnf(149,plain,
is_a_theorem(implies(implies(implies(A,B),not(C)),implies(B,implies(C,D)))),
inference(hyper,[status(thm)],[43,1,21]),
[iquote('hyper,43,1,21')] ).
cnf(156,plain,
is_a_theorem(implies(implies(implies(A,B),implies(implies(C,B),D)),implies(B,D))),
inference(hyper,[status(thm)],[43,1,3]),
[iquote('hyper,43,1,3')] ).
cnf(219,plain,
is_a_theorem(implies(not(A),implies(A,B))),
inference(hyper,[status(thm)],[156,1,149]),
[iquote('hyper,156,1,149')] ).
cnf(221,plain,
is_a_theorem(implies(A,A)),
inference(hyper,[status(thm)],[156,1,3]),
[iquote('hyper,156,1,3')] ).
cnf(256,plain,
is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))),
inference(hyper,[status(thm)],[44,1,219]),
[iquote('hyper,44,1,219')] ).
cnf(288,plain,
is_a_theorem(implies(A,implies(not(A),B))),
inference(hyper,[status(thm)],[256,1,221]),
[iquote('hyper,256,1,221')] ).
cnf(289,plain,
$false,
inference(binary,[status(thm)],[288,2]),
[iquote('binary,288.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : LCL069-1 : TPTP v8.1.0. Bugfixed v1.2.0.
% 0.10/0.10 % Command : otter-tptp-script %s
% 0.11/0.31 % Computer : n016.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.31 % CPULimit : 300
% 0.17/0.31 % WCLimit : 300
% 0.17/0.31 % DateTime : Wed Jul 27 09:37:37 EDT 2022
% 0.17/0.31 % CPUTime :
% 1.60/1.81 ----- Otter 3.3f, August 2004 -----
% 1.60/1.81 The process was started by sandbox2 on n016.cluster.edu,
% 1.60/1.81 Wed Jul 27 09:37:37 2022
% 1.60/1.81 The command was "./otter". The process ID is 15169.
% 1.60/1.81
% 1.60/1.81 set(prolog_style_variables).
% 1.60/1.81 set(auto).
% 1.60/1.81 dependent: set(auto1).
% 1.60/1.81 dependent: set(process_input).
% 1.60/1.81 dependent: clear(print_kept).
% 1.60/1.81 dependent: clear(print_new_demod).
% 1.60/1.81 dependent: clear(print_back_demod).
% 1.60/1.81 dependent: clear(print_back_sub).
% 1.60/1.81 dependent: set(control_memory).
% 1.60/1.81 dependent: assign(max_mem, 12000).
% 1.60/1.81 dependent: assign(pick_given_ratio, 4).
% 1.60/1.81 dependent: assign(stats_level, 1).
% 1.60/1.81 dependent: assign(max_seconds, 10800).
% 1.60/1.81 clear(print_given).
% 1.60/1.81
% 1.60/1.81 list(usable).
% 1.60/1.81 0 [] -is_a_theorem(implies(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 1.60/1.81 0 [] is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))).
% 1.60/1.81 0 [] is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(X),Z))).
% 1.60/1.81 0 [] is_a_theorem(implies(implies(not(X),Z),implies(implies(Y,Z),implies(implies(X,Y),Z)))).
% 1.60/1.81 0 [] -is_a_theorem(implies(a,implies(not(a),b))).
% 1.60/1.81 end_of_list.
% 1.60/1.81
% 1.60/1.81 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.60/1.81
% 1.60/1.81 This is a Horn set without equality. The strategy will
% 1.60/1.81 be hyperresolution, with satellites in sos and nuclei
% 1.60/1.81 in usable.
% 1.60/1.81
% 1.60/1.81 dependent: set(hyper_res).
% 1.60/1.81 dependent: clear(order_hyper).
% 1.60/1.81
% 1.60/1.81 ------------> process usable:
% 1.60/1.81 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.60/1.81 ** KEPT (pick-wt=7): 2 [] -is_a_theorem(implies(a,implies(not(a),b))).
% 1.60/1.81
% 1.60/1.81 ------------> process sos:
% 1.60/1.81 ** KEPT (pick-wt=10): 3 [] is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 1.60/1.81 ** KEPT (pick-wt=11): 4 [] is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))).
% 1.60/1.81 ** KEPT (pick-wt=15): 5 [] is_a_theorem(implies(implies(not(A),B),implies(implies(C,B),implies(implies(A,C),B)))).
% 1.60/1.81
% 1.60/1.81 ======= end of input processing =======
% 1.60/1.81
% 1.60/1.81 =========== start of search ===========
% 1.60/1.81
% 1.60/1.81 -------- PROOF --------
% 1.60/1.81
% 1.60/1.81 ----> UNIT CONFLICT at 0.01 sec ----> 289 [binary,288.1,2.1] $F.
% 1.60/1.81
% 1.60/1.81 Length of proof is 11. Level of proof is 6.
% 1.60/1.81
% 1.60/1.81 ---------------- PROOF ----------------
% 1.60/1.81 % SZS status Unsatisfiable
% 1.60/1.81 % SZS output start Refutation
% See solution above
% 1.60/1.81 ------------ end of proof -------------
% 1.60/1.81
% 1.60/1.81
% 1.60/1.81 Search stopped by max_proofs option.
% 1.60/1.81
% 1.60/1.81
% 1.60/1.81 Search stopped by max_proofs option.
% 1.60/1.81
% 1.60/1.81 ============ end of search ============
% 1.60/1.81
% 1.60/1.81 -------------- statistics -------------
% 1.60/1.81 clauses given 68
% 1.60/1.81 clauses generated 3577
% 1.60/1.81 clauses kept 288
% 1.60/1.81 clauses forward subsumed 3294
% 1.60/1.81 clauses back subsumed 1
% 1.60/1.81 Kbytes malloced 976
% 1.60/1.81
% 1.60/1.81 ----------- times (seconds) -----------
% 1.60/1.81 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.60/1.81 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.60/1.81 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.60/1.81
% 1.60/1.81 That finishes the proof of the theorem.
% 1.60/1.81
% 1.60/1.81 Process 15169 finished Wed Jul 27 09:37:39 2022
% 1.60/1.81 Otter interrupted
% 1.60/1.81 PROOF FOUND
%------------------------------------------------------------------------------