%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : CSR109+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 : n001.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:31 AM UTC 2026
% Result : Theorem 3.23s 1.30s
% Output : CNFRefutation 3.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 11 unt; 0 def)
% Number of atoms : 118 ( 19 equ)
% Maximal formula atoms : 45 ( 6 avg)
% Number of connectives : 154 ( 54 ~; 59 |; 37 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 82 ( 11 sgn 62 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_26635,axiom,
! [V__X,V__Y] :
( s__subclass(V__X,V__Y)
=> ( s__instance(V__Y,s__SetOrClass)
& s__instance(V__X,s__SetOrClass) ) ),
file('theBenchmark.p',kb_SUMO_26635) ).
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_SUMO_MILO,conjecture,
? [X__s__Creature50_1] : s__instance(X__s__Creature50_1,s__Reptile),
file('theBenchmark.p',prove_from_SUMO_MILO) ).
fof(prove_from_SUMO_MILO_neg,negated_conjecture,
~ ? [X__s__Creature50_1] : s__instance(X__s__Creature50_1,s__Reptile),
inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).
fof(nnf_68,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_68]) ).
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_204,plain,
( s__instance(sK0(B,C,A),B)
| s__UnionFn(A,B) = C ),
inference(split_conjunct,[status(thm)],[sk_kb_SUMO_32603]) ).
cnf(c_296,plain,
( s__instance(B,s__SetOrClass)
| ~ s__subclass(A,B) ),
inference(clausify,[status(thm)],[kb_SUMO_26635]) ).
fof(kb_SUMO_39530,axiom,
s__subclass(s__Snake,s__Reptile),
file('theBenchmark.p',kb_SUMO_39530) ).
cnf(c_324,plain,
s__subclass(s__Snake,s__Reptile),
inference(clausify,[status(thm)],[kb_SUMO_39530]) ).
cnf(c_327,negated_conjecture,
~ s__instance(A,s__Reptile),
inference(clausify,[status(thm)],[prove_from_SUMO_MILO_neg]) ).
cnf(c_348,plain,
s__UnionFn(A,s__Reptile) = B,
inference(resolve,[status(thm)],[c_327,c_204]) ).
cnf(c_585,plain,
A = B,
inference(paramod,[status(thm)],[c_348,c_348]) ).
cnf(c_827,plain,
~ s__instance(A,B),
inference(paramod,[status(thm)],[c_585,c_327]) ).
cnf(c_830,plain,
s__subclass(s__Snake,A),
inference(paramod,[status(thm)],[c_585,c_324]) ).
cnf(c_835,plain,
~ s__subclass(A,B),
inference(resolve,[status(thm)],[c_827,c_296]) ).
cnf(c_836,plain,
$false,
inference(resolve,[status(thm)],[c_835,c_830]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR109+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.09/0.36 % Computer : n001.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 27 01:06:01 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37 % Process 3044677 was started by sandbox2 on n001,
% 0.09/0.37 % Sun Sep 27 01:06:01 2026
% 0.09/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.48 WARNING: token truncated at 4095 chars (line 64302)
% 0.22/0.48 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)
% 3.23/1.30
% 3.23/1.30 % SInE (scan): 124 to sos (tol 1.5x), 23 to usable (tol 2.0x), 55441 zapped, of 55588 axioms (depth 3).
% 3.23/1.30
% 3.23/1.30 % From the command line: assign(max_seconds, 300).
% 3.23/1.30
% 3.23/1.30 % SZS status Theorem for theBenchmark
% 3.23/1.30
% 3.23/1.30 % Proof 1 at 0.18 (+ 0.13) seconds.
% 3.23/1.30 % Length of proof is 13.
% 3.23/1.30 % Level of proof is 6.
% 3.23/1.30 % Maximum clause weight is 111.000.
% 3.23/1.30 % Given clauses 12.
% 3.23/1.30
% 3.23/1.30 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------