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