%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LCL664+1.001 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 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 : Tue May 5 04:44:10 PM UTC 2026
% Result : Theorem 0.25s 1.61s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 19 ( 12 unt; 0 def)
% Number of atoms : 68 ( 0 equ)
% Maximal formula atoms : 16 ( 3 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 : 29 ( 0 sgn 22 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(main,conjecture,
~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| p16(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p12(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p14(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p12(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p15(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p13(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p12(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p11(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
fof(reflexivity,axiom,
! [X1] : r1(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).
fof(i_0_2,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| p16(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p12(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p14(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p12(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p15(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p13(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p12(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p11(X2) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[main])]) ).
fof(i_0_3,negated_conjecture,
! [X15,X16,X17,X18] :
( ( ~ r1(esk1_0,X15)
| p16(X15) )
& ( ~ r1(esk1_0,X16)
| p12(X16) )
& ( ~ r1(esk1_0,X17)
| p14(X17) )
& ( ~ r1(esk1_0,X18)
| p12(X18) )
& r1(esk1_0,esk2_0)
& ~ p15(esk2_0)
& r1(esk1_0,esk3_0)
& ~ p13(esk3_0)
& r1(esk1_0,esk4_0)
& ~ p12(esk4_0)
& r1(esk1_0,esk5_0)
& ~ p11(esk5_0) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_2])])])]) ).
fof(i_0_4,plain,
! [X13] : r1(X13,X13),
inference(variable_rename,[status(thm)],[reflexivity]) ).
cnf(i_0_5,negated_conjecture,
( p14(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[i_0_3]),
[final] ).
cnf(i_0_6,negated_conjecture,
( p12(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[i_0_3]),
[final] ).
cnf(i_0_7,negated_conjecture,
( p12(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[i_0_3]),
[final] ).
cnf(i_0_8,negated_conjecture,
( p16(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[i_0_3]),
[final] ).
cnf(i_0_9,plain,
r1(X1,X1),
inference(split_conjunct,[status(thm)],[i_0_4]),
[final] ).
cnf(i_0_10,negated_conjecture,
r1(esk1_0,esk5_0),
inference(split_conjunct,[status(thm)],[i_0_3]),
[final] ).
cnf(i_0_11,negated_conjecture,
r1(esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[i_0_3]),
[final] ).
cnf(i_0_12,negated_conjecture,
r1(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[i_0_3]),
[final] ).
cnf(i_0_13,negated_conjecture,
r1(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[i_0_3]),
[final] ).
cnf(i_0_14,negated_conjecture,
~ p11(esk5_0),
inference(split_conjunct,[status(thm)],[i_0_3]),
[final] ).
cnf(i_0_15,negated_conjecture,
~ p13(esk3_0),
inference(split_conjunct,[status(thm)],[i_0_3]),
[final] ).
cnf(i_0_16,negated_conjecture,
~ p15(esk2_0),
inference(split_conjunct,[status(thm)],[i_0_3]),
[final] ).
cnf(i_0_17,negated_conjecture,
~ p12(esk4_0),
inference(split_conjunct,[status(thm)],[i_0_3]),
[final] ).
cnf(i_0_18,plain,
$false,
inference(scs_inference,[],[i_0_17,i_0_11,i_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL664+1.001 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.11 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.32 % Computer : n015.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Mon May 4 22:53:02 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 0.25/1.61 % Version : CSE_E---1.7
% 0.25/1.61 % Problem : theBenchmark.p
% 0.25/1.61 % SZS status Theorem for theBenchmark.p
% 0.25/1.61 % SZS output start CNFRefutation
% See solution above
% 0.25/1.62 % Total time : 1.271s
%------------------------------------------------------------------------------