%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN080+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 : n005.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:05 PM UTC 2026
% Result : Theorem 0.25s 1.61s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 12
% Syntax : Number of formulae : 19 ( 11 unt; 0 def)
% Number of atoms : 29 ( 28 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 23 ( 13 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 32 ( 4 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel58,conjecture,
! [X1,X2] : f(f(X1)) = f(g(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel58) ).
fof(pel58_1,axiom,
! [X1,X2] : f(X1) = g(X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel58_1) ).
fof(i_0_2,negated_conjecture,
~ ! [X1,X2] : f(f(X1)) = f(g(X2)),
inference(assume_negation,[status(cth)],[pel58]) ).
fof(i_0_3,negated_conjecture,
f(f(esk1_0)) != f(g(esk2_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_2])])]) ).
fof(i_0_4,plain,
! [X7,X8] : f(X7) = g(X8),
inference(variable_rename,[status(thm)],[pel58_1]) ).
cnf(i_0_5,negated_conjecture,
f(f(esk1_0)) != f(g(esk2_0)),
inference(split_conjunct,[status(thm)],[i_0_3]),
[final] ).
cnf(i_0_6,plain,
f(X1) = g(X2),
inference(split_conjunct,[status(thm)],[i_0_4]),
[final] ).
cnf(i_0_7,axiom,
X1 = X1 ).
cnf(i_0_8,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_9,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_10,axiom,
( X1 != X2
| f(X1) = f(X2) ) ).
cnf(i_0_11,axiom,
( X1 != X2
| g(X1) = g(X2) ) ).
cnf(i_0_7_001,axiom,
X1 = X1 ).
cnf(i_0_8_002,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_9_003,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_10_004,axiom,
( X1 != X2
| f(X1) = f(X2) ) ).
cnf(i_0_11_005,axiom,
( X1 != X2
| g(X1) = g(X2) ) ).
cnf(i_0_12,plain,
g(X1) = f(X2),
inference(scs_inference,[],[i_0_6,i_0_8]) ).
cnf(i_0_13,plain,
$false,
inference(scs_inference,[],[i_0_5,i_0_6,i_0_8,i_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN080+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.15/0.33 % Computer : n005.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 08:12:15 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % 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.63 % Total time : 1.272s
%------------------------------------------------------------------------------