TSTP Solution File: LCL101-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL101-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:32 EDT 2022
% Result : Unsatisfiable 1.87s 2.07s
% Output : Refutation 1.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of clauses : 15 ( 14 unt; 0 nHn; 3 RR)
% Number of literals : 17 ( 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 : 50 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(e_quivalent(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL101-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(e_quivalent(e_quivalent(e_quivalent(a,b),c),e_quivalent(e_quivalent(e,b),e_quivalent(e_quivalent(a,e),c)))),
file('LCL101-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(A,C)),e_quivalent(B,C)),D),D)),
file('LCL101-1.p',unknown),
[] ).
cnf(4,axiom,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(e_quivalent(B,C),e_quivalent(B,D)),e_quivalent(C,D)),A))),
file('LCL101-1.p',unknown),
[] ).
cnf(5,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(A,C)),e_quivalent(B,C)),e_quivalent(D,e_quivalent(e_quivalent(e_quivalent(e_quivalent(E,F),e_quivalent(E,G)),e_quivalent(F,G)),D)))),
inference(hyper,[status(thm)],[4,1,4]),
[iquote('hyper,4,1,4')] ).
cnf(6,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(A,C)),e_quivalent(B,C)),e_quivalent(e_quivalent(e_quivalent(D,E),e_quivalent(D,F)),e_quivalent(E,F)))),
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),e_quivalent(A,C)),e_quivalent(B,C))),
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)],[9,1,6]),
[iquote('hyper,9,1,6')] ).
cnf(11,plain,
is_a_theorem(e_quivalent(A,A)),
inference(hyper,[status(thm)],[10,1,9]),
[iquote('hyper,10,1,9')] ).
cnf(13,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(e_quivalent(e_quivalent(C,D),e_quivalent(C,E)),e_quivalent(D,E)),e_quivalent(e_quivalent(F,A),e_quivalent(F,B))))),
inference(hyper,[status(thm)],[5,1,9]),
[iquote('hyper,5,1,9')] ).
cnf(15,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(A,C)),e_quivalent(B,C)),e_quivalent(D,D))),
inference(hyper,[status(thm)],[11,1,4]),
[iquote('hyper,11,1,4')] ).
cnf(16,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,A),e_quivalent(C,B)))),
inference(hyper,[status(thm)],[15,1,9]),
[iquote('hyper,15,1,9')] ).
cnf(20,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(B,D))),e_quivalent(A,e_quivalent(C,D)))),
inference(hyper,[status(thm)],[16,1,3]),
[iquote('hyper,16,1,3')] ).
cnf(118,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)],[13,1,20]),
[iquote('hyper,13,1,20')] ).
cnf(119,plain,
$false,
inference(binary,[status(thm)],[118,2]),
[iquote('binary,118.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL101-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/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:26:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.87/2.07 ----- Otter 3.3f, August 2004 -----
% 1.87/2.07 The process was started by sandbox on n015.cluster.edu,
% 1.87/2.07 Wed Jul 27 09:26:57 2022
% 1.87/2.07 The command was "./otter". The process ID is 22381.
% 1.87/2.07
% 1.87/2.07 set(prolog_style_variables).
% 1.87/2.07 set(auto).
% 1.87/2.07 dependent: set(auto1).
% 1.87/2.07 dependent: set(process_input).
% 1.87/2.07 dependent: clear(print_kept).
% 1.87/2.07 dependent: clear(print_new_demod).
% 1.87/2.07 dependent: clear(print_back_demod).
% 1.87/2.07 dependent: clear(print_back_sub).
% 1.87/2.07 dependent: set(control_memory).
% 1.87/2.07 dependent: assign(max_mem, 12000).
% 1.87/2.07 dependent: assign(pick_given_ratio, 4).
% 1.87/2.07 dependent: assign(stats_level, 1).
% 1.87/2.07 dependent: assign(max_seconds, 10800).
% 1.87/2.07 clear(print_given).
% 1.87/2.07
% 1.87/2.07 list(usable).
% 1.87/2.07 0 [] -is_a_theorem(e_quivalent(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 1.87/2.07 0 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(X,Y),e_quivalent(X,Z)),e_quivalent(Y,Z)),U),U)).
% 1.87/2.07 0 [] is_a_theorem(e_quivalent(X,e_quivalent(e_quivalent(e_quivalent(e_quivalent(Y,Z),e_quivalent(Y,U)),e_quivalent(Z,U)),X))).
% 1.87/2.07 0 [] -is_a_theorem(e_quivalent(e_quivalent(e_quivalent(a,b),c),e_quivalent(e_quivalent(e,b),e_quivalent(e_quivalent(a,e),c)))).
% 1.87/2.07 end_of_list.
% 1.87/2.07
% 1.87/2.07 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.87/2.07
% 1.87/2.07 This is a Horn set without equality. The strategy will
% 1.87/2.07 be hyperresolution, with satellites in sos and nuclei
% 1.87/2.07 in usable.
% 1.87/2.07
% 1.87/2.07 dependent: set(hyper_res).
% 1.87/2.07 dependent: clear(order_hyper).
% 1.87/2.07
% 1.87/2.07 ------------> process usable:
% 1.87/2.07 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(e_quivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.87/2.07 ** KEPT (pick-wt=16): 2 [] -is_a_theorem(e_quivalent(e_quivalent(e_quivalent(a,b),c),e_quivalent(e_quivalent(e,b),e_quivalent(e_quivalent(a,e),c)))).
% 1.87/2.07
% 1.87/2.07 ------------> process sos:
% 1.87/2.07 ** KEPT (pick-wt=16): 3 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(A,C)),e_quivalent(B,C)),D),D)).
% 1.87/2.07 ** KEPT (pick-wt=16): 4 [] is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(e_quivalent(B,C),e_quivalent(B,D)),e_quivalent(C,D)),A))).
% 1.87/2.07
% 1.87/2.07 ======= end of input processing =======
% 1.87/2.07
% 1.87/2.07 =========== start of search ===========
% 1.87/2.07
% 1.87/2.07 -------- PROOF --------
% 1.87/2.07
% 1.87/2.07 ----> UNIT CONFLICT at 0.00 sec ----> 119 [binary,118.1,2.1] $F.
% 1.87/2.07
% 1.87/2.07 Length of proof is 10. Level of proof is 8.
% 1.87/2.07
% 1.87/2.07 ---------------- PROOF ----------------
% 1.87/2.07 % SZS status Unsatisfiable
% 1.87/2.07 % SZS output start Refutation
% See solution above
% 1.87/2.07 ------------ end of proof -------------
% 1.87/2.07
% 1.87/2.07
% 1.87/2.07 Search stopped by max_proofs option.
% 1.87/2.07
% 1.87/2.07
% 1.87/2.07 Search stopped by max_proofs option.
% 1.87/2.07
% 1.87/2.07 ============ end of search ============
% 1.87/2.07
% 1.87/2.07 -------------- statistics -------------
% 1.87/2.07 clauses given 21
% 1.87/2.07 clauses generated 259
% 1.87/2.07 clauses kept 118
% 1.87/2.07 clauses forward subsumed 145
% 1.87/2.07 clauses back subsumed 2
% 1.87/2.07 Kbytes malloced 976
% 1.87/2.07
% 1.87/2.07 ----------- times (seconds) -----------
% 1.87/2.07 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.87/2.07 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.87/2.07 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.87/2.07
% 1.87/2.07 That finishes the proof of the theorem.
% 1.87/2.07
% 1.87/2.07 Process 22381 finished Wed Jul 27 09:26:58 2022
% 1.87/2.07 Otter interrupted
% 1.87/2.07 PROOF FOUND
%------------------------------------------------------------------------------