%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : KRS129+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n003.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:46:06 AM UTC 2026
% Result : Theorem 0.09s 0.38s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 10 unt; 0 def)
% Number of atoms : 95 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 108 ( 46 ~; 46 |; 11 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 22 ( 3 sgn 9 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_0,axiom,
! [X] :
( ~ cowlNothing(X)
& cowlThing(X) ),
file('theBenchmark.p',axiom_0) ).
fof(axiom_1,axiom,
! [X] :
( xsd_string(X)
<=> ~ xsd_integer(X) ),
file('theBenchmark.p',axiom_1) ).
fof(axiom_3,axiom,
! [X] :
( cEuroMP(X)
<=> ? [Y] :
( cowlThing(Y)
& risEuroMPFrom(X,Y) ) ),
file('theBenchmark.p',axiom_3) ).
fof(axiom_5,axiom,
! [X,Y] :
( risEuroMPFrom(X,Y)
<=> rhasEuroMP(Y,X) ),
file('theBenchmark.p',axiom_5) ).
fof(the_axiom,conjecture,
( cEuroMP(iKinnock)
& ! [X] :
( xsd_string(X)
<=> ~ xsd_integer(X) )
& ! [X] :
( ~ cowlNothing(X)
& cowlThing(X) ) ),
file('theBenchmark.p',the_axiom) ).
fof(the_axiom_neg,negated_conjecture,
~ ( cEuroMP(iKinnock)
& ! [X] :
( xsd_string(X)
<=> ~ xsd_integer(X) )
& ! [X] :
( ~ cowlNothing(X)
& cowlThing(X) ) ),
inference(assume_negation,[status(cth)],[the_axiom]) ).
cnf(c_32,plain,
cowlThing(A),
inference(clausify,[status(thm)],[axiom_0]) ).
cnf(c_33,plain,
~ cowlNothing(A),
inference(clausify,[status(thm)],[axiom_0]) ).
cnf(c_34,plain,
( ~ xsd_integer(A)
| ~ xsd_string(A) ),
inference(clausify,[status(thm)],[axiom_1]) ).
cnf(c_35,plain,
( xsd_integer(A)
| xsd_string(A) ),
inference(clausify,[status(thm)],[axiom_1]) ).
cnf(c_44,plain,
( ~ cowlThing(B)
| ~ risEuroMPFrom(A,B)
| cEuroMP(A) ),
inference(clausify,[status(thm)],[axiom_3]) ).
cnf(c_45,plain,
( ~ risEuroMPFrom(A,B)
| cEuroMP(A) ),
inference(resolve,[status(thm)],[c_32,c_44]) ).
cnf(c_48,plain,
( ~ rhasEuroMP(B,A)
| risEuroMPFrom(A,B) ),
inference(clausify,[status(thm)],[axiom_5]) ).
fof(axiom_13,axiom,
rhasEuroMP(iUK,iKinnock),
file('theBenchmark.p',axiom_13) ).
cnf(c_56,plain,
rhasEuroMP(iUK,iKinnock),
inference(clausify,[status(thm)],[axiom_13]) ).
fof(nnf_19,plain,
( ~ cEuroMP(iKinnock)
| ? [X] :
( ( xsd_integer(X)
| ~ xsd_string(X) )
& ( ~ xsd_integer(X)
| xsd_string(X) ) )
| ? [X0] :
( cowlNothing(X0)
| ~ cowlThing(X0) ) ),
inference(fof_nnf,[status(thm)],[the_axiom_neg]) ).
fof(sk_the_axiom_neg_sk,plain,
( ~ cEuroMP(iKinnock)
| ( ( xsd_integer(sK1)
| ~ xsd_string(sK1) )
& ( ~ xsd_integer(sK1)
| xsd_string(sK1) ) )
| cowlNothing(sK0)
| ~ cowlThing(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X,sK1)],[nnf_19]) ).
fof(sk_the_axiom_neg,plain,
( ( ~ cEuroMP(iKinnock)
| xsd_integer(sK1)
| ~ xsd_string(sK1)
| cowlNothing(sK0)
| ~ cowlThing(sK0) )
& ( ~ cEuroMP(iKinnock)
| ~ xsd_integer(sK1)
| xsd_string(sK1)
| cowlNothing(sK0)
| ~ cowlThing(sK0) ) ),
inference(cnf_transformation,[status(thm)],[sk_the_axiom_neg_sk]) ).
cnf(c_57,negated_conjecture,
( ~ cEuroMP(iKinnock)
| ~ xsd_integer(sK1)
| xsd_string(sK1)
| cowlNothing(sK0)
| ~ cowlThing(sK0) ),
inference(split_conjunct,[status(thm)],[sk_the_axiom_neg]) ).
cnf(c_88,negated_conjecture,
( ~ cEuroMP(iKinnock)
| ~ xsd_integer(sK1)
| xsd_string(sK1)
| cowlNothing(sK0) ),
inference(resolve,[status(thm)],[c_32,c_57]) ).
cnf(c_58,negated_conjecture,
( ~ cEuroMP(iKinnock)
| ~ xsd_integer(sK1)
| xsd_string(sK1) ),
inference(resolve,[status(thm)],[c_33,c_88]) ).
cnf(c_59,negated_conjecture,
( ~ cEuroMP(iKinnock)
| xsd_integer(sK1)
| ~ xsd_string(sK1)
| cowlNothing(sK0)
| ~ cowlThing(sK0) ),
inference(split_conjunct,[status(thm)],[sk_the_axiom_neg]) ).
cnf(c_89,negated_conjecture,
( ~ cEuroMP(iKinnock)
| xsd_integer(sK1)
| ~ xsd_string(sK1)
| cowlNothing(sK0) ),
inference(resolve,[status(thm)],[c_32,c_59]) ).
cnf(c_60,negated_conjecture,
( ~ cEuroMP(iKinnock)
| xsd_integer(sK1)
| ~ xsd_string(sK1) ),
inference(resolve,[status(thm)],[c_33,c_89]) ).
cnf(c_75,plain,
risEuroMPFrom(iKinnock,iUK),
inference(resolve,[status(thm)],[c_56,c_48]) ).
cnf(c_90,negated_conjecture,
( xsd_integer(sK1)
| ~ cEuroMP(iKinnock)
| xsd_integer(sK1) ),
inference(resolve,[status(thm)],[c_60,c_35]) ).
cnf(c_78,negated_conjecture,
( ~ cEuroMP(iKinnock)
| xsd_integer(sK1) ),
inference(copy,[status(thm)],[c_90]) ).
cnf(c_79,plain,
cEuroMP(iKinnock),
inference(resolve,[status(thm)],[c_75,c_45]) ).
cnf(c_82,negated_conjecture,
xsd_integer(sK1),
inference(resolve,[status(thm)],[c_79,c_78]) ).
cnf(c_91,negated_conjecture,
( ~ cEuroMP(iKinnock)
| xsd_string(sK1) ),
inference(resolve,[status(thm)],[c_82,c_58]) ).
cnf(c_83,negated_conjecture,
xsd_string(sK1),
inference(resolve,[status(thm)],[c_79,c_91]) ).
cnf(c_92,plain,
~ xsd_string(sK1),
inference(resolve,[status(thm)],[c_34,c_82]) ).
cnf(c_87,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_83,c_92]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS129+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n003.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.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 25 19:42:23 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 916565 was started by sandbox on n003,
% 0.09/0.36 % Fri Sep 25 19:42:23 2026
% 0.09/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.37
% 0.09/0.37 % From the command line: assign(max_seconds, 300).
% 0.09/0.38
% 0.09/0.38 % SZS status Theorem for theBenchmark
% 0.09/0.38
% 0.09/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.38 % Length of proof is 23.
% 0.09/0.38 % Level of proof is 6.
% 0.09/0.38 % Maximum clause weight is 6.000.
% 0.09/0.38 % Given clauses 46.
% 0.09/0.38
% 0.09/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------