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