%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LCL646+1.001 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n031.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 : Tue May 5 04:42:32 PM UTC 2026
% Result : Theorem 0.26s 1.61s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 16 ( 9 unt; 0 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 94 ( 45 ~; 38 |; 11 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 26 ( 0 sgn 20 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(main,conjecture,
~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| p6(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p4(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p5(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p3(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
fof(i_0_1,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| p6(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p4(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p5(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p3(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[main])]) ).
fof(i_0_2,negated_conjecture,
! [X13,X14,X15,X16] :
( ( ~ r1(esk1_0,X13)
| p6(X13) )
& ( ~ r1(esk1_0,X14)
| p2(X14) )
& ( ~ r1(esk1_0,X15)
| p4(X15) )
& ( ~ r1(esk1_0,X16)
| p2(X16) )
& r1(esk1_0,esk2_0)
& ~ p5(esk2_0)
& r1(esk1_0,esk3_0)
& ~ p3(esk3_0)
& r1(esk1_0,esk4_0)
& ~ p2(esk4_0)
& r1(esk1_0,esk5_0)
& ~ p1(esk5_0) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_1])])])]) ).
cnf(i_0_3,negated_conjecture,
( p4(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_4,negated_conjecture,
( p2(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_5,negated_conjecture,
( p2(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_6,negated_conjecture,
( p6(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_7,negated_conjecture,
r1(esk1_0,esk5_0),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_8,negated_conjecture,
r1(esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_9,negated_conjecture,
r1(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_10,negated_conjecture,
r1(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_11,negated_conjecture,
~ p1(esk5_0),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_12,negated_conjecture,
~ p3(esk3_0),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_13,negated_conjecture,
~ p5(esk2_0),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_14,negated_conjecture,
~ p2(esk4_0),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_15,plain,
$false,
inference(scs_inference,[],[i_0_14,i_0_8,i_0_5]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL646+1.001 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.32 % Computer : n031.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Mon May 4 22:48:38 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 0.26/1.61 % Version : CSE_E---1.7
% 0.26/1.61 % Problem : theBenchmark.p
% 0.26/1.61 % SZS status Theorem for theBenchmark.p
% 0.26/1.61 % SZS output start CNFRefutation
% See solution above
% 0.26/1.63 % Total time : 1.271s
%------------------------------------------------------------------------------