TSTP Solution File: LCL118-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL118-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n015.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:37 EDT 2022
% Result : Unsatisfiable 2.00s 2.21s
% Output : Refutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of clauses : 18 ( 17 unt; 0 nHn; 3 RR)
% Number of literals : 20 ( 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; 3 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(e_quivalent(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL118-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(e_quivalent(e_quivalent(a,b),e_quivalent(e_quivalent(c,b),e_quivalent(c,a)))),
file('LCL118-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(C,e_quivalent(B,A)))),
file('LCL118-1.p',unknown),
[] ).
cnf(4,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(C,e_quivalent(B,e_quivalent(A,C))))),
inference(hyper,[status(thm)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(5,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,e_quivalent(C,e_quivalent(D,B))),e_quivalent(e_quivalent(D,C),A)))),
inference(hyper,[status(thm)],[4,1,4]),
[iquote('hyper,4,1,4')] ).
cnf(6,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,e_quivalent(C,D)),e_quivalent(e_quivalent(D,e_quivalent(C,B)),A)))),
inference(hyper,[status(thm)],[4,1,3]),
[iquote('hyper,4,1,3')] ).
cnf(9,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(e_quivalent(D,e_quivalent(B,e_quivalent(A,D))),C))),
inference(hyper,[status(thm)],[5,1,3]),
[iquote('hyper,5,1,3')] ).
cnf(15,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,C)),D),e_quivalent(e_quivalent(C,e_quivalent(B,A)),D))),
inference(hyper,[status(thm)],[6,1,3]),
[iquote('hyper,6,1,3')] ).
cnf(17,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(e_quivalent(C,e_quivalent(B,A)),e_quivalent(e_quivalent(D,E),e_quivalent(F,e_quivalent(E,e_quivalent(D,F))))))),
inference(hyper,[status(thm)],[6,1,4]),
[iquote('hyper,6,1,4')] ).
cnf(25,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,e_quivalent(C,A))),e_quivalent(D,e_quivalent(B,e_quivalent(C,D))))),
inference(hyper,[status(thm)],[9,1,4]),
[iquote('hyper,9,1,4')] ).
cnf(46,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(A,e_quivalent(B,C)))),
inference(hyper,[status(thm)],[15,1,3]),
[iquote('hyper,15,1,3')] ).
cnf(51,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(C,e_quivalent(C,e_quivalent(A,B))))),
inference(hyper,[status(thm)],[46,1,3]),
[iquote('hyper,46,1,3')] ).
cnf(75,plain,
is_a_theorem(e_quivalent(A,e_quivalent(B,e_quivalent(B,A)))),
inference(hyper,[status(thm)],[25,1,51]),
[iquote('hyper,25,1,51')] ).
cnf(99,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(A,B))),
inference(hyper,[status(thm)],[75,1,3]),
[iquote('hyper,75,1,3')] ).
cnf(102,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,e_quivalent(C,A))),e_quivalent(C,B))),
inference(hyper,[status(thm)],[99,1,9]),
[iquote('hyper,99,1,9')] ).
cnf(902,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(A,C),e_quivalent(B,C)))),
inference(hyper,[status(thm)],[17,1,102]),
[iquote('hyper,17,1,102')] ).
cnf(2152,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,B),e_quivalent(C,A)))),
inference(hyper,[status(thm)],[902,1,3]),
[iquote('hyper,902,1,3')] ).
cnf(2153,plain,
$false,
inference(binary,[status(thm)],[2152,2]),
[iquote('binary,2152.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL118-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n015.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:29:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.00/2.21 ----- Otter 3.3f, August 2004 -----
% 2.00/2.21 The process was started by sandbox on n015.cluster.edu,
% 2.00/2.21 Wed Jul 27 09:29:27 2022
% 2.00/2.21 The command was "./otter". The process ID is 29891.
% 2.00/2.21
% 2.00/2.21 set(prolog_style_variables).
% 2.00/2.21 set(auto).
% 2.00/2.21 dependent: set(auto1).
% 2.00/2.21 dependent: set(process_input).
% 2.00/2.21 dependent: clear(print_kept).
% 2.00/2.21 dependent: clear(print_new_demod).
% 2.00/2.21 dependent: clear(print_back_demod).
% 2.00/2.21 dependent: clear(print_back_sub).
% 2.00/2.21 dependent: set(control_memory).
% 2.00/2.21 dependent: assign(max_mem, 12000).
% 2.00/2.21 dependent: assign(pick_given_ratio, 4).
% 2.00/2.21 dependent: assign(stats_level, 1).
% 2.00/2.21 dependent: assign(max_seconds, 10800).
% 2.00/2.21 clear(print_given).
% 2.00/2.21
% 2.00/2.21 list(usable).
% 2.00/2.21 0 [] -is_a_theorem(e_quivalent(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 2.00/2.21 0 [] is_a_theorem(e_quivalent(e_quivalent(X,e_quivalent(Y,Z)),e_quivalent(Z,e_quivalent(Y,X)))).
% 2.00/2.21 0 [] -is_a_theorem(e_quivalent(e_quivalent(a,b),e_quivalent(e_quivalent(c,b),e_quivalent(c,a)))).
% 2.00/2.21 end_of_list.
% 2.00/2.21
% 2.00/2.21 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 2.00/2.21
% 2.00/2.21 This is a Horn set without equality. The strategy will
% 2.00/2.21 be hyperresolution, with satellites in sos and nuclei
% 2.00/2.21 in usable.
% 2.00/2.21
% 2.00/2.21 dependent: set(hyper_res).
% 2.00/2.21 dependent: clear(order_hyper).
% 2.00/2.21
% 2.00/2.21 ------------> process usable:
% 2.00/2.21 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(e_quivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 2.00/2.21 ** KEPT (pick-wt=12): 2 [] -is_a_theorem(e_quivalent(e_quivalent(a,b),e_quivalent(e_quivalent(c,b),e_quivalent(c,a)))).
% 2.00/2.21
% 2.00/2.21 ------------> process sos:
% 2.00/2.21 ** KEPT (pick-wt=12): 3 [] is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(C,e_quivalent(B,A)))).
% 2.00/2.21
% 2.00/2.21 ======= end of input processing =======
% 2.00/2.21
% 2.00/2.21 =========== start of search ===========
% 2.00/2.21
% 2.00/2.21 -------- PROOF --------
% 2.00/2.21
% 2.00/2.21 ----> UNIT CONFLICT at 0.11 sec ----> 2153 [binary,2152.1,2.1] $F.
% 2.00/2.21
% 2.00/2.21 Length of proof is 14. Level of proof is 10.
% 2.00/2.21
% 2.00/2.21 ---------------- PROOF ----------------
% 2.00/2.21 % SZS status Unsatisfiable
% 2.00/2.21 % SZS output start Refutation
% See solution above
% 2.00/2.21 ------------ end of proof -------------
% 2.00/2.21
% 2.00/2.21
% 2.00/2.21 Search stopped by max_proofs option.
% 2.00/2.21
% 2.00/2.21
% 2.00/2.21 Search stopped by max_proofs option.
% 2.00/2.21
% 2.00/2.21 ============ end of search ============
% 2.00/2.21
% 2.00/2.21 -------------- statistics -------------
% 2.00/2.21 clauses given 70
% 2.00/2.21 clauses generated 3416
% 2.00/2.21 clauses kept 2152
% 2.00/2.21 clauses forward subsumed 1267
% 2.00/2.21 clauses back subsumed 48
% 2.00/2.21 Kbytes malloced 1953
% 2.00/2.21
% 2.00/2.21 ----------- times (seconds) -----------
% 2.00/2.21 user CPU time 0.11 (0 hr, 0 min, 0 sec)
% 2.00/2.21 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.00/2.21 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 2.00/2.21
% 2.00/2.21 That finishes the proof of the theorem.
% 2.00/2.21
% 2.00/2.21 Process 29891 finished Wed Jul 27 09:29:28 2022
% 2.00/2.21 Otter interrupted
% 2.00/2.21 PROOF FOUND
%------------------------------------------------------------------------------