TSTP Solution File: LCL036-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL036-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n018.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.66s 1.88s
% Output : Refutation 1.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% Syntax : Number of clauses : 22 ( 21 unt; 0 nHn; 3 RR)
% Number of literals : 24 ( 0 equ; 3 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 65 ( 37 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(implies(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL036-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(implies(implies(implies(a,falsehood),falsehood),a)),
file('LCL036-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(implies(implies(implies(implies(implies(A,B),implies(C,falsehood)),D),E),implies(implies(E,A),implies(C,A)))),
file('LCL036-1.p',unknown),
[] ).
cnf(4,plain,
is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),implies(B,D)),implies(E,implies(B,D)))),
inference(hyper,[status(thm)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(6,plain,
is_a_theorem(implies(implies(implies(A,implies(falsehood,B)),C),implies(D,C))),
inference(hyper,[status(thm)],[4,1,3]),
[iquote('hyper,4,1,3')] ).
cnf(14,plain,
is_a_theorem(implies(A,implies(B,implies(falsehood,C)))),
inference(hyper,[status(thm)],[6,1,6]),
[iquote('hyper,6,1,6')] ).
cnf(23,plain,
is_a_theorem(implies(A,implies(falsehood,B))),
inference(hyper,[status(thm)],[14,1,14]),
[iquote('hyper,14,1,14')] ).
cnf(26,plain,
is_a_theorem(implies(implies(implies(falsehood,A),B),implies(C,B))),
inference(hyper,[status(thm)],[23,1,3]),
[iquote('hyper,23,1,3')] ).
cnf(28,plain,
is_a_theorem(implies(A,implies(B,implies(C,B)))),
inference(hyper,[status(thm)],[26,1,4]),
[iquote('hyper,26,1,4')] ).
cnf(29,plain,
is_a_theorem(implies(A,implies(B,A))),
inference(hyper,[status(thm)],[28,1,28]),
[iquote('hyper,28,1,28')] ).
cnf(33,plain,
is_a_theorem(implies(implies(implies(A,implies(implies(implies(B,C),implies(D,falsehood)),E)),B),implies(D,B))),
inference(hyper,[status(thm)],[29,1,3]),
[iquote('hyper,29,1,3')] ).
cnf(62,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(B,D),implies(A,falsehood)),C))),
inference(hyper,[status(thm)],[33,1,3]),
[iquote('hyper,33,1,3')] ).
cnf(122,plain,
is_a_theorem(implies(implies(implies(A,B),implies(C,falsehood)),implies(D,implies(C,A)))),
inference(hyper,[status(thm)],[62,1,29]),
[iquote('hyper,62,1,29')] ).
cnf(123,plain,
is_a_theorem(implies(implies(implies(A,B),implies(implies(falsehood,C),falsehood)),implies(D,A))),
inference(hyper,[status(thm)],[62,1,26]),
[iquote('hyper,62,1,26')] ).
cnf(134,plain,
is_a_theorem(implies(implies(implies(A,implies(B,C)),B),implies(D,B))),
inference(hyper,[status(thm)],[123,1,3]),
[iquote('hyper,123,1,3')] ).
cnf(139,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))),
inference(hyper,[status(thm)],[134,1,3]),
[iquote('hyper,134,1,3')] ).
cnf(149,plain,
is_a_theorem(implies(implies(implies(implies(A,falsehood),B),C),implies(A,C))),
inference(hyper,[status(thm)],[139,1,3]),
[iquote('hyper,139,1,3')] ).
cnf(255,plain,
is_a_theorem(implies(implies(A,falsehood),implies(A,B))),
inference(hyper,[status(thm)],[149,1,149]),
[iquote('hyper,149,1,149')] ).
cnf(270,plain,
is_a_theorem(implies(A,implies(implies(A,falsehood),B))),
inference(hyper,[status(thm)],[255,1,149]),
[iquote('hyper,255,1,149')] ).
cnf(294,plain,
is_a_theorem(implies(A,implies(implies(implies(B,C),falsehood),B))),
inference(hyper,[status(thm)],[270,1,122]),
[iquote('hyper,270,1,122')] ).
cnf(511,plain,
is_a_theorem(implies(implies(implies(A,B),falsehood),A)),
inference(hyper,[status(thm)],[294,1,294]),
[iquote('hyper,294,1,294')] ).
cnf(512,plain,
$false,
inference(binary,[status(thm)],[511,2]),
[iquote('binary,511.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL036-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n018.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:29:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.66/1.88 ----- Otter 3.3f, August 2004 -----
% 1.66/1.88 The process was started by sandbox2 on n018.cluster.edu,
% 1.66/1.88 Wed Jul 27 09:29:01 2022
% 1.66/1.88 The command was "./otter". The process ID is 13212.
% 1.66/1.88
% 1.66/1.88 set(prolog_style_variables).
% 1.66/1.88 set(auto).
% 1.66/1.88 dependent: set(auto1).
% 1.66/1.88 dependent: set(process_input).
% 1.66/1.88 dependent: clear(print_kept).
% 1.66/1.88 dependent: clear(print_new_demod).
% 1.66/1.88 dependent: clear(print_back_demod).
% 1.66/1.88 dependent: clear(print_back_sub).
% 1.66/1.88 dependent: set(control_memory).
% 1.66/1.88 dependent: assign(max_mem, 12000).
% 1.66/1.88 dependent: assign(pick_given_ratio, 4).
% 1.66/1.88 dependent: assign(stats_level, 1).
% 1.66/1.88 dependent: assign(max_seconds, 10800).
% 1.66/1.88 clear(print_given).
% 1.66/1.88
% 1.66/1.88 list(usable).
% 1.66/1.88 0 [] -is_a_theorem(implies(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 1.66/1.88 0 [] is_a_theorem(implies(implies(implies(implies(implies(X,Y),implies(Z,falsehood)),U),V),implies(implies(V,X),implies(Z,X)))).
% 1.66/1.88 0 [] -is_a_theorem(implies(implies(implies(a,falsehood),falsehood),a)).
% 1.66/1.88 end_of_list.
% 1.66/1.88
% 1.66/1.88 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.66/1.88
% 1.66/1.88 This is a Horn set without equality. The strategy will
% 1.66/1.88 be hyperresolution, with satellites in sos and nuclei
% 1.66/1.88 in usable.
% 1.66/1.88
% 1.66/1.88 dependent: set(hyper_res).
% 1.66/1.88 dependent: clear(order_hyper).
% 1.66/1.88
% 1.66/1.88 ------------> process usable:
% 1.66/1.88 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.66/1.88 ** KEPT (pick-wt=8): 2 [] -is_a_theorem(implies(implies(implies(a,falsehood),falsehood),a)).
% 1.66/1.88
% 1.66/1.88 ------------> process sos:
% 1.66/1.88 ** KEPT (pick-wt=20): 3 [] is_a_theorem(implies(implies(implies(implies(implies(A,B),implies(C,falsehood)),D),E),implies(implies(E,A),implies(C,A)))).
% 1.66/1.88
% 1.66/1.88 ======= end of input processing =======
% 1.66/1.88
% 1.66/1.88 =========== start of search ===========
% 1.66/1.88
% 1.66/1.88 -------- PROOF --------
% 1.66/1.88
% 1.66/1.88 ----> UNIT CONFLICT at 0.02 sec ----> 512 [binary,511.1,2.1] $F.
% 1.66/1.88
% 1.66/1.88 Length of proof is 18. Level of proof is 17.
% 1.66/1.88
% 1.66/1.88 ---------------- PROOF ----------------
% 1.66/1.88 % SZS status Unsatisfiable
% 1.66/1.88 % SZS output start Refutation
% See solution above
% 1.66/1.88 ------------ end of proof -------------
% 1.66/1.88
% 1.66/1.88
% 1.66/1.88 Search stopped by max_proofs option.
% 1.66/1.88
% 1.66/1.88
% 1.66/1.88 Search stopped by max_proofs option.
% 1.66/1.88
% 1.66/1.88 ============ end of search ============
% 1.66/1.88
% 1.66/1.88 -------------- statistics -------------
% 1.66/1.88 clauses given 72
% 1.66/1.89 clauses generated 3591
% 1.66/1.89 clauses kept 511
% 1.66/1.89 clauses forward subsumed 3083
% 1.66/1.89 clauses back subsumed 70
% 1.66/1.89 Kbytes malloced 1953
% 1.66/1.89
% 1.66/1.89 ----------- times (seconds) -----------
% 1.66/1.89 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 1.66/1.89 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.66/1.89 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.66/1.89
% 1.66/1.89 That finishes the proof of the theorem.
% 1.66/1.89
% 1.66/1.89 Process 13212 finished Wed Jul 27 09:29:03 2022
% 1.66/1.89 Otter interrupted
% 1.66/1.89 PROOF FOUND
%------------------------------------------------------------------------------