%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : CSR098+7 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 07:07:23 AM UTC 2026
% Result : Theorem 2.70s 1.25s
% Output : CNFRefutation 2.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 9 unt; 0 def)
% Number of atoms : 111 ( 18 equ)
% Maximal formula atoms : 45 ( 7 avg)
% Number of connectives : 149 ( 52 ~; 58 |; 36 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 74 ( 6 sgn 60 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_32603,axiom,
! [V__C2,V__U,V__C1] :
( V__U = s__UnionFn(V__C1,V__C2)
<=> ! [V__I1,V__I2,V__I3] :
( ( s__instance(V__C2,s__SetOrClass)
& s__instance(V__U,s__SetOrClass)
& s__instance(V__C1,s__SetOrClass) )
=> ( ( s__instance(V__I3,V__U)
& s__instance(V__I2,V__C2)
& s__instance(V__I1,V__C1) )
=> ( ( s__instance(V__I3,V__C2)
| s__instance(V__I3,V__C1) )
& s__instance(V__I2,V__U)
& s__instance(V__I1,V__U) ) ) ) ),
file('theBenchmark.p',kb_SUMO_32603) ).
fof(prove_from_ALL,conjecture,
? [X__s__Animal29_1] : s__instance(X__s__Animal29_1,s__Amphibian),
file('theBenchmark.p',prove_from_ALL) ).
fof(prove_from_ALL_neg,negated_conjecture,
~ ? [X__s__Animal29_1] : s__instance(X__s__Animal29_1,s__Amphibian),
inference(assume_negation,[status(cth)],[prove_from_ALL]) ).
fof(nnf_86,plain,
! [V__C2,V__U,V__C1] :
( ( ? [V__I1,V__I2,V__I3] :
( ( ( ~ s__instance(V__I3,V__C2)
& ~ s__instance(V__I3,V__C1) )
| ~ s__instance(V__I2,V__U)
| ~ s__instance(V__I1,V__U) )
& s__instance(V__I3,V__U)
& s__instance(V__I2,V__C2)
& s__instance(V__I1,V__C1)
& s__instance(V__C2,s__SetOrClass)
& s__instance(V__U,s__SetOrClass)
& s__instance(V__C1,s__SetOrClass) )
| s__UnionFn(V__C1,V__C2) = V__U )
& ( ! [X0,X1,X2] :
( ( ( s__instance(X2,V__C2)
| s__instance(X2,V__C1) )
& s__instance(X1,V__U)
& s__instance(X0,V__U) )
| ~ s__instance(X2,V__U)
| ~ s__instance(X1,V__C2)
| ~ s__instance(X0,V__C1)
| ~ s__instance(V__C2,s__SetOrClass)
| ~ s__instance(V__U,s__SetOrClass)
| ~ s__instance(V__C1,s__SetOrClass) )
| s__UnionFn(V__C1,V__C2) != V__U ) ),
inference(fof_nnf,[status(thm)],[kb_SUMO_32603]) ).
fof(sk_kb_SUMO_32603_sk,plain,
! [V__C2,V__U,V__C1] :
( ( ( ( ( ~ s__instance(sK2(V__C2,V__U,V__C1),V__C2)
& ~ s__instance(sK2(V__C2,V__U,V__C1),V__C1) )
| ~ s__instance(sK0(V__C2,V__U,V__C1),V__U)
| ~ s__instance(sK1(V__C2,V__U,V__C1),V__U) )
& s__instance(sK2(V__C2,V__U,V__C1),V__U)
& s__instance(sK0(V__C2,V__U,V__C1),V__C2)
& s__instance(sK1(V__C2,V__U,V__C1),V__C1)
& s__instance(V__C2,s__SetOrClass)
& s__instance(V__U,s__SetOrClass)
& s__instance(V__C1,s__SetOrClass) )
| s__UnionFn(V__C1,V__C2) = V__U )
& ( ! [X0,X1,X2] :
( ( ( s__instance(X2,V__C2)
| s__instance(X2,V__C1) )
& s__instance(X1,V__U)
& s__instance(X0,V__U) )
| ~ s__instance(X2,V__U)
| ~ s__instance(X1,V__C2)
| ~ s__instance(X0,V__C1)
| ~ s__instance(V__C2,s__SetOrClass)
| ~ s__instance(V__U,s__SetOrClass)
| ~ s__instance(V__C1,s__SetOrClass) )
| s__UnionFn(V__C1,V__C2) != V__U ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK0,sK2]),skolemize(V__I1,sK1(V__C2,V__U,V__C1)),skolemize(V__I2,sK0(V__C2,V__U,V__C1)),skolemize(V__I3,sK2(V__C2,V__U,V__C1))],[nnf_86]) ).
fof(sk_kb_SUMO_32603,plain,
( ! [VAR_0,VAR_1,VAR_2] :
( ~ s__instance(sK2(VAR_1,VAR_2,VAR_0),VAR_1)
| ~ s__instance(sK0(VAR_1,VAR_2,VAR_0),VAR_2)
| ~ s__instance(sK1(VAR_1,VAR_2,VAR_0),VAR_2)
| s__UnionFn(VAR_0,VAR_1) = VAR_2 )
& ! [VAR_0,VAR_1,VAR_2] :
( ~ s__instance(sK2(VAR_1,VAR_2,VAR_0),VAR_0)
| ~ s__instance(sK0(VAR_1,VAR_2,VAR_0),VAR_2)
| ~ s__instance(sK1(VAR_1,VAR_2,VAR_0),VAR_2)
| s__UnionFn(VAR_0,VAR_1) = VAR_2 )
& ! [VAR_0,VAR_1,VAR_2] :
( s__instance(sK2(VAR_1,VAR_2,VAR_0),VAR_2)
| s__UnionFn(VAR_0,VAR_1) = VAR_2 )
& ! [VAR_0,VAR_1,VAR_2] :
( s__instance(sK0(VAR_1,VAR_2,VAR_0),VAR_1)
| s__UnionFn(VAR_0,VAR_1) = VAR_2 )
& ! [VAR_0,VAR_1,VAR_2] :
( s__instance(sK1(VAR_1,VAR_2,VAR_0),VAR_0)
| s__UnionFn(VAR_0,VAR_1) = VAR_2 )
& ! [VAR_0,VAR_1,VAR_2] :
( s__instance(VAR_1,s__SetOrClass)
| s__UnionFn(VAR_0,VAR_1) = VAR_2 )
& ! [VAR_0,VAR_1,VAR_2] :
( s__instance(VAR_2,s__SetOrClass)
| s__UnionFn(VAR_0,VAR_1) = VAR_2 )
& ! [VAR_0,VAR_1,VAR_2] :
( s__instance(VAR_0,s__SetOrClass)
| s__UnionFn(VAR_0,VAR_1) = VAR_2 )
& ! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5] :
( s__instance(VAR_5,VAR_1)
| s__instance(VAR_5,VAR_0)
| ~ s__instance(VAR_5,VAR_2)
| ~ s__instance(VAR_4,VAR_1)
| ~ s__instance(VAR_3,VAR_0)
| ~ s__instance(VAR_1,s__SetOrClass)
| ~ s__instance(VAR_2,s__SetOrClass)
| ~ s__instance(VAR_0,s__SetOrClass)
| s__UnionFn(VAR_0,VAR_1) != VAR_2 )
& ! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5] :
( s__instance(VAR_4,VAR_2)
| ~ s__instance(VAR_5,VAR_2)
| ~ s__instance(VAR_4,VAR_1)
| ~ s__instance(VAR_3,VAR_0)
| ~ s__instance(VAR_1,s__SetOrClass)
| ~ s__instance(VAR_2,s__SetOrClass)
| ~ s__instance(VAR_0,s__SetOrClass)
| s__UnionFn(VAR_0,VAR_1) != VAR_2 )
& ! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5] :
( s__instance(VAR_3,VAR_2)
| ~ s__instance(VAR_5,VAR_2)
| ~ s__instance(VAR_4,VAR_1)
| ~ s__instance(VAR_3,VAR_0)
| ~ s__instance(VAR_1,s__SetOrClass)
| ~ s__instance(VAR_2,s__SetOrClass)
| ~ s__instance(VAR_0,s__SetOrClass)
| s__UnionFn(VAR_0,VAR_1) != VAR_2 ) ),
inference(cnf_transformation,[status(thm)],[sk_kb_SUMO_32603_sk]) ).
cnf(c_222,plain,
( s__instance(sK0(B,C,A),B)
| s__UnionFn(A,B) = C ),
inference(split_conjunct,[status(thm)],[sk_kb_SUMO_32603]) ).
fof(kb_SUMO_51184,axiom,
s__instance(s__secretesToxin__m,s__BinaryPredicate),
file('theBenchmark.p',kb_SUMO_51184) ).
cnf(c_306,plain,
s__instance(s__secretesToxin__m,s__BinaryPredicate),
inference(clausify,[status(thm)],[kb_SUMO_51184]) ).
cnf(c_383,negated_conjecture,
~ s__instance(A,s__Amphibian),
inference(clausify,[status(thm)],[prove_from_ALL_neg]) ).
cnf(c_461,plain,
s__UnionFn(A,s__Amphibian) = B,
inference(resolve,[status(thm)],[c_383,c_222]) ).
cnf(c_579,plain,
s__instance(s__secretesToxin__m,s__UnionFn(A,s__Amphibian)),
inference(paramod,[status(thm)],[c_461,c_306]) ).
cnf(c_586,plain,
~ s__instance(A,s__UnionFn(B,s__Amphibian)),
inference(paramod,[status(thm)],[c_461,c_383]) ).
cnf(c_587,plain,
$false,
inference(resolve,[status(thm)],[c_586,c_579]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR098+7 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.37 % Computer : n017.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 00:49:20 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.37 % Process 2023405 was started by sandbox2 on n017,
% 0.11/0.37 % Sun Sep 27 00:49:20 2026
% 0.11/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.22/0.48 WARNING: token truncated at 4095 chars (line 64008)
% 0.22/0.49 WARNING: token truncated at 4095 chars (line 64302)
% 0.22/0.49 WARNING: token truncated at 4095 chars (line 64389)
% 0.22/0.49 WARNING: token truncated at 4095 chars (line 65430)
% 0.22/0.49 WARNING: token truncated at 4095 chars (line 65625)
% 0.22/0.49 WARNING: token truncated at 4095 chars (line 65856)
% 2.70/1.25
% 2.70/1.25 % SInE (scan): 139 to sos (tol 1.5x), 26 to usable (tol 2.0x), 55424 zapped, of 55589 axioms (depth 3).
% 2.70/1.25
% 2.70/1.25 % From the command line: assign(max_seconds, 300).
% 2.70/1.25
% 2.70/1.25 % SZS status Theorem for theBenchmark
% 2.70/1.25
% 2.70/1.25 % Proof 1 at 0.18 (+ 0.08) seconds.
% 2.70/1.25 % Length of proof is 9.
% 2.70/1.25 % Level of proof is 4.
% 2.70/1.25 % Maximum clause weight is 15.000.
% 2.70/1.25 % Given clauses 22.
% 2.70/1.25
% 2.70/1.25 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------