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