TSTP Solution File: LCL131-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL131-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n005.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 2.64s 2.82s
% Output : Refutation 2.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of clauses : 23 ( 22 unt; 0 nHn; 3 RR)
% Number of literals : 25 ( 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 : 79 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(e_quivalent(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL131-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('LCL131-1.p',unknown),
[] ).
cnf(3,axiom,
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)),
file('LCL131-1.p',unknown),
[] ).
cnf(4,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)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(5,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(6,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)],[5,1,3]),
[iquote('hyper,5,1,3')] ).
cnf(7,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)],[5,1,4]),
[iquote('hyper,5,1,4')] ).
cnf(9,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(e_quivalent(D,B),C)),e_quivalent(A,D))),
inference(hyper,[status(thm)],[6,1,3]),
[iquote('hyper,6,1,3')] ).
cnf(10,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(A,B))),
inference(hyper,[status(thm)],[6,1,5]),
[iquote('hyper,6,1,5')] ).
cnf(11,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)],[6,1,3]),
[iquote('hyper,6,1,3')] ).
cnf(12,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(A,C),e_quivalent(B,C)))),
inference(hyper,[status(thm)],[10,1,6]),
[iquote('hyper,10,1,6')] ).
cnf(15,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(B,C),e_quivalent(D,C)),e_quivalent(B,D))),E),e_quivalent(A,E))),
inference(hyper,[status(thm)],[7,1,3]),
[iquote('hyper,7,1,3')] ).
cnf(16,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)],[12,1,12]),
[iquote('hyper,12,1,12')] ).
cnf(33,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(e_quivalent(A,e_quivalent(D,C)),e_quivalent(B,D)))),
inference(hyper,[status(thm)],[11,1,6]),
[iquote('hyper,11,1,6')] ).
cnf(36,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(C,B)),e_quivalent(e_quivalent(e_quivalent(D,E),e_quivalent(F,E)),e_quivalent(D,F))),e_quivalent(A,C))),
inference(hyper,[status(thm)],[11,1,3]),
[iquote('hyper,11,1,3')] ).
cnf(39,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(C,e_quivalent(B,D))),e_quivalent(e_quivalent(A,D),C))),
inference(hyper,[status(thm)],[16,1,11]),
[iquote('hyper,16,1,11')] ).
cnf(113,plain,
is_a_theorem(e_quivalent(A,e_quivalent(A,e_quivalent(B,B)))),
inference(hyper,[status(thm)],[33,1,9]),
[iquote('hyper,33,1,9')] ).
cnf(126,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,e_quivalent(C,C))),e_quivalent(A,B))),
inference(hyper,[status(thm)],[113,1,33]),
[iquote('hyper,113,1,33')] ).
cnf(173,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)],[15,1,9]),
[iquote('hyper,15,1,9')] ).
cnf(1935,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(C,B)),A)),
inference(hyper,[status(thm)],[173,1,126]),
[iquote('hyper,173,1,126')] ).
cnf(1973,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,C),D)),e_quivalent(C,B)),D),A)),
inference(hyper,[status(thm)],[1935,1,39]),
[iquote('hyper,1935,1,39')] ).
cnf(8462,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)],[1973,1,36]),
[iquote('hyper,1973,1,36')] ).
cnf(8463,plain,
$false,
inference(binary,[status(thm)],[8462,2]),
[iquote('binary,8462.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL131-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n005.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 09:19:35 EDT 2022
% 0.13/0.33 % CPUTime :
% 2.64/2.82 ----- Otter 3.3f, August 2004 -----
% 2.64/2.82 The process was started by sandbox on n005.cluster.edu,
% 2.64/2.82 Wed Jul 27 09:19:35 2022
% 2.64/2.82 The command was "./otter". The process ID is 8870.
% 2.64/2.82
% 2.64/2.82 set(prolog_style_variables).
% 2.64/2.82 set(auto).
% 2.64/2.82 dependent: set(auto1).
% 2.64/2.82 dependent: set(process_input).
% 2.64/2.82 dependent: clear(print_kept).
% 2.64/2.82 dependent: clear(print_new_demod).
% 2.64/2.82 dependent: clear(print_back_demod).
% 2.64/2.82 dependent: clear(print_back_sub).
% 2.64/2.82 dependent: set(control_memory).
% 2.64/2.82 dependent: assign(max_mem, 12000).
% 2.64/2.82 dependent: assign(pick_given_ratio, 4).
% 2.64/2.82 dependent: assign(stats_level, 1).
% 2.64/2.82 dependent: assign(max_seconds, 10800).
% 2.64/2.82 clear(print_given).
% 2.64/2.82
% 2.64/2.82 list(usable).
% 2.64/2.82 0 [] -is_a_theorem(e_quivalent(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 2.64/2.82 0 [] is_a_theorem(e_quivalent(e_quivalent(X,e_quivalent(e_quivalent(e_quivalent(Y,Z),e_quivalent(U,Z)),e_quivalent(Y,U))),X)).
% 2.64/2.82 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.64/2.82 end_of_list.
% 2.64/2.82
% 2.64/2.82 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 2.64/2.82
% 2.64/2.82 This is a Horn set without equality. The strategy will
% 2.64/2.82 be hyperresolution, with satellites in sos and nuclei
% 2.64/2.82 in usable.
% 2.64/2.82
% 2.64/2.82 dependent: set(hyper_res).
% 2.64/2.82 dependent: clear(order_hyper).
% 2.64/2.82
% 2.64/2.82 ------------> process usable:
% 2.64/2.82 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(e_quivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 2.64/2.82 ** 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.64/2.82
% 2.64/2.82 ------------> process sos:
% 2.64/2.82 ** KEPT (pick-wt=16): 3 [] 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)).
% 2.64/2.82
% 2.64/2.82 ======= end of input processing =======
% 2.64/2.82
% 2.64/2.82 =========== start of search ===========
% 2.64/2.82
% 2.64/2.82
% 2.64/2.82 Resetting weight limit to 20.
% 2.64/2.82
% 2.64/2.82
% 2.64/2.82 Resetting weight limit to 20.
% 2.64/2.82
% 2.64/2.82 sos_size=6257
% 2.64/2.82
% 2.64/2.82 -------- PROOF --------
% 2.64/2.82
% 2.64/2.82 ----> UNIT CONFLICT at 0.96 sec ----> 8463 [binary,8462.1,2.1] $F.
% 2.64/2.82
% 2.64/2.82 Length of proof is 19. Level of proof is 10.
% 2.64/2.82
% 2.64/2.82 ---------------- PROOF ----------------
% 2.64/2.82 % SZS status Unsatisfiable
% 2.64/2.82 % SZS output start Refutation
% See solution above
% 2.64/2.82 ------------ end of proof -------------
% 2.64/2.82
% 2.64/2.82
% 2.64/2.82 Search stopped by max_proofs option.
% 2.64/2.82
% 2.64/2.82
% 2.64/2.82 Search stopped by max_proofs option.
% 2.64/2.82
% 2.64/2.82 ============ end of search ============
% 2.64/2.82
% 2.64/2.82 -------------- statistics -------------
% 2.64/2.82 clauses given 355
% 2.64/2.82 clauses generated 87913
% 2.64/2.82 clauses kept 8462
% 2.64/2.82 clauses forward subsumed 43850
% 2.64/2.82 clauses back subsumed 3
% 2.64/2.82 Kbytes malloced 5859
% 2.64/2.82
% 2.64/2.82 ----------- times (seconds) -----------
% 2.64/2.82 user CPU time 0.96 (0 hr, 0 min, 0 sec)
% 2.64/2.82 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.64/2.82 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 2.64/2.82
% 2.64/2.82 That finishes the proof of the theorem.
% 2.64/2.82
% 2.64/2.82 Process 8870 finished Wed Jul 27 09:19:38 2022
% 2.64/2.82 Otter interrupted
% 2.64/2.83 PROOF FOUND
%------------------------------------------------------------------------------