%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN075+1 : TPTP v9.2.1. Released v2.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 : n008.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 05:36:04 PM UTC 2026
% Result : Theorem 1.26s 1.72s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 19 ( 4 unt; 0 def)
% Number of atoms : 57 ( 38 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 59 ( 21 ~; 27 |; 6 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 35 ( 2 sgn 12 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel52,conjecture,
? [X2] :
! [X4] :
( ? [X1] :
! [X3] :
( big_f(X3,X4)
<=> X3 = X1 )
<=> X4 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel52) ).
fof(pel52_1,axiom,
? [X1,X2] :
! [X3,X4] :
( big_f(X3,X4)
<=> ( X3 = X1
& X4 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel52_1) ).
fof(c_0_2,negated_conjecture,
~ ? [X2] :
! [X4] :
( ? [X1] :
! [X3] :
( big_f(X3,X4)
<=> X3 = X1 )
<=> X4 = X2 ),
inference(assume_negation,[status(cth)],[pel52]) ).
fof(c_0_3,negated_conjecture,
! [X17,X19,X22,X23] :
( ( ~ big_f(esk4_2(X17,X19),esk3_1(X17))
| esk4_2(X17,X19) != X19
| esk3_1(X17) != X17 )
& ( big_f(esk4_2(X17,X19),esk3_1(X17))
| esk4_2(X17,X19) = X19
| esk3_1(X17) != X17 )
& ( ~ big_f(X22,esk3_1(X17))
| X22 = esk5_1(X17)
| esk3_1(X17) = X17 )
& ( X23 != esk5_1(X17)
| big_f(X23,esk3_1(X17))
| esk3_1(X17) = X17 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])]) ).
fof(c_0_4,plain,
! [X15,X16] :
( ( X15 = esk1_0
| ~ big_f(X15,X16) )
& ( X16 = esk2_0
| ~ big_f(X15,X16) )
& ( X15 != esk1_0
| X16 != esk2_0
| big_f(X15,X16) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel52_1])])])]) ).
cnf(c_0_5,negated_conjecture,
( big_f(X1,esk3_1(X2))
| esk3_1(X2) = X2
| X1 != esk5_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( X1 = esk2_0
| ~ big_f(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( esk3_1(X1) = X1
| big_f(esk5_1(X1),esk3_1(X1)) ),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( X1 = esk1_0
| ~ big_f(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
( big_f(esk4_2(X1,X2),esk3_1(X1))
| esk4_2(X1,X2) = X2
| esk3_1(X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,negated_conjecture,
( esk3_1(X1) = esk2_0
| esk3_1(X1) = X1 ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( esk4_2(X1,X2) = esk1_0
| esk4_2(X1,X2) = X2
| esk3_1(X1) != X1 ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
esk3_1(esk2_0) = esk2_0,
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_10])]) ).
cnf(c_0_13,negated_conjecture,
( esk4_2(esk2_0,X1) = esk1_0
| esk4_2(esk2_0,X1) = X1 ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
( big_f(X1,X2)
| X1 != esk1_0
| X2 != esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,negated_conjecture,
( ~ big_f(esk4_2(X1,X2),esk3_1(X1))
| esk4_2(X1,X2) != X2
| esk3_1(X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_16,negated_conjecture,
esk4_2(esk2_0,esk1_0) = esk1_0,
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_13])]) ).
cnf(c_0_17,plain,
big_f(esk1_0,esk2_0),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_14])]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_12]),c_0_12]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN075+1 : TPTP v9.2.1. Released v2.0.0.
% 0.00/0.12 % 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.16/0.33 % Computer : n008.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 08:12:13 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.26/1.72 % Version : CSE_E---1.7
% 1.26/1.72 % Problem : theBenchmark.p
% 1.26/1.72 % SZS status Theorem for theBenchmark.p
% 1.26/1.72 % SZS output start CNFRefutation
% See solution above
% 1.26/1.72 % Total time : 1.373s
%------------------------------------------------------------------------------