%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS163+1 : TPTP v9.2.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:36:45 PM UTC 2026
% Result : Theorem 1.25s 1.71s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 9 unt; 0 def)
% Number of atoms : 87 ( 11 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 101 ( 43 ~; 38 |; 16 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 17 ( 2 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(the_axiom,conjecture,
( ! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) )
& ! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) )
& cowlThing(ia)
& cowlThing(ib)
& ia != ib ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',the_axiom) ).
fof(axiom_0,axiom,
! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).
fof(axiom_1,axiom,
! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(axiom_6,axiom,
! [X3] :
~ ( cB(X3)
& cA(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_4,axiom,
cB(ib),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_2,axiom,
cA(ia),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(c_0_6,negated_conjecture,
~ ( ! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) )
& ! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) )
& cowlThing(ia)
& cowlThing(ib)
& ia != ib ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[the_axiom])]) ).
fof(c_0_7,plain,
! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_8,negated_conjecture,
( ( ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib)
| ia = ib )
& ( xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib)
| ia = ib ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_9,plain,
! [X33] :
( cowlThing(X33)
& ~ cowlNothing(X33) ),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
cnf(c_0_11,negated_conjecture,
( xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| ia = ib
| ~ xsd_string(esk2_0)
| ~ cowlThing(esk1_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X34] :
( ( ~ xsd_string(X34)
| ~ xsd_integer(X34) )
& ( xsd_integer(X34)
| xsd_string(X34) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])]) ).
cnf(c_0_14,negated_conjecture,
( xsd_string(esk2_0)
| cowlNothing(esk1_0)
| ia = ib
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_15,plain,
! [X35] :
( ~ cB(X35)
| ~ cA(X35) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])]) ).
cnf(c_0_16,negated_conjecture,
( ib = ia
| cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| ~ xsd_string(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_12]),c_0_12])]) ).
cnf(c_0_17,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( ib = ia
| cowlNothing(esk1_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_12]),c_0_12]),c_0_12])]) ).
cnf(c_0_20,plain,
( ~ cB(X1)
| ~ cA(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
cB(ib),
inference(split_conjunct,[status(thm)],[axiom_4]) ).
cnf(c_0_22,negated_conjecture,
( ib = ia
| ~ xsd_string(esk2_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_23,plain,
( xsd_integer(X1)
| xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,negated_conjecture,
( ib = ia
| ~ xsd_integer(esk2_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_19,c_0_17]),c_0_18]) ).
cnf(c_0_25,plain,
~ cA(ib),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
ib = ia,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_27,plain,
cA(ia),
inference(split_conjunct,[status(thm)],[axiom_2]) ).
cnf(c_0_28,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS163+1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.32 % Computer : n020.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Mon May 4 20:39:35 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.25/1.71 % Version : CSE_E---1.7
% 1.25/1.71 % Problem : theBenchmark.p
% 1.25/1.71 % SZS status Theorem for theBenchmark.p
% 1.25/1.71 % SZS output start CNFRefutation
% See solution above
% 1.25/1.71 % Total time : 1.371s
%------------------------------------------------------------------------------