TSTP Solution File: KRS152+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : KRS152+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n025.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 : Thu Aug 31 05:40:38 EDT 2023
% Result : Theorem 0.19s 0.60s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 26
% Syntax : Number of formulae : 55 ( 11 unt; 18 typ; 0 def)
% Number of atoms : 127 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 160 ( 70 ~; 59 |; 24 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 14 >; 1 *; 0 +; 0 <<)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 21 ( 2 sgn; 15 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
cowlThing: $i > $o ).
tff(decl_23,type,
cowlNothing: $i > $o ).
tff(decl_24,type,
xsd_string: $i > $o ).
tff(decl_25,type,
xsd_integer: $i > $o ).
tff(decl_26,type,
cC10: $i > $o ).
tff(decl_27,type,
cC2: $i > $o ).
tff(decl_28,type,
cC4: $i > $o ).
tff(decl_29,type,
cC12: $i > $o ).
tff(decl_30,type,
rR1: ( $i * $i ) > $o ).
tff(decl_31,type,
cC6: $i > $o ).
tff(decl_32,type,
cC8: $i > $o ).
tff(decl_33,type,
cTEST: $i > $o ).
tff(decl_34,type,
iV21080: $i ).
tff(decl_35,type,
iV21081: $i ).
tff(decl_36,type,
esk1_1: $i > $i ).
tff(decl_37,type,
esk2_1: $i > $i ).
tff(decl_38,type,
esk3_0: $i ).
tff(decl_39,type,
esk4_0: $i ).
fof(the_axiom,conjecture,
( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cowlThing(iV21080)
& cC12(iV21080)
& cC10(iV21081)
& cowlThing(iV21081) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',the_axiom) ).
fof(axiom_0,axiom,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).
fof(axiom_1,axiom,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(axiom_6,axiom,
! [X1] :
( cTEST(X1)
<=> ( cC12(X1)
& ~ cC8(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_7,axiom,
cTEST(iV21080),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(axiom_2,axiom,
! [X1] :
( cC10(X1)
<=> ( cC2(X1)
& cC4(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_15,axiom,
cC4(iV21081),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_15) ).
fof(axiom_14,axiom,
cC2(iV21081),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_14) ).
fof(c_0_8,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cowlThing(iV21080)
& cC12(iV21080)
& cC10(iV21081)
& cowlThing(iV21081) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[the_axiom])]) ).
fof(c_0_9,plain,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_10,negated_conjecture,
( ( ~ xsd_string(esk4_0)
| xsd_integer(esk4_0)
| ~ cowlThing(esk3_0)
| cowlNothing(esk3_0)
| ~ cowlThing(iV21080)
| ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ cowlThing(iV21081) )
& ( xsd_string(esk4_0)
| ~ xsd_integer(esk4_0)
| ~ cowlThing(esk3_0)
| cowlNothing(esk3_0)
| ~ cowlThing(iV21080)
| ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ cowlThing(iV21081) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_11,plain,
! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( xsd_string(esk4_0)
| cowlNothing(esk3_0)
| ~ xsd_integer(esk4_0)
| ~ cowlThing(esk3_0)
| ~ cowlThing(iV21080)
| ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ cowlThing(iV21081) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
cnf(c_0_15,negated_conjecture,
( cowlNothing(esk3_0)
| xsd_string(esk4_0)
| ~ xsd_integer(esk4_0)
| ~ cC10(iV21081)
| ~ cC12(iV21080) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13]),c_0_13])]) ).
cnf(c_0_16,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X4] :
( ( ~ xsd_string(X4)
| ~ xsd_integer(X4) )
& ( xsd_integer(X4)
| xsd_string(X4) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])]) ).
cnf(c_0_18,negated_conjecture,
( xsd_integer(esk4_0)
| cowlNothing(esk3_0)
| ~ xsd_string(esk4_0)
| ~ cowlThing(esk3_0)
| ~ cowlThing(iV21080)
| ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ cowlThing(iV21081) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_19,plain,
! [X1] :
( cTEST(X1)
<=> ( cC12(X1)
& ~ cC8(X1) ) ),
inference(fof_simplification,[status(thm)],[axiom_6]) ).
cnf(c_0_20,negated_conjecture,
( xsd_string(esk4_0)
| ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ xsd_integer(esk4_0) ),
inference(sr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( cowlNothing(esk3_0)
| xsd_integer(esk4_0)
| ~ xsd_string(esk4_0)
| ~ cC10(iV21081)
| ~ cC12(iV21080) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_13]),c_0_13]),c_0_13])]) ).
fof(c_0_23,plain,
! [X15] :
( ( cC12(X15)
| ~ cTEST(X15) )
& ( ~ cC8(X15)
| ~ cTEST(X15) )
& ( ~ cC12(X15)
| cC8(X15)
| cTEST(X15) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
cnf(c_0_24,negated_conjecture,
( ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ xsd_integer(esk4_0) ),
inference(csr,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( xsd_integer(X1)
| xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,negated_conjecture,
( ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ xsd_string(esk4_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_22,c_0_16]),c_0_21]) ).
cnf(c_0_27,plain,
( cC12(X1)
| ~ cTEST(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
cTEST(iV21080),
inference(split_conjunct,[status(thm)],[axiom_7]) ).
fof(c_0_29,plain,
! [X5] :
( ( cC2(X5)
| ~ cC10(X5) )
& ( cC4(X5)
| ~ cC10(X5) )
& ( ~ cC2(X5)
| ~ cC4(X5)
| cC10(X5) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])]) ).
cnf(c_0_30,negated_conjecture,
( ~ cC12(iV21080)
| ~ cC10(iV21081) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_31,plain,
cC12(iV21080),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( cC10(X1)
| ~ cC2(X1)
| ~ cC4(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_33,plain,
cC4(iV21081),
inference(split_conjunct,[status(thm)],[axiom_15]) ).
cnf(c_0_34,plain,
cC2(iV21081),
inference(split_conjunct,[status(thm)],[axiom_14]) ).
cnf(c_0_35,negated_conjecture,
~ cC10(iV21081),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).
cnf(c_0_36,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS152+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.15/0.34 % Computer : n025.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Mon Aug 28 01:36:09 EDT 2023
% 0.15/0.34 % CPUTime :
% 0.19/0.58 start to proof: theBenchmark
% 0.19/0.60 % Version : CSE_E---1.5
% 0.19/0.60 % Problem : theBenchmark.p
% 0.19/0.60 % Proof found
% 0.19/0.60 % SZS status Theorem for theBenchmark.p
% 0.19/0.60 % SZS output start Proof
% See solution above
% 0.19/0.61 % Total time : 0.008000 s
% 0.19/0.61 % SZS output end Proof
% 0.19/0.61 % Total time : 0.011000 s
%------------------------------------------------------------------------------