%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : CSR105+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 : n010.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:29 AM UTC 2026
% Result : Theorem 0.36s 1.05s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 11 unt; 0 def)
% Number of atoms : 119 ( 21 equ)
% Maximal formula atoms : 45 ( 6 avg)
% Number of connectives : 153 ( 53 ~; 60 |; 36 &)
% ( 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 : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 83 ( 8 sgn 61 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_27874,axiom,
! [V__INST] :
( s__instance(V__INST,s__TimeInterval)
=> s__overlapsTemporally(V__INST,V__INST) ),
file('theBenchmark.p',kb_SUMO_27874) ).
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__TimeInterval36_1,X__s__TimeInterval36_2] : s__overlapsTemporally(X__s__TimeInterval36_1,X__s__TimeInterval36_2),
file('theBenchmark.p',prove_from_ALL) ).
fof(prove_from_ALL_neg,negated_conjecture,
~ ? [X__s__TimeInterval36_1,X__s__TimeInterval36_2] : s__overlapsTemporally(X__s__TimeInterval36_1,X__s__TimeInterval36_2),
inference(assume_negation,[status(cth)],[prove_from_ALL]) ).
fof(kb_SUMO_12048,axiom,
s__instance(s__NauticalMile,s__UnitOfLength),
file('theBenchmark.p',kb_SUMO_12048) ).
cnf(c_277,plain,
s__instance(s__NauticalMile,s__UnitOfLength),
inference(clausify,[status(thm)],[kb_SUMO_12048]) ).
fof(nnf_223,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(sK1(V__C2,V__U,V__C1),V__C2)
& ~ s__instance(sK1(V__C2,V__U,V__C1),V__C1) )
| ~ s__instance(sK0(V__C2,V__U,V__C1),V__U)
| ~ s__instance(sK2(V__C2,V__U,V__C1),V__U) )
& s__instance(sK1(V__C2,V__U,V__C1),V__U)
& s__instance(sK0(V__C2,V__U,V__C1),V__C2)
& s__instance(sK2(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,[sK2,sK0,sK1]),skolemize(V__I1,sK2(V__C2,V__U,V__C1)),skolemize(V__I2,sK0(V__C2,V__U,V__C1)),skolemize(V__I3,sK1(V__C2,V__U,V__C1))],[nnf_223]) ).
fof(sk_kb_SUMO_32603,plain,
( ! [VAR_0,VAR_1,VAR_2] :
( ~ s__instance(sK1(VAR_1,VAR_2,VAR_0),VAR_1)
| ~ s__instance(sK0(VAR_1,VAR_2,VAR_0),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(sK1(VAR_1,VAR_2,VAR_0),VAR_0)
| ~ s__instance(sK0(VAR_1,VAR_2,VAR_0),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(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(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(sK2(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_494,plain,
( s__instance(sK0(B,C,A),B)
| s__UnionFn(A,B) = C ),
inference(split_conjunct,[status(thm)],[sk_kb_SUMO_32603]) ).
cnf(c_495,plain,
( s__instance(sK1(B,C,A),C)
| s__UnionFn(A,B) = C ),
inference(split_conjunct,[status(thm)],[sk_kb_SUMO_32603]) ).
cnf(c_609,plain,
( s__overlapsTemporally(A,A)
| ~ s__instance(A,s__TimeInterval) ),
inference(clausify,[status(thm)],[kb_SUMO_27874]) ).
cnf(c_702,negated_conjecture,
~ s__overlapsTemporally(A,B),
inference(clausify,[status(thm)],[prove_from_ALL_neg]) ).
cnf(c_746,negated_conjecture,
~ s__instance(A,s__TimeInterval),
inference(resolve,[status(thm)],[c_702,c_609]) ).
cnf(c_773,plain,
s__UnionFn(A,B) = s__TimeInterval,
inference(resolve,[status(thm)],[c_746,c_495]) ).
cnf(c_831,plain,
s__UnionFn(A,s__TimeInterval) = B,
inference(resolve,[status(thm)],[c_746,c_494]) ).
cnf(c_774,plain,
s__TimeInterval = A,
inference(paramod,[status(thm)],[c_773,c_831]) ).
cnf(c_832,plain,
s__instance(s__NauticalMile,s__TimeInterval),
inference(paramod,[status(thm)],[c_774,c_277]) ).
cnf(c_830,plain,
$false,
inference(resolve,[status(thm)],[c_746,c_832]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR105+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.35 % Computer : n010.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sun Sep 27 00:58:00 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.36 % Process 414979 was started by sandbox2 on n010,
% 0.09/0.36 % Sun Sep 27 00:58:00 2026
% 0.09/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.13/0.41 WARNING: token truncated at 4095 chars (line 64008)
% 0.13/0.41 WARNING: token truncated at 4095 chars (line 64302)
% 0.13/0.41 WARNING: token truncated at 4095 chars (line 64389)
% 0.13/0.42 WARNING: token truncated at 4095 chars (line 65430)
% 0.13/0.42 WARNING: token truncated at 4095 chars (line 65625)
% 0.13/0.42 WARNING: token truncated at 4095 chars (line 65856)
% 0.36/1.05
% 0.36/1.05 % SInE (scan): 271 to sos (tol 1.5x), 39 to usable (tol 2.0x), 55281 zapped, of 55591 axioms (depth 3).
% 0.36/1.05
% 0.36/1.05 % From the command line: assign(max_seconds, 300).
% 0.36/1.05
% 0.36/1.05 % SZS status Theorem for theBenchmark
% 0.36/1.05
% 0.36/1.05 % Proof 1 at 0.22 (+ 0.09) seconds.
% 0.36/1.05 % Length of proof is 12.
% 0.36/1.05 % Level of proof is 5.
% 0.36/1.05 % Maximum clause weight is 15.000.
% 0.36/1.05 % Given clauses 6.
% 0.36/1.05
% 0.36/1.05 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------