%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : KRS136+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n016.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 : Fri Sep 25 01:53:18 PM UTC 2026
% Result : Theorem 5.01s 1.16s
% Output : Proof 5.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 4 unt; 0 def)
% Number of atoms : 72 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 75 ( 29 ~; 30 |; 13 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 16 ( 2 sgn 10 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X] :
( xsd_string(X)
<=> ~ xsd_integer(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(f1_nnf,plain,
! [X] :
( ( xsd_integer(X)
| xsd_string(X) )
& ( ~ xsd_integer(X)
| ~ xsd_string(X) ) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [X] :
( ( xsd_integer(X)
| xsd_string(X) )
& ( ~ xsd_integer(X)
| ~ xsd_string(X) ) ),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c3,plain,
( xsd_integer(X0)
| xsd_string(X0) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
fof(f0,axiom,
! [X] :
( ~ cowlNothing(X)
& cowlThing(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).
fof(f0_nnf,plain,
! [X] :
( ~ cowlNothing(X)
& cowlThing(X) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [X] :
( ~ cowlNothing(X)
& cowlThing(X) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
cowlThing(X0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
fof(f2,conjecture,
( ! [X] :
( xsd_string(X)
<=> ~ xsd_integer(X) )
& ! [X] :
( ~ cowlNothing(X)
& cowlThing(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',the_axiom) ).
fof(f2_neg,negated_conjecture,
~ ( ! [X] :
( xsd_string(X)
<=> ~ xsd_integer(X) )
& ! [X] :
( ~ cowlNothing(X)
& cowlThing(X) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
fof(f2_nnf,plain,
( ? [X] :
( ( ~ xsd_integer(X)
& ~ xsd_string(X) )
| ( xsd_integer(X)
& xsd_string(X) ) )
| ? [X] :
( cowlNothing(X)
| ~ cowlThing(X) ) ),
inference(nnf_transformation,[status(thm)],[f2_neg]) ).
fof(f2_sk,plain,
( ( ~ xsd_integer(sk1)
& ~ xsd_string(sk1) )
| ( xsd_integer(sk1)
& xsd_string(sk1) )
| cowlNothing(sk0)
| ~ cowlThing(sk0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f2_nnf]) ).
cnf(c5,plain,
( ~ xsd_integer(sk1)
| xsd_string(sk1)
| cowlNothing(sk0)
| ~ cowlThing(sk0) ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(p8,plain,
( ~ xsd_integer(sk1)
| xsd_string(sk1)
| cowlNothing(sk0) ),
inference(resolution,[status(thm)],[c0,c5]) ).
cnf(p10,plain,
( xsd_string(sk1)
| cowlNothing(sk0)
| xsd_string(sk1) ),
inference(resolution,[status(thm)],[c3,p8]) ).
cnf(p11,plain,
( cowlNothing(sk0)
| xsd_string(sk1) ),
inference(factoring,[status(thm)],[p10]) ).
cnf(c6,plain,
( ~ xsd_string(sk1)
| xsd_integer(sk1)
| cowlNothing(sk0)
| ~ cowlThing(sk0) ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(p9,plain,
( ~ xsd_string(sk1)
| xsd_integer(sk1)
| cowlNothing(sk0) ),
inference(resolution,[status(thm)],[c0,c6]) ).
cnf(p12,plain,
( xsd_integer(sk1)
| cowlNothing(sk0)
| cowlNothing(sk0) ),
inference(resolution,[status(thm)],[p11,p9]) ).
cnf(p14,plain,
( xsd_integer(sk1)
| cowlNothing(sk0) ),
inference(factoring,[status(thm)],[p12]) ).
cnf(c2,plain,
( ~ xsd_integer(X0)
| ~ xsd_string(X0) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(p13,plain,
( ~ xsd_integer(sk1)
| cowlNothing(sk0) ),
inference(resolution,[status(thm)],[p11,c2]) ).
cnf(p15,plain,
( cowlNothing(sk0)
| cowlNothing(sk0) ),
inference(resolution,[status(thm)],[p14,p13]) ).
cnf(p16,plain,
cowlNothing(sk0),
inference(factoring,[status(thm)],[p15]) ).
cnf(c1,plain,
~ cowlNothing(X0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p17,plain,
$false,
inference(resolution,[status(thm)],[p16,c1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS136+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/0.43 % Computer : n016.cluster.edu
% 0.11/0.43 % Model : x86_64 x86_64
% 0.11/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.43 % Memory : 8046.5625MB
% 0.11/0.43 % OS : Linux 6.8.0-71-generic
% 0.11/0.43 % CPULimit : 300
% 0.11/0.43 % WCLimit : 300
% 0.11/0.43 % DateTime : Wed Sep 23 19:34:11 UTC 2026
% 0.11/0.43 % CPUTime :
% 0.11/0.43 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.01/1.16 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.01/1.16 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------