%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN364+1 : TPTP v9.2.1. Released v2.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 : n024.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:56 PM UTC 2026
% Result : Theorem 0.13s 1.51s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 6 unt; 0 def)
% Number of atoms : 52 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 54 ( 20 ~; 16 |; 12 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 41 ( 11 sgn 16 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(x2115,conjecture,
( ( ! [X1] :
( ? [X2] : big_p(X1,X2)
=> ! [X3] : big_p(X3,X3) )
& ! [X4] :
? [X5] :
( big_p(X4,X5)
| ( big_m(X4)
& big_q(f(X4,X5)) ) )
& ! [X6] :
( big_q(X6)
=> ~ big_m(g(X6)) ) )
=> ! [X4] :
? [X5] :
( big_p(g(X4),X5)
& big_p(X4,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2115) ).
fof(i_0_1,negated_conjecture,
~ ( ( ! [X1] :
( ? [X2] : big_p(X1,X2)
=> ! [X3] : big_p(X3,X3) )
& ! [X4] :
? [X5] :
( big_p(X4,X5)
| ( big_m(X4)
& big_q(f(X4,X5)) ) )
& ! [X6] :
( big_q(X6)
=> ~ big_m(g(X6)) ) )
=> ! [X4] :
? [X5] :
( big_p(g(X4),X5)
& big_p(X4,X4) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[x2115])]) ).
fof(i_0_2,negated_conjecture,
! [X15,X16,X17,X18,X21,X23] :
( ( ~ big_p(X15,X16)
| big_p(X17,X17) )
& ( big_m(X18)
| big_p(X18,esk1_1(X18)) )
& ( big_q(f(X18,esk2_1(X18)))
| big_p(X18,esk1_1(X18)) )
& ( ~ big_q(X21)
| ~ big_m(g(X21)) )
& ( ~ big_p(g(esk3_0),X23)
| ~ big_p(esk3_0,esk3_0) ) ),
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)],[i_0_1])])])])])]) ).
cnf(i_0_3,negated_conjecture,
( big_q(f(X1,esk2_1(X1)))
| big_p(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_4,negated_conjecture,
( ~ big_p(g(esk3_0),X1)
| ~ big_p(esk3_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_5,negated_conjecture,
( big_p(X3,X3)
| ~ big_p(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_6,negated_conjecture,
( big_m(X1)
| big_p(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_7,negated_conjecture,
( ~ big_q(X1)
| ~ big_m(g(X1)) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_8,plain,
( big_p(X1,esk1_1(X1))
| ~ big_m(g(f(X1,esk2_1(X1)))) ),
inference(scs_inference,[],[i_0_7,i_0_3]) ).
cnf(i_0_9,plain,
( ~ big_p(X1,X2)
| ~ big_p(esk3_0,esk3_0) ),
inference(scs_inference,[],[i_0_5,i_0_4]) ).
cnf(i_0_10,plain,
~ big_p(esk3_0,esk3_0),
nference(factoring_inference,[],[9]) ).
cnf(i_0_11,plain,
~ big_p(X1,X2),
inference(scs_inference,[],[i_0_10,i_0_5]) ).
cnf(i_0_12,plain,
( big_p(X1,X1)
| ~ big_p(X2,X3) ),
inference(rename_variables,[],[i_0_5]) ).
cnf(i_0_13,plain,
big_m(X1),
inference(scs_inference,[],[i_0_10,i_0_5,i_0_6]) ).
cnf(i_0_14,plain,
( big_p(X1,esk1_1(X1))
| big_m(X1) ),
inference(rename_variables,[],[i_0_6]) ).
cnf(i_0_15,plain,
~ big_q(X1),
inference(scs_inference,[],[i_0_10,i_0_5,i_0_6,i_0_7]) ).
cnf(i_0_16,plain,
big_p(X1,esk1_1(X1)),
inference(scs_inference,[],[i_0_10,i_0_5,i_0_6,i_0_7,i_0_3]) ).
cnf(i_0_17,plain,
$false,
inference(scs_inference,[],[i_0_10,i_0_5,i_0_6,i_0_7,i_0_3,i_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : SYN364+1 : TPTP v9.2.1. Released v2.0.0.
% 0.00/0.06 % 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.07/0.25 % Computer : n024.cluster.edu
% 0.07/0.25 % Model : x86_64 x86_64
% 0.07/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.25 % Memory : 8042.1875MB
% 0.07/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.25 % CPULimit : 300
% 0.07/0.25 % WCLimit : 300
% 0.07/0.25 % DateTime : Tue May 5 03:29:56 EDT 2026
% 0.07/0.25 % CPUTime :
% 0.07/0.25 % start to proof: theBenchmark
% 0.13/1.51 % Version : CSE_E---1.7
% 0.13/1.51 % Problem : theBenchmark.p
% 0.13/1.51 % SZS status Theorem for theBenchmark.p
% 0.13/1.51 % SZS output start CNFRefutation
% See solution above
% 0.13/1.53 % Total time : 1.261s
%------------------------------------------------------------------------------