%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN386+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 : n014.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:59 PM UTC 2026
% Result : Theorem 0.24s 1.61s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 7 unt; 0 def)
% Number of atoms : 45 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 44 ( 12 ~; 9 |; 11 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 64 ( 4 sgn 32 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(x2138,conjecture,
( ( ! [X1] :
? [X2] : big_f(X1,X2)
& ? [X1] :
! [X3] :
? [X4] :
! [X5] :
( big_s(X4,X5)
=> big_d(X5,X1,X3) )
& ! [X3] :
? [X6] :
! [X7,X8] :
( big_d(X7,X8,X6)
=> ! [X2,X9] :
( ( big_f(X7,X2)
& big_f(X8,X9) )
=> big_d(X2,X9,X3) ) ) )
=> ? [X2] :
! [X3] :
? [X10] :
! [X5] :
( big_s(X10,X5)
=> ! [X9] :
( big_f(X5,X9)
=> big_d(X9,X2,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2138) ).
fof(i_0_1,negated_conjecture,
~ ( ( ! [X1] :
? [X2] : big_f(X1,X2)
& ? [X1] :
! [X3] :
? [X4] :
! [X5] :
( big_s(X4,X5)
=> big_d(X5,X1,X3) )
& ! [X3] :
? [X6] :
! [X7,X8] :
( big_d(X7,X8,X6)
=> ! [X2,X9] :
( ( big_f(X7,X2)
& big_f(X8,X9) )
=> big_d(X2,X9,X3) ) ) )
=> ? [X2] :
! [X3] :
? [X10] :
! [X5] :
( big_s(X10,X5)
=> ! [X9] :
( big_f(X5,X9)
=> big_d(X9,X2,X3) ) ) ),
inference(assume_negation,[status(cth)],[x2138]) ).
fof(i_0_2,negated_conjecture,
! [X28,X31,X33,X34,X36,X37,X38,X39,X40,X42] :
( big_f(X28,esk1_1(X28))
& ( ~ big_s(esk3_1(X31),X33)
| big_d(X33,esk2_0,X31) )
& ( ~ big_d(X36,X37,esk4_1(X34))
| ~ big_f(X36,X38)
| ~ big_f(X37,X39)
| big_d(X38,X39,X34) )
& big_s(X42,esk6_2(X40,X42))
& big_f(esk6_2(X40,X42),esk7_2(X40,X42))
& ~ big_d(esk7_2(X40,X42),X40,esk5_1(X40)) ),
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,
( big_d(X4,X5,X3)
| ~ big_d(X1,X2,esk4_1(X3))
| ~ big_f(X1,X4)
| ~ big_f(X2,X5) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_4,negated_conjecture,
~ big_d(esk7_2(X1,X2),X1,esk5_1(X1)),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_5,negated_conjecture,
( big_d(X2,esk2_0,X1)
| ~ big_s(esk3_1(X1),X2) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_6,negated_conjecture,
big_f(esk6_2(X1,X2),esk7_2(X1,X2)),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_7,negated_conjecture,
big_s(X1,esk6_2(X2,X1)),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_8,negated_conjecture,
big_f(X1,esk1_1(X1)),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_9,plain,
big_d(esk6_2(X1,esk3_1(X2)),esk2_0,X2),
inference(scs_inference,[],[i_0_7,i_0_5]) ).
cnf(i_0_10,plain,
big_s(X1,esk6_2(X2,X1)),
inference(rename_variables,[],[i_0_7]) ).
cnf(i_0_11,plain,
( ~ big_s(esk3_1(X1),X2)
| big_d(X2,esk2_0,X1) ),
inference(rename_variables,[],[i_0_5]) ).
cnf(i_0_12,plain,
$false,
inference(scs_inference,[],[i_0_4,i_0_6,i_0_8,i_0_7,i_0_5,i_0_3]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN386+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 : n014.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:30:37 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 0.24/1.61 % Version : CSE_E---1.7
% 0.24/1.61 % Problem : theBenchmark.p
% 0.24/1.61 % SZS status Theorem for theBenchmark.p
% 0.24/1.61 % SZS output start CNFRefutation
% See solution above
% 0.24/1.63 % Total time : 1.271s
%------------------------------------------------------------------------------