%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MSC013+1 : TPTP v9.2.1. Released v3.2.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 : n028.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:56 PM UTC 2026
% Result : CounterSatisfiable 1.17s 1.66s
% Output : Saturation 1.17s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(relation_injective,axiom,
! [X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11] :
( ( f(X1,X2,X3,X4,X5,X11)
& f(X6,X7,X8,X9,X10,X11) )
=> ( equalish(X1,X6)
& equalish(X2,X7)
& equalish(X3,X8)
& equalish(X4,X9)
& equalish(X5,X10) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',relation_injective) ).
fof(relation_exists,axiom,
! [X1,X2,X3,X4,X5] :
( ( equalish(X1,X1)
& equalish(X2,X2)
& equalish(X3,X3)
& equalish(X4,X4)
& equalish(X5,X5) )
=> ? [X6] : f(X1,X2,X3,X4,X5,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',relation_exists) ).
fof(n1_equal_n0,axiom,
( equalish(n1,n0)
=> goal ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n1_equal_n0) ).
fof(goal_to_be_proved,conjecture,
goal,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_to_be_proved) ).
fof(n0_equal_n1,axiom,
( equalish(n0,n1)
=> goal ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n0_equal_n1) ).
fof(n0_and_n1_reflexive,axiom,
( equalish(n0,n0)
& equalish(n1,n1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n0_and_n1_reflexive) ).
fof(c_0_6,plain,
! [X35,X36,X37,X38,X39,X40,X41,X42,X43,X44,X45] :
( ( equalish(X35,X40)
| ~ f(X35,X36,X37,X38,X39,X45)
| ~ f(X40,X41,X42,X43,X44,X45) )
& ( equalish(X36,X41)
| ~ f(X35,X36,X37,X38,X39,X45)
| ~ f(X40,X41,X42,X43,X44,X45) )
& ( equalish(X37,X42)
| ~ f(X35,X36,X37,X38,X39,X45)
| ~ f(X40,X41,X42,X43,X44,X45) )
& ( equalish(X38,X43)
| ~ f(X35,X36,X37,X38,X39,X45)
| ~ f(X40,X41,X42,X43,X44,X45) )
& ( equalish(X39,X44)
| ~ f(X35,X36,X37,X38,X39,X45)
| ~ f(X40,X41,X42,X43,X44,X45) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[relation_injective])])]) ).
fof(c_0_7,plain,
! [X29,X30,X31,X32,X33] :
( ~ equalish(X29,X29)
| ~ equalish(X30,X30)
| ~ equalish(X31,X31)
| ~ equalish(X32,X32)
| ~ equalish(X33,X33)
| f(X29,X30,X31,X32,X33,esk1_5(X29,X30,X31,X32,X33)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[relation_exists])])]) ).
fof(c_0_8,plain,
( ~ equalish(n1,n0)
| goal ),
inference(fof_nnf,[status(thm)],[n1_equal_n0]) ).
fof(c_0_9,negated_conjecture,
~ goal,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goal_to_be_proved])]) ).
fof(c_0_10,plain,
( ~ equalish(n0,n1)
| goal ),
inference(fof_nnf,[status(thm)],[n0_equal_n1]) ).
cnf(c_0_11,plain,
( equalish(X1,X2)
| ~ f(X1,X3,X4,X5,X6,X7)
| ~ f(X2,X8,X9,X10,X11,X7) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_12,plain,
( f(X1,X2,X3,X4,X5,esk1_5(X1,X2,X3,X4,X5))
| ~ equalish(X1,X1)
| ~ equalish(X2,X2)
| ~ equalish(X3,X3)
| ~ equalish(X4,X4)
| ~ equalish(X5,X5) ),
inference(split_conjunct,[status(thm)],[c_0_7]),
[final] ).
cnf(c_0_13,plain,
( equalish(X1,X2)
| ~ f(X3,X1,X4,X5,X6,X7)
| ~ f(X8,X2,X9,X10,X11,X7) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_14,plain,
( equalish(X1,X2)
| ~ f(X3,X4,X1,X5,X6,X7)
| ~ f(X8,X9,X2,X10,X11,X7) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_15,plain,
( equalish(X1,X2)
| ~ f(X3,X4,X5,X1,X6,X7)
| ~ f(X8,X9,X10,X2,X11,X7) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_16,plain,
( equalish(X1,X2)
| ~ f(X3,X4,X5,X6,X1,X7)
| ~ f(X8,X9,X10,X11,X2,X7) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_17,plain,
( goal
| ~ equalish(n1,n0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
~ goal,
inference(split_conjunct,[status(thm)],[c_0_9]),
[final] ).
cnf(c_0_19,plain,
( goal
| ~ equalish(n0,n1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,plain,
( equalish(X1,X2)
| ~ f(X1,X3,X4,X5,X6,esk1_5(X2,X7,X8,X9,X10))
| ~ equalish(X10,X10)
| ~ equalish(X9,X9)
| ~ equalish(X8,X8)
| ~ equalish(X7,X7)
| ~ equalish(X2,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]),
[final] ).
cnf(c_0_21,plain,
( equalish(X1,X2)
| ~ f(X3,X1,X4,X5,X6,esk1_5(X7,X2,X8,X9,X10))
| ~ equalish(X10,X10)
| ~ equalish(X9,X9)
| ~ equalish(X8,X8)
| ~ equalish(X2,X2)
| ~ equalish(X7,X7) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]),
[final] ).
cnf(c_0_22,plain,
( equalish(X1,X2)
| ~ f(X3,X4,X1,X5,X6,esk1_5(X7,X8,X2,X9,X10))
| ~ equalish(X10,X10)
| ~ equalish(X9,X9)
| ~ equalish(X2,X2)
| ~ equalish(X8,X8)
| ~ equalish(X7,X7) ),
inference(spm,[status(thm)],[c_0_14,c_0_12]),
[final] ).
cnf(c_0_23,plain,
( equalish(X1,X2)
| ~ f(X3,X4,X5,X1,X6,esk1_5(X7,X8,X9,X2,X10))
| ~ equalish(X10,X10)
| ~ equalish(X2,X2)
| ~ equalish(X9,X9)
| ~ equalish(X8,X8)
| ~ equalish(X7,X7) ),
inference(spm,[status(thm)],[c_0_15,c_0_12]),
[final] ).
cnf(c_0_24,plain,
( equalish(X1,X2)
| ~ f(X3,X4,X5,X6,X1,esk1_5(X7,X8,X9,X10,X2))
| ~ equalish(X2,X2)
| ~ equalish(X10,X10)
| ~ equalish(X9,X9)
| ~ equalish(X8,X8)
| ~ equalish(X7,X7) ),
inference(spm,[status(thm)],[c_0_16,c_0_12]),
[final] ).
cnf(c_0_25,plain,
~ equalish(n1,n0),
inference(sr,[status(thm)],[c_0_17,c_0_18]),
[final] ).
cnf(c_0_26,plain,
~ equalish(n0,n1),
inference(sr,[status(thm)],[c_0_19,c_0_18]),
[final] ).
cnf(c_0_27,plain,
equalish(n1,n1),
inference(split_conjunct,[status(thm)],[n0_and_n1_reflexive]),
[final] ).
cnf(c_0_28,plain,
equalish(n0,n0),
inference(split_conjunct,[status(thm)],[n0_and_n1_reflexive]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : MSC013+1 : TPTP v9.2.1. Released v3.2.0.
% 0.00/0.09 % 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.09/0.28 % Computer : n028.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Mon May 4 23:36:00 EDT 2026
% 0.09/0.28 % CPUTime :
% 0.09/0.29 % start to proof: theBenchmark
% 1.17/1.66 % Version : CSE_E---1.7
% 1.17/1.66 % Problem : theBenchmark.p
% 1.17/1.66 % SZS status CounterSatisfiable for theBenchmark.p
% 1.17/1.66 % SZS output start Saturation
% See solution above
% 1.17/1.66 % Total time : 1.369s
%------------------------------------------------------------------------------