TSTP Solution File: LCL644+1.001 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL644+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n025.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:04:48 EDT 2022
% Result : Theorem 2.07s 2.28s
% Output : Refutation 2.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 0
% Number of leaves : 1
% Syntax : Number of clauses : 1 ( 1 unt; 0 nHn; 1 RR)
% Number of literals : 1 ( 0 equ; 0 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 1 ( 0 usr; 1 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
$false,
file('LCL644+1.001.p',unknown),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11 % Problem : LCL644+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n025.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:30:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.07/2.28
% 2.07/2.28 -------- PROOF --------
% 2.07/2.28 ----- Otter 3.3f, August 2004 -----
% 2.07/2.28 The process was started by sandbox on n025.cluster.edu,
% 2.07/2.28 Wed Jul 27 09:30:45 2022
% 2.07/2.28 The command was "./otter". The process ID is 904.
% 2.07/2.28
% 2.07/2.28 set(prolog_style_variables).
% 2.07/2.28 set(auto).
% 2.07/2.28 dependent: set(auto1).
% 2.07/2.28 dependent: set(process_input).
% 2.07/2.28 dependent: clear(print_kept).
% 2.07/2.28 dependent: clear(print_new_demod).
% 2.07/2.28 dependent: clear(print_back_demod).
% 2.07/2.28 dependent: clear(print_back_sub).
% 2.07/2.28 dependent: set(control_memory).
% 2.07/2.28 dependent: assign(max_mem, 12000).
% 2.07/2.28 dependent: assign(pick_given_ratio, 4).
% 2.07/2.28 dependent: assign(stats_level, 1).
% 2.07/2.28 dependent: assign(max_seconds, 10800).
% 2.07/2.28 clear(print_given).
% 2.07/2.28
% 2.07/2.28 formula_list(usable).
% 2.07/2.28 -(-(exists X (-(-((all Y (-r1(X,Y)| -(p2(Y)& (all X (-r1(Y,X)|p2(X))))|p1(Y)))| (all Y (-r1(X,Y)|p2(Y)| -(p1(Y)& (all X (-r1(Y,X)|p1(X)))&p1(Y))))| -((all Y (-r1(X,Y)| (all X (-r1(Y,X)| -(p2(X)& (all Y (-r1(X,Y)|p2(Y))))|p1(X)))|p2(Y)| -(p1(Y)& (all X (-r1(Y,X)|p1(X)))&p1(Y))))& (all Y (-r1(X,Y)| -(p2(Y)& (all X (-r1(Y,X)|p2(X))))|p1(Y)| (all X (-r1(Y,X)|p2(X)| -(p1(X)& (all Y (-r1(X,Y)|p1(Y)))&p1(X))))))& (all Y (-r1(X,Y)| -(p2(Y)& (all X (-r1(Y,X)|p2(X))))|p1(Y)|p2(Y)| -(p1(Y)& (all X (-r1(Y,X)|p1(X)))&p1(Y))))))| (all Y (-r1(X,Y)|p1(Y)| -((all X (-r1(Y,X)|p1(X)))&p1(Y))))| (all Y (-r1(X,Y)|p1(Y)| -((all X (-r1(Y,X)|p1(X)))&p1(Y)))))))).
% 2.07/2.28 end_of_list.
% 2.07/2.28
% 2.07/2.28 -------> usable clausifies to:
% 2.07/2.28
% 2.07/2.28 list(usable).
% 2.07/2.28 0 [] $F.
% 2.07/2.28 end_of_list.
% 2.07/2.28
% 2.07/2.28 SCAN INPUT: prop=1, horn=1, equality=0, symmetry=0, max_lits=0.
% 2.07/2.28
% 2.07/2.28 The clause set is propositional; the strategy will be
% 2.07/2.28 ordered hyperresolution with the propositional
% 2.07/2.28 optimizations, with satellites in sos and nuclei in usable.
% 2.07/2.28
% 2.07/2.28 dependent: set(hyper_res).
% 2.07/2.28 dependent: set(propositional).
% 2.07/2.28 dependent: set(sort_literals).
% 2.07/2.28
% 2.07/2.28 ------------> process usable:
% 2.07/2.28
% 2.07/2.28 ------------> process sos:
% 2.07/2.28 ** KEPT (pick-wt=0): 1 [] $F.
% 2.07/2.28
% 2.07/2.28 -----> EMPTY CLAUSE at 0.21 sec ----> 1 [] $F.
% 2.07/2.28
% 2.07/2.28 Length of proof is -1. Level of proof is -1.
% 2.07/2.28
% 2.07/2.28 ---------------- PROOF ----------------
% 2.07/2.28 % SZS status Theorem
% 2.07/2.28 % SZS output start Refutation
% See solution above
% 2.07/2.28 ------------ end of proof -------------
% 2.07/2.28
% 2.07/2.28
% 2.07/2.28 Search stopped by max_proofs option.
% 2.07/2.28
% 2.07/2.28
% 2.07/2.28 Search stopped by max_proofs option.
% 2.07/2.28
% 2.07/2.28 ============ end of search ============
% 2.07/2.28
% 2.07/2.28 -------------- statistics -------------
% 2.07/2.28 clauses given 0
% 2.07/2.28 clauses generated 0
% 2.07/2.28 clauses kept 0
% 2.07/2.28 clauses forward subsumed 0
% 2.07/2.28 clauses back subsumed 0
% 2.07/2.28 Kbytes malloced 976
% 2.07/2.28
% 2.07/2.28 ----------- times (seconds) -----------
% 2.07/2.28 user CPU time 0.21 (0 hr, 0 min, 0 sec)
% 2.07/2.28 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.07/2.28 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.07/2.28
% 2.07/2.28 That finishes the proof of the theorem.
% 2.07/2.28
% 2.07/2.28 Process 904 finished Wed Jul 27 09:30:47 2022
% 2.07/2.28 Otter interrupted
% 2.07/2.28 PROOF FOUND
%------------------------------------------------------------------------------