%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : CSR084+7 : TPTP v9.2.1. Bugfixed v7.3.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 : n016.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:15:07 PM UTC 2026
% Result : Theorem 29.41s 30.69s
% Output : CNFRefutation 29.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 11 unt; 0 def)
% Number of atoms : 69 ( 15 equ)
% Maximal formula atoms : 45 ( 4 avg)
% Number of connectives : 86 ( 31 ~; 36 |; 16 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 31 ( 8 sgn 18 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_from_ALL,conjecture,
? [X2348] : s__instance(X2348,s__Invertebrate),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_ALL) ).
fof(kb_SUMO_32603,axiom,
! [X137,X12,X136] :
( X12 = s__UnionFn(X136,X137)
<=> ! [X1138,X34,X1139] :
( ( s__instance(X136,s__SetOrClass)
& s__instance(X12,s__SetOrClass)
& s__instance(X137,s__SetOrClass) )
=> ( ( s__instance(X1138,X136)
& s__instance(X34,X137)
& s__instance(X1139,X12) )
=> ( s__instance(X1138,X12)
& s__instance(X34,X12)
& ( s__instance(X1139,X136)
| s__instance(X1139,X137) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_32603) ).
fof(kb_SUMO_27371,axiom,
! [X857] : s__instance(X857,s__Entity),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_27371) ).
fof(c_0_3,negated_conjecture,
~ ? [X2348] : s__instance(X2348,s__Invertebrate),
inference(assume_negation,[status(cth)],[prove_from_ALL]) ).
fof(c_0_4,negated_conjecture,
! [X2576] : ~ s__instance(X2576,s__Invertebrate),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
fof(c_0_5,plain,
! [X2683,X2684,X2685,X2686,X2687,X2688,X2689,X2690,X2691] :
( ( s__instance(X2686,X2684)
| ~ s__instance(X2686,X2685)
| ~ s__instance(X2687,X2683)
| ~ s__instance(X2688,X2684)
| ~ s__instance(X2685,s__SetOrClass)
| ~ s__instance(X2684,s__SetOrClass)
| ~ s__instance(X2683,s__SetOrClass)
| X2684 != s__UnionFn(X2685,X2683) )
& ( s__instance(X2687,X2684)
| ~ s__instance(X2686,X2685)
| ~ s__instance(X2687,X2683)
| ~ s__instance(X2688,X2684)
| ~ s__instance(X2685,s__SetOrClass)
| ~ s__instance(X2684,s__SetOrClass)
| ~ s__instance(X2683,s__SetOrClass)
| X2684 != s__UnionFn(X2685,X2683) )
& ( s__instance(X2688,X2685)
| s__instance(X2688,X2683)
| ~ s__instance(X2686,X2685)
| ~ s__instance(X2687,X2683)
| ~ s__instance(X2688,X2684)
| ~ s__instance(X2685,s__SetOrClass)
| ~ s__instance(X2684,s__SetOrClass)
| ~ s__instance(X2683,s__SetOrClass)
| X2684 != s__UnionFn(X2685,X2683) )
& ( s__instance(X2691,s__SetOrClass)
| X2690 = s__UnionFn(X2691,X2689) )
& ( s__instance(X2690,s__SetOrClass)
| X2690 = s__UnionFn(X2691,X2689) )
& ( s__instance(X2689,s__SetOrClass)
| X2690 = s__UnionFn(X2691,X2689) )
& ( s__instance(esk9_3(X2689,X2690,X2691),X2691)
| X2690 = s__UnionFn(X2691,X2689) )
& ( s__instance(esk10_3(X2689,X2690,X2691),X2689)
| X2690 = s__UnionFn(X2691,X2689) )
& ( s__instance(esk11_3(X2689,X2690,X2691),X2690)
| X2690 = s__UnionFn(X2691,X2689) )
& ( ~ s__instance(esk11_3(X2689,X2690,X2691),X2691)
| ~ s__instance(esk9_3(X2689,X2690,X2691),X2690)
| ~ s__instance(esk10_3(X2689,X2690,X2691),X2690)
| X2690 = s__UnionFn(X2691,X2689) )
& ( ~ s__instance(esk11_3(X2689,X2690,X2691),X2689)
| ~ s__instance(esk9_3(X2689,X2690,X2691),X2690)
| ~ s__instance(esk10_3(X2689,X2690,X2691),X2690)
| X2690 = s__UnionFn(X2691,X2689) ) ),
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)],[kb_SUMO_32603])])])])])]) ).
cnf(c_0_6,negated_conjecture,
~ s__instance(X1,s__Invertebrate),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( s__instance(esk9_3(X1,X2,X3),X3)
| X2 = s__UnionFn(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
X1 = s__UnionFn(s__Invertebrate,X2),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
fof(c_0_9,plain,
! [X2700] : s__instance(X2700,s__Entity),
inference(variable_rename,[status(thm)],[kb_SUMO_27371]) ).
cnf(c_0_10,negated_conjecture,
X1 = X2,
inference(spm,[status(thm)],[c_0_8,c_0_8]) ).
cnf(c_0_11,plain,
s__instance(X1,s__Entity),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
~ s__instance(X1,X2),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_13,plain,
$false,
inference(sr,[status(thm)],[c_0_11,c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR084+7 : TPTP v9.2.1. Bugfixed v7.3.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 : n016.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 : Mon May 4 16:51:06 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 29.41/30.69 % Version : CSE_E---1.7
% 29.41/30.69 % Problem : theBenchmark.p
% 29.41/30.69 % SZS status Theorem for theBenchmark.p
% 29.41/30.69 % SZS output start CNFRefutation
% See solution above
% 29.41/30.69 % Total time : 30.302s
%------------------------------------------------------------------------------