TSTP Solution File: LCL087-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL087-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n003.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:30 EDT 2022
% Result : Unsatisfiable 1.68s 1.87s
% 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 : 6 ( 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 : 33 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(implies(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL087-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(implies(a,implies(b,a))),
file('LCL087-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(implies(implies(implies(A,B),implies(C,D)),implies(E,implies(implies(D,A),implies(C,A))))),
file('LCL087-1.p',unknown),
[] ).
cnf(4,plain,
is_a_theorem(implies(A,implies(implies(implies(implies(B,C),implies(D,C)),implies(C,E)),implies(F,implies(C,E))))),
inference(hyper,[status(thm)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(5,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)],[4,1,4]),
[iquote('hyper,4,1,4')] ).
cnf(7,plain,
is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(B,C))))),
inference(hyper,[status(thm)],[5,1,5]),
[iquote('hyper,5,1,5')] ).
cnf(10,plain,
is_a_theorem(implies(implies(A,B),implies(B,implies(A,B)))),
inference(hyper,[status(thm)],[7,1,7]),
[iquote('hyper,7,1,7')] ).
cnf(12,plain,
is_a_theorem(implies(A,implies(implies(implies(B,C),B),implies(C,B)))),
inference(hyper,[status(thm)],[10,1,3]),
[iquote('hyper,10,1,3')] ).
cnf(32,plain,
is_a_theorem(implies(implies(implies(A,B),A),implies(B,A))),
inference(hyper,[status(thm)],[12,1,12]),
[iquote('hyper,12,1,12')] ).
cnf(37,plain,
is_a_theorem(implies(A,implies(B,implies(C,B)))),
inference(hyper,[status(thm)],[32,1,5]),
[iquote('hyper,32,1,5')] ).
cnf(52,plain,
is_a_theorem(implies(A,implies(B,A))),
inference(hyper,[status(thm)],[37,1,37]),
[iquote('hyper,37,1,37')] ).
cnf(53,plain,
$false,
inference(binary,[status(thm)],[52,2]),
[iquote('binary,52.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL087-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n003.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:20:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.68/1.87 ----- Otter 3.3f, August 2004 -----
% 1.68/1.87 The process was started by sandbox on n003.cluster.edu,
% 1.68/1.87 Wed Jul 27 09:20:41 2022
% 1.68/1.87 The command was "./otter". The process ID is 1511.
% 1.68/1.87
% 1.68/1.87 set(prolog_style_variables).
% 1.68/1.87 set(auto).
% 1.68/1.87 dependent: set(auto1).
% 1.68/1.87 dependent: set(process_input).
% 1.68/1.87 dependent: clear(print_kept).
% 1.68/1.87 dependent: clear(print_new_demod).
% 1.68/1.87 dependent: clear(print_back_demod).
% 1.68/1.87 dependent: clear(print_back_sub).
% 1.68/1.87 dependent: set(control_memory).
% 1.68/1.87 dependent: assign(max_mem, 12000).
% 1.68/1.87 dependent: assign(pick_given_ratio, 4).
% 1.68/1.87 dependent: assign(stats_level, 1).
% 1.68/1.87 dependent: assign(max_seconds, 10800).
% 1.68/1.87 clear(print_given).
% 1.68/1.87
% 1.68/1.87 list(usable).
% 1.68/1.87 0 [] -is_a_theorem(implies(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 1.68/1.87 0 [] is_a_theorem(implies(implies(implies(P,Q),implies(R,S)),implies(T,implies(implies(S,P),implies(R,P))))).
% 1.68/1.87 0 [] -is_a_theorem(implies(a,implies(b,a))).
% 1.68/1.87 end_of_list.
% 1.68/1.87
% 1.68/1.87 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.68/1.87
% 1.68/1.87 This is a Horn set without equality. The strategy will
% 1.68/1.87 be hyperresolution, with satellites in sos and nuclei
% 1.68/1.87 in usable.
% 1.68/1.87
% 1.68/1.87 dependent: set(hyper_res).
% 1.68/1.87 dependent: clear(order_hyper).
% 1.68/1.87
% 1.68/1.87 ------------> process usable:
% 1.68/1.87 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.68/1.87 ** KEPT (pick-wt=6): 2 [] -is_a_theorem(implies(a,implies(b,a))).
% 1.68/1.87
% 1.68/1.87 ------------> process sos:
% 1.68/1.87 ** KEPT (pick-wt=18): 3 [] is_a_theorem(implies(implies(implies(A,B),implies(C,D)),implies(E,implies(implies(D,A),implies(C,A))))).
% 1.68/1.87
% 1.68/1.87 ======= end of input processing =======
% 1.68/1.87
% 1.68/1.87 =========== start of search ===========
% 1.68/1.87
% 1.68/1.87 -------- PROOF --------
% 1.68/1.87
% 1.68/1.87 ----> UNIT CONFLICT at 0.00 sec ----> 53 [binary,52.1,2.1] $F.
% 1.68/1.87
% 1.68/1.87 Length of proof is 8. Level of proof is 8.
% 1.68/1.87
% 1.68/1.87 ---------------- PROOF ----------------
% 1.68/1.87 % SZS status Unsatisfiable
% 1.68/1.87 % SZS output start Refutation
% See solution above
% 1.68/1.87 ------------ end of proof -------------
% 1.68/1.87
% 1.68/1.87
% 1.68/1.87 Search stopped by max_proofs option.
% 1.68/1.87
% 1.68/1.87
% 1.68/1.87 Search stopped by max_proofs option.
% 1.68/1.87
% 1.68/1.87 ============ end of search ============
% 1.68/1.87
% 1.68/1.87 -------------- statistics -------------
% 1.68/1.87 clauses given 13
% 1.68/1.87 clauses generated 143
% 1.68/1.87 clauses kept 52
% 1.68/1.87 clauses forward subsumed 94
% 1.68/1.87 clauses back subsumed 2
% 1.68/1.87 Kbytes malloced 976
% 1.68/1.87
% 1.68/1.87 ----------- times (seconds) -----------
% 1.68/1.87 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/1.87 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/1.87 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.68/1.87
% 1.68/1.87 That finishes the proof of the theorem.
% 1.68/1.87
% 1.68/1.87 Process 1511 finished Wed Jul 27 09:20:43 2022
% 1.68/1.87 Otter interrupted
% 1.68/1.87 PROOF FOUND
%------------------------------------------------------------------------------