%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MSC014+1 : TPTP v9.2.1. Released v3.2.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 04:48:57 PM UTC 2026
% Result : Satisfiable 1.24s 1.71s
% Output : Saturation 1.24s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(inject_f,axiom,
! [X1,X2,X3,X4,X6,X7,X8,X9,X5] :
( ( f(X1,X2,X3,X4,X5)
& f(X6,X7,X8,X9,X5) )
=> ( equalish(X1,X6)
& equalish(X2,X7)
& equalish(X3,X8)
& equalish(X4,X9) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inject_f) ).
fof(exists_f,axiom,
! [X1,X2,X3,X4] :
( ( equalish(X1,X1)
& equalish(X2,X2)
& equalish(X3,X3)
& equalish(X4,X4) )
=> ? [X5] : f(X1,X2,X3,X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',exists_f) ).
fof(n0_not_n1,axiom,
( ~ equalish(n0,n1)
& ~ equalish(n1,n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n0_not_n1) ).
fof(n0_and_n1_reflexive,axiom,
( equalish(n0,n0)
& equalish(n1,n1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n0_and_n1_reflexive) ).
fof(c_0_4,plain,
! [X29,X30,X31,X32,X33,X34,X35,X36,X37] :
( ( equalish(X29,X33)
| ~ f(X29,X30,X31,X32,X37)
| ~ f(X33,X34,X35,X36,X37) )
& ( equalish(X30,X34)
| ~ f(X29,X30,X31,X32,X37)
| ~ f(X33,X34,X35,X36,X37) )
& ( equalish(X31,X35)
| ~ f(X29,X30,X31,X32,X37)
| ~ f(X33,X34,X35,X36,X37) )
& ( equalish(X32,X36)
| ~ f(X29,X30,X31,X32,X37)
| ~ f(X33,X34,X35,X36,X37) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inject_f])])]) ).
fof(c_0_5,plain,
! [X24,X25,X26,X27] :
( ~ equalish(X24,X24)
| ~ equalish(X25,X25)
| ~ equalish(X26,X26)
| ~ equalish(X27,X27)
| f(X24,X25,X26,X27,esk1_4(X24,X25,X26,X27)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[exists_f])])]) ).
cnf(c_0_6,plain,
( equalish(X1,X2)
| ~ f(X1,X3,X4,X5,X6)
| ~ f(X2,X7,X8,X9,X6) ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_7,plain,
( f(X1,X2,X3,X4,esk1_4(X1,X2,X3,X4))
| ~ equalish(X1,X1)
| ~ equalish(X2,X2)
| ~ equalish(X3,X3)
| ~ equalish(X4,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]),
[final] ).
cnf(c_0_8,plain,
( equalish(X1,X2)
| ~ f(X3,X1,X4,X5,X6)
| ~ f(X7,X2,X8,X9,X6) ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_9,plain,
( equalish(X1,X2)
| ~ f(X3,X4,X1,X5,X6)
| ~ f(X7,X8,X2,X9,X6) ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_10,plain,
( equalish(X1,X2)
| ~ f(X3,X4,X5,X1,X6)
| ~ f(X7,X8,X9,X2,X6) ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
fof(c_0_11,plain,
( ~ equalish(n0,n1)
& ~ equalish(n1,n0) ),
inference(fof_simplification,[status(thm)],[n0_not_n1]) ).
cnf(c_0_12,plain,
( equalish(X1,X2)
| ~ f(X1,X3,X4,X5,esk1_4(X2,X6,X7,X8))
| ~ equalish(X8,X8)
| ~ equalish(X7,X7)
| ~ equalish(X6,X6)
| ~ equalish(X2,X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]),
[final] ).
cnf(c_0_13,plain,
( equalish(X1,X2)
| ~ f(X3,X1,X4,X5,esk1_4(X6,X2,X7,X8))
| ~ equalish(X8,X8)
| ~ equalish(X7,X7)
| ~ equalish(X2,X2)
| ~ equalish(X6,X6) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]),
[final] ).
cnf(c_0_14,plain,
( equalish(X1,X2)
| ~ f(X3,X4,X1,X5,esk1_4(X6,X7,X2,X8))
| ~ equalish(X8,X8)
| ~ equalish(X2,X2)
| ~ equalish(X7,X7)
| ~ equalish(X6,X6) ),
inference(spm,[status(thm)],[c_0_9,c_0_7]),
[final] ).
cnf(c_0_15,plain,
( equalish(X1,X2)
| ~ f(X3,X4,X5,X1,esk1_4(X6,X7,X8,X2))
| ~ equalish(X2,X2)
| ~ equalish(X8,X8)
| ~ equalish(X7,X7)
| ~ equalish(X6,X6) ),
inference(spm,[status(thm)],[c_0_10,c_0_7]),
[final] ).
cnf(c_0_16,plain,
~ equalish(n1,n0),
inference(split_conjunct,[status(thm)],[c_0_11]),
[final] ).
cnf(c_0_17,plain,
~ equalish(n0,n1),
inference(split_conjunct,[status(thm)],[c_0_11]),
[final] ).
cnf(c_0_18,plain,
equalish(n1,n1),
inference(split_conjunct,[status(thm)],[n0_and_n1_reflexive]),
[final] ).
cnf(c_0_19,plain,
equalish(n0,n0),
inference(split_conjunct,[status(thm)],[n0_and_n1_reflexive]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MSC014+1 : TPTP v9.2.1. Released v3.2.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.32 % Computer : n008.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Mon May 4 23:35:58 EDT 2026
% 0.15/0.32 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.24/1.71 % Version : CSE_E---1.7
% 1.24/1.71 % Problem : theBenchmark.p
% 1.24/1.71 % SZS status Satisfiable for theBenchmark.p
% 1.24/1.71 % SZS output start Saturation
% See solution above
% 1.24/1.71 % Total time : 1.370s
%------------------------------------------------------------------------------