TSTP Solution File: LCL102-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL102-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n028.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:33 EDT 2022
% Result : Unsatisfiable 2.04s 2.27s
% Output : Refutation 2.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% 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 : 6 ( 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 : 49 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(e_quivalent(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL102-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('LCL102-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('LCL102-1.p',unknown),
[] ).
cnf(4,axiom,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(e_quivalent(C,B),A)))),
file('LCL102-1.p',unknown),
[] ).
cnf(5,axiom,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,A),e_quivalent(C,B)))),
file('LCL102-1.p',unknown),
[] ).
cnf(9,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(A,e_quivalent(e_quivalent(D,B),e_quivalent(D,C))))),
inference(hyper,[status(thm)],[5,1,5]),
[iquote('hyper,5,1,5')] ).
cnf(11,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)],[5,1,3]),
[iquote('hyper,5,1,3')] ).
cnf(12,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(A,e_quivalent(e_quivalent(C,D),e_quivalent(e_quivalent(D,C),B))))),
inference(hyper,[status(thm)],[5,1,4]),
[iquote('hyper,5,1,4')] ).
cnf(23,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,e_quivalent(e_quivalent(C,D),e_quivalent(C,E)))),e_quivalent(A,e_quivalent(B,e_quivalent(D,E))))),
inference(hyper,[status(thm)],[11,1,5]),
[iquote('hyper,11,1,5')] ).
cnf(26,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(B,D)),e_quivalent(C,e_quivalent(A,D)))),
inference(hyper,[status(thm)],[11,1,9]),
[iquote('hyper,11,1,9')] ).
cnf(121,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),C),D),e_quivalent(C,e_quivalent(e_quivalent(B,A),D)))),
inference(hyper,[status(thm)],[12,1,11]),
[iquote('hyper,12,1,11')] ).
cnf(265,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(e_quivalent(e_quivalent(D,A),e_quivalent(D,B)),C))),
inference(hyper,[status(thm)],[26,1,3]),
[iquote('hyper,26,1,3')] ).
cnf(1068,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(e_quivalent(e_quivalent(D,C),e_quivalent(D,B)),A)))),
inference(hyper,[status(thm)],[265,1,121]),
[iquote('hyper,265,1,121')] ).
cnf(5015,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)],[1068,1,23]),
[iquote('hyper,1068,1,23')] ).
cnf(5016,plain,
$false,
inference(binary,[status(thm)],[5015,2]),
[iquote('binary,5015.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL102-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n028.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:35:34 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.04/2.27 ----- Otter 3.3f, August 2004 -----
% 2.04/2.27 The process was started by sandbox on n028.cluster.edu,
% 2.04/2.27 Wed Jul 27 09:35:34 2022
% 2.04/2.27 The command was "./otter". The process ID is 29662.
% 2.04/2.27
% 2.04/2.27 set(prolog_style_variables).
% 2.04/2.27 set(auto).
% 2.04/2.27 dependent: set(auto1).
% 2.04/2.27 dependent: set(process_input).
% 2.04/2.27 dependent: clear(print_kept).
% 2.04/2.27 dependent: clear(print_new_demod).
% 2.04/2.27 dependent: clear(print_back_demod).
% 2.04/2.27 dependent: clear(print_back_sub).
% 2.04/2.27 dependent: set(control_memory).
% 2.04/2.27 dependent: assign(max_mem, 12000).
% 2.04/2.27 dependent: assign(pick_given_ratio, 4).
% 2.04/2.27 dependent: assign(stats_level, 1).
% 2.04/2.27 dependent: assign(max_seconds, 10800).
% 2.04/2.27 clear(print_given).
% 2.04/2.27
% 2.04/2.27 list(usable).
% 2.04/2.27 0 [] -is_a_theorem(e_quivalent(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 2.04/2.27 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)).
% 2.04/2.27 0 [] is_a_theorem(e_quivalent(X,e_quivalent(e_quivalent(Y,Z),e_quivalent(e_quivalent(Z,Y),X)))).
% 2.04/2.27 0 [] is_a_theorem(e_quivalent(e_quivalent(X,Y),e_quivalent(e_quivalent(Z,X),e_quivalent(Z,Y)))).
% 2.04/2.27 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)))).
% 2.04/2.27 end_of_list.
% 2.04/2.27
% 2.04/2.27 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 2.04/2.27
% 2.04/2.27 This is a Horn set without equality. The strategy will
% 2.04/2.27 be hyperresolution, with satellites in sos and nuclei
% 2.04/2.27 in usable.
% 2.04/2.27
% 2.04/2.27 dependent: set(hyper_res).
% 2.04/2.27 dependent: clear(order_hyper).
% 2.04/2.27
% 2.04/2.27 ------------> process usable:
% 2.04/2.27 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(e_quivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 2.04/2.27 ** 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)))).
% 2.04/2.27
% 2.04/2.27 ------------> process sos:
% 2.04/2.27 ** 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)).
% 2.04/2.27 ** KEPT (pick-wt=12): 4 [] is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(e_quivalent(C,B),A)))).
% 2.04/2.27 ** KEPT (pick-wt=12): 5 [] is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,A),e_quivalent(C,B)))).
% 2.04/2.27
% 2.04/2.27 ======= end of input processing =======
% 2.04/2.27
% 2.04/2.27 =========== start of search ===========
% 2.04/2.27
% 2.04/2.27 -------- PROOF --------
% 2.04/2.27
% 2.04/2.27 ----> UNIT CONFLICT at 0.39 sec ----> 5016 [binary,5015.1,2.1] $F.
% 2.04/2.27
% 2.04/2.27 Length of proof is 9. Level of proof is 5.
% 2.04/2.27
% 2.04/2.27 ---------------- PROOF ----------------
% 2.04/2.27 % SZS status Unsatisfiable
% 2.04/2.27 % SZS output start Refutation
% See solution above
% 2.04/2.27 ------------ end of proof -------------
% 2.04/2.27
% 2.04/2.27
% 2.04/2.27 Search stopped by max_proofs option.
% 2.04/2.27
% 2.04/2.27
% 2.04/2.27 Search stopped by max_proofs option.
% 2.04/2.27
% 2.04/2.27 ============ end of search ============
% 2.04/2.27
% 2.04/2.27 -------------- statistics -------------
% 2.04/2.27 clauses given 120
% 2.04/2.27 clauses generated 9880
% 2.04/2.27 clauses kept 5015
% 2.04/2.27 clauses forward subsumed 4870
% 2.04/2.27 clauses back subsumed 3
% 2.04/2.27 Kbytes malloced 3906
% 2.04/2.27
% 2.04/2.27 ----------- times (seconds) -----------
% 2.04/2.27 user CPU time 0.39 (0 hr, 0 min, 0 sec)
% 2.04/2.27 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.04/2.27 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 2.04/2.27
% 2.04/2.27 That finishes the proof of the theorem.
% 2.04/2.27
% 2.04/2.27 Process 29662 finished Wed Jul 27 09:35:35 2022
% 2.04/2.28 Otter interrupted
% 2.04/2.28 PROOF FOUND
%------------------------------------------------------------------------------