TSTP Solution File: LCL130-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL130-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n024.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:39 EDT 2022
% Result : Unsatisfiable 1.77s 1.95s
% Output : Refutation 1.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of clauses : 13 ( 12 unt; 0 nHn; 3 RR)
% Number of literals : 15 ( 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(e_quivalent(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL130-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(e_quivalent(a,e_quivalent(a,e_quivalent(e_quivalent(b,c),e_quivalent(e_quivalent(b,e),e_quivalent(c,e)))))),
file('LCL130-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(e_quivalent(B,D),e_quivalent(C,D)))),A)),
file('LCL130-1.p',unknown),
[] ).
cnf(4,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(A,C),e_quivalent(B,C))),e_quivalent(e_quivalent(D,E),e_quivalent(e_quivalent(D,F),e_quivalent(E,F))))),
inference(hyper,[status(thm)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(5,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(A,C),e_quivalent(B,C)))),
inference(hyper,[status(thm)],[4,1,3]),
[iquote('hyper,4,1,3')] ).
cnf(6,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(e_quivalent(e_quivalent(A,D),e_quivalent(B,D)),C))),
inference(hyper,[status(thm)],[5,1,5]),
[iquote('hyper,5,1,5')] ).
cnf(8,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(e_quivalent(B,D),e_quivalent(C,D)))),E),e_quivalent(A,E))),
inference(hyper,[status(thm)],[5,1,3]),
[iquote('hyper,5,1,3')] ).
cnf(12,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(C,B)),e_quivalent(e_quivalent(A,D),e_quivalent(C,D)))),
inference(hyper,[status(thm)],[6,1,5]),
[iquote('hyper,6,1,5')] ).
cnf(27,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(e_quivalent(A,B),C))),
inference(hyper,[status(thm)],[12,1,12]),
[iquote('hyper,12,1,12')] ).
cnf(31,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(D,C)),e_quivalent(e_quivalent(A,B),D))),
inference(hyper,[status(thm)],[27,1,6]),
[iquote('hyper,27,1,6')] ).
cnf(35,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(A,B))),
inference(hyper,[status(thm)],[31,1,27]),
[iquote('hyper,31,1,27')] ).
cnf(42,plain,
is_a_theorem(e_quivalent(A,e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(e_quivalent(B,D),e_quivalent(C,D)))))),
inference(hyper,[status(thm)],[8,1,35]),
[iquote('hyper,8,1,35')] ).
cnf(43,plain,
$false,
inference(binary,[status(thm)],[42,2]),
[iquote('binary,42.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL130-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 09:27:40 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.77/1.95 ----- Otter 3.3f, August 2004 -----
% 1.77/1.95 The process was started by sandbox on n024.cluster.edu,
% 1.77/1.95 Wed Jul 27 09:27:40 2022
% 1.77/1.95 The command was "./otter". The process ID is 9376.
% 1.77/1.95
% 1.77/1.95 set(prolog_style_variables).
% 1.77/1.95 set(auto).
% 1.77/1.95 dependent: set(auto1).
% 1.77/1.95 dependent: set(process_input).
% 1.77/1.95 dependent: clear(print_kept).
% 1.77/1.95 dependent: clear(print_new_demod).
% 1.77/1.95 dependent: clear(print_back_demod).
% 1.77/1.95 dependent: clear(print_back_sub).
% 1.77/1.95 dependent: set(control_memory).
% 1.77/1.95 dependent: assign(max_mem, 12000).
% 1.77/1.95 dependent: assign(pick_given_ratio, 4).
% 1.77/1.95 dependent: assign(stats_level, 1).
% 1.77/1.95 dependent: assign(max_seconds, 10800).
% 1.77/1.95 clear(print_given).
% 1.77/1.95
% 1.77/1.95 list(usable).
% 1.77/1.95 0 [] -is_a_theorem(e_quivalent(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 1.77/1.95 0 [] is_a_theorem(e_quivalent(e_quivalent(X,e_quivalent(e_quivalent(Y,Z),e_quivalent(e_quivalent(Y,U),e_quivalent(Z,U)))),X)).
% 1.77/1.95 0 [] -is_a_theorem(e_quivalent(a,e_quivalent(a,e_quivalent(e_quivalent(b,c),e_quivalent(e_quivalent(b,e),e_quivalent(c,e)))))).
% 1.77/1.95 end_of_list.
% 1.77/1.95
% 1.77/1.95 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.77/1.95
% 1.77/1.95 This is a Horn set without equality. The strategy will
% 1.77/1.95 be hyperresolution, with satellites in sos and nuclei
% 1.77/1.95 in usable.
% 1.77/1.95
% 1.77/1.95 dependent: set(hyper_res).
% 1.77/1.95 dependent: clear(order_hyper).
% 1.77/1.95
% 1.77/1.95 ------------> process usable:
% 1.77/1.95 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(e_quivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.77/1.95 ** KEPT (pick-wt=16): 2 [] -is_a_theorem(e_quivalent(a,e_quivalent(a,e_quivalent(e_quivalent(b,c),e_quivalent(e_quivalent(b,e),e_quivalent(c,e)))))).
% 1.77/1.95
% 1.77/1.95 ------------> process sos:
% 1.77/1.95 ** KEPT (pick-wt=16): 3 [] is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(e_quivalent(B,D),e_quivalent(C,D)))),A)).
% 1.77/1.95
% 1.77/1.95 ======= end of input processing =======
% 1.77/1.95
% 1.77/1.95 =========== start of search ===========
% 1.77/1.95
% 1.77/1.95 -------- PROOF --------
% 1.77/1.95
% 1.77/1.95 ----> UNIT CONFLICT at 0.00 sec ----> 43 [binary,42.1,2.1] $F.
% 1.77/1.95
% 1.77/1.95 Length of proof is 9. Level of proof is 8.
% 1.77/1.95
% 1.77/1.95 ---------------- PROOF ----------------
% 1.77/1.95 % SZS status Unsatisfiable
% 1.77/1.95 % SZS output start Refutation
% See solution above
% 1.77/1.95 ------------ end of proof -------------
% 1.77/1.95
% 1.77/1.95
% 1.77/1.95 Search stopped by max_proofs option.
% 1.77/1.95
% 1.77/1.95
% 1.77/1.95 Search stopped by max_proofs option.
% 1.77/1.95
% 1.77/1.95 ============ end of search ============
% 1.77/1.95
% 1.77/1.95 -------------- statistics -------------
% 1.77/1.95 clauses given 11
% 1.77/1.95 clauses generated 94
% 1.77/1.95 clauses kept 42
% 1.77/1.95 clauses forward subsumed 55
% 1.77/1.95 clauses back subsumed 2
% 1.77/1.95 Kbytes malloced 976
% 1.77/1.95
% 1.77/1.95 ----------- times (seconds) -----------
% 1.77/1.95 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.77/1.95 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.77/1.95 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.77/1.95
% 1.77/1.95 That finishes the proof of the theorem.
% 1.77/1.95
% 1.77/1.95 Process 9376 finished Wed Jul 27 09:27:41 2022
% 1.77/1.95 Otter interrupted
% 1.77/1.95 PROOF FOUND
%------------------------------------------------------------------------------