TSTP Solution File: LCL128-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL128-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:38 EDT 2022
% Result : Unsatisfiable 2.60s 2.78s
% Output : Refutation 2.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 3
% Syntax : Number of clauses : 28 ( 27 unt; 0 nHn; 3 RR)
% Number of literals : 30 ( 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 : 93 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(e_quivalent(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL128-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('LCL128-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(e_quivalent(A,e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(B,C),e_quivalent(D,C)),e_quivalent(B,D))))),
file('LCL128-1.p',unknown),
[] ).
cnf(4,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(B,C),e_quivalent(D,C)),e_quivalent(B,D)))),e_quivalent(e_quivalent(e_quivalent(E,F),e_quivalent(G,F)),e_quivalent(E,G)))),
inference(hyper,[status(thm)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(6,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(C,B)),e_quivalent(A,C))),
inference(hyper,[status(thm)],[4,1,3]),
[iquote('hyper,4,1,3')] ).
cnf(7,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(C,B)),e_quivalent(A,C)),e_quivalent(e_quivalent(e_quivalent(D,E),e_quivalent(F,E)),e_quivalent(D,F)))),
inference(hyper,[status(thm)],[6,1,3]),
[iquote('hyper,6,1,3')] ).
cnf(28,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)],[7,1,6]),
[iquote('hyper,7,1,6')] ).
cnf(33,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(A,B))),
inference(hyper,[status(thm)],[28,1,6]),
[iquote('hyper,28,1,6')] ).
cnf(39,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(C,D),e_quivalent(E,D)),e_quivalent(C,E))),B))),
inference(hyper,[status(thm)],[28,1,3]),
[iquote('hyper,28,1,3')] ).
cnf(42,plain,
is_a_theorem(e_quivalent(A,A)),
inference(hyper,[status(thm)],[33,1,6]),
[iquote('hyper,33,1,6')] ).
cnf(46,plain,
is_a_theorem(e_quivalent(e_quivalent(A,A),e_quivalent(e_quivalent(e_quivalent(B,C),e_quivalent(D,C)),e_quivalent(B,D)))),
inference(hyper,[status(thm)],[42,1,3]),
[iquote('hyper,42,1,3')] ).
cnf(60,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(A,C),e_quivalent(B,C)))),
inference(hyper,[status(thm)],[46,1,6]),
[iquote('hyper,46,1,6')] ).
cnf(67,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(C,B)),D),e_quivalent(e_quivalent(A,C),D))),
inference(hyper,[status(thm)],[60,1,6]),
[iquote('hyper,60,1,6')] ).
cnf(83,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(e_quivalent(A,D),e_quivalent(C,e_quivalent(D,B))))),
inference(hyper,[status(thm)],[67,1,67]),
[iquote('hyper,67,1,67')] ).
cnf(251,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(B,C),e_quivalent(D,C)),e_quivalent(B,D))),A)),
inference(hyper,[status(thm)],[39,1,42]),
[iquote('hyper,39,1,42')] ).
cnf(264,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(D,C))),e_quivalent(A,e_quivalent(B,D)))),
inference(hyper,[status(thm)],[251,1,67]),
[iquote('hyper,251,1,67')] ).
cnf(272,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(A,e_quivalent(e_quivalent(B,D),e_quivalent(C,D))))),
inference(hyper,[status(thm)],[251,1,39]),
[iquote('hyper,251,1,39')] ).
cnf(294,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,D),e_quivalent(B,D))),e_quivalent(A,C))),
inference(hyper,[status(thm)],[264,1,264]),
[iquote('hyper,264,1,264')] ).
cnf(314,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(D,B)),e_quivalent(A,e_quivalent(D,C)))),
inference(hyper,[status(thm)],[272,1,264]),
[iquote('hyper,272,1,264')] ).
cnf(348,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,B)),A)),
inference(hyper,[status(thm)],[294,1,272]),
[iquote('hyper,294,1,272')] ).
cnf(357,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(A,e_quivalent(B,e_quivalent(C,C))))),
inference(hyper,[status(thm)],[348,1,83]),
[iquote('hyper,348,1,83')] ).
cnf(448,plain,
is_a_theorem(e_quivalent(A,e_quivalent(A,e_quivalent(B,B)))),
inference(hyper,[status(thm)],[357,1,42]),
[iquote('hyper,357,1,42')] ).
cnf(471,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(A,e_quivalent(C,C)),B))),
inference(hyper,[status(thm)],[448,1,60]),
[iquote('hyper,448,1,60')] ).
cnf(880,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,e_quivalent(C,C))),e_quivalent(A,B))),
inference(hyper,[status(thm)],[471,1,264]),
[iquote('hyper,471,1,264')] ).
cnf(1627,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(C,B)),A)),
inference(hyper,[status(thm)],[314,1,880]),
[iquote('hyper,314,1,880')] ).
cnf(1682,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,C)),D),e_quivalent(A,e_quivalent(D,e_quivalent(C,B))))),
inference(hyper,[status(thm)],[1627,1,83]),
[iquote('hyper,1627,1,83')] ).
cnf(7543,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)],[1682,1,251]),
[iquote('hyper,1682,1,251')] ).
cnf(7544,plain,
$false,
inference(binary,[status(thm)],[7543,2]),
[iquote('binary,7543.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : LCL128-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/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:17:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.60/2.78 ----- Otter 3.3f, August 2004 -----
% 2.60/2.78 The process was started by sandbox on n010.cluster.edu,
% 2.60/2.78 Wed Jul 27 09:17:39 2022
% 2.60/2.78 The command was "./otter". The process ID is 5765.
% 2.60/2.78
% 2.60/2.78 set(prolog_style_variables).
% 2.60/2.78 set(auto).
% 2.60/2.78 dependent: set(auto1).
% 2.60/2.78 dependent: set(process_input).
% 2.60/2.78 dependent: clear(print_kept).
% 2.60/2.78 dependent: clear(print_new_demod).
% 2.60/2.78 dependent: clear(print_back_demod).
% 2.60/2.78 dependent: clear(print_back_sub).
% 2.60/2.78 dependent: set(control_memory).
% 2.60/2.78 dependent: assign(max_mem, 12000).
% 2.60/2.78 dependent: assign(pick_given_ratio, 4).
% 2.60/2.78 dependent: assign(stats_level, 1).
% 2.60/2.78 dependent: assign(max_seconds, 10800).
% 2.60/2.78 clear(print_given).
% 2.60/2.78
% 2.60/2.78 list(usable).
% 2.60/2.78 0 [] -is_a_theorem(e_quivalent(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 2.60/2.78 0 [] is_a_theorem(e_quivalent(X,e_quivalent(X,e_quivalent(e_quivalent(e_quivalent(Y,Z),e_quivalent(U,Z)),e_quivalent(Y,U))))).
% 2.60/2.78 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)))))).
% 2.60/2.78 end_of_list.
% 2.60/2.78
% 2.60/2.78 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 2.60/2.78
% 2.60/2.78 This is a Horn set without equality. The strategy will
% 2.60/2.78 be hyperresolution, with satellites in sos and nuclei
% 2.60/2.78 in usable.
% 2.60/2.78
% 2.60/2.78 dependent: set(hyper_res).
% 2.60/2.78 dependent: clear(order_hyper).
% 2.60/2.78
% 2.60/2.78 ------------> process usable:
% 2.60/2.78 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(e_quivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 2.60/2.78 ** 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)))))).
% 2.60/2.78
% 2.60/2.78 ------------> process sos:
% 2.60/2.78 ** KEPT (pick-wt=16): 3 [] is_a_theorem(e_quivalent(A,e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(B,C),e_quivalent(D,C)),e_quivalent(B,D))))).
% 2.60/2.78
% 2.60/2.78 ======= end of input processing =======
% 2.60/2.78
% 2.60/2.78 =========== start of search ===========
% 2.60/2.78
% 2.60/2.78
% 2.60/2.78 Resetting weight limit to 20.
% 2.60/2.78
% 2.60/2.78
% 2.60/2.78 Resetting weight limit to 20.
% 2.60/2.78
% 2.60/2.78 sos_size=5498
% 2.60/2.78
% 2.60/2.78 -------- PROOF --------
% 2.60/2.78
% 2.60/2.78 ----> UNIT CONFLICT at 0.91 sec ----> 7544 [binary,7543.1,2.1] $F.
% 2.60/2.78
% 2.60/2.78 Length of proof is 24. Level of proof is 19.
% 2.60/2.78
% 2.60/2.78 ---------------- PROOF ----------------
% 2.60/2.78 % SZS status Unsatisfiable
% 2.60/2.78 % SZS output start Refutation
% See solution above
% 2.60/2.78 ------------ end of proof -------------
% 2.60/2.78
% 2.60/2.78
% 2.60/2.78 Search stopped by max_proofs option.
% 2.60/2.78
% 2.60/2.78
% 2.60/2.78 Search stopped by max_proofs option.
% 2.60/2.78
% 2.60/2.78 ============ end of search ============
% 2.60/2.78
% 2.60/2.78 -------------- statistics -------------
% 2.60/2.78 clauses given 352
% 2.60/2.78 clauses generated 75673
% 2.60/2.78 clauses kept 7543
% 2.60/2.78 clauses forward subsumed 37863
% 2.60/2.78 clauses back subsumed 6
% 2.60/2.78 Kbytes malloced 4882
% 2.60/2.78
% 2.60/2.78 ----------- times (seconds) -----------
% 2.60/2.78 user CPU time 0.91 (0 hr, 0 min, 0 sec)
% 2.60/2.78 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.60/2.78 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 2.60/2.78
% 2.60/2.78 That finishes the proof of the theorem.
% 2.60/2.78
% 2.60/2.78 Process 5765 finished Wed Jul 27 09:17:42 2022
% 2.60/2.78 Otter interrupted
% 2.60/2.78 PROOF FOUND
%------------------------------------------------------------------------------