TSTP Solution File: KRS124+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : KRS124+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 : n022.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:21 EDT 2023
% Result : Unsatisfiable 0.14s 0.52s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 30
% Syntax : Number of formulae : 48 ( 5 unt; 24 typ; 0 def)
% Number of atoms : 70 ( 0 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 80 ( 34 ~; 29 |; 11 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 26 ( 23 >; 3 *; 0 +; 0 <<)
% Number of predicates : 18 ( 17 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-1 aty)
% Number of variables : 34 ( 3 sgn; 18 !; 3 ?; 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,
cUnsatisfiable: $i > $o ).
tff(decl_27,type,
rr: ( $i * $i ) > $o ).
tff(decl_28,type,
ca_Ax3: $i > $o ).
tff(decl_29,type,
cc: $i > $o ).
tff(decl_30,type,
cdxcomp: $i > $o ).
tff(decl_31,type,
cc1: $i > $o ).
tff(decl_32,type,
cd1: $i > $o ).
tff(decl_33,type,
cd1xcomp: $i > $o ).
tff(decl_34,type,
cd: $i > $o ).
tff(decl_35,type,
ra_Px1: ( $i * $i ) > $o ).
tff(decl_36,type,
ra_Px2: ( $i * $i ) > $o ).
tff(decl_37,type,
ce3: $i > $o ).
tff(decl_38,type,
cf: $i > $o ).
tff(decl_39,type,
i2003_11_14_17_22_10903: $i ).
tff(decl_40,type,
esk1_1: $i > $i ).
tff(decl_41,type,
esk2_1: $i > $i ).
tff(decl_42,type,
esk3_1: $i > $i ).
tff(decl_43,type,
esk4_1: $i > $i ).
tff(decl_44,type,
esk5_1: $i > $i ).
tff(decl_45,type,
esk6_1: $i > $i ).
fof(axiom_6,axiom,
! [X1] :
( cd(X1)
<=> ~ ? [X2] : ra_Px1(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_7,axiom,
! [X1] :
( cdxcomp(X1)
<=> ? [X3] : ra_Px1(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(axiom_3,axiom,
! [X1] :
( cc(X1)
=> cdxcomp(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_12,axiom,
! [X1] :
( ca_Ax3(X1)
<=> ( cd(X1)
& cc(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_12) ).
fof(axiom_2,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ? [X2] :
( rr(X1,X2)
& cowlThing(X2) )
& ! [X2] :
( rr(X1,X2)
=> ca_Ax3(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_13,axiom,
cUnsatisfiable(i2003_11_14_17_22_10903),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_13) ).
fof(c_0_6,plain,
! [X15,X16,X17] :
( ( ~ cd(X15)
| ~ ra_Px1(X15,X16) )
& ( ra_Px1(X17,esk3_1(X17))
| cd(X17) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])])])])]) ).
fof(c_0_7,plain,
! [X19,X21,X22] :
( ( ~ cdxcomp(X19)
| ra_Px1(X19,esk4_1(X19)) )
& ( ~ ra_Px1(X21,X22)
| cdxcomp(X21) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])])])])]) ).
cnf(c_0_8,plain,
( ~ cd(X1)
| ~ ra_Px1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( ra_Px1(X1,esk4_1(X1))
| ~ cdxcomp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X12] :
( ~ cc(X12)
| cdxcomp(X12) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])]) ).
cnf(c_0_11,plain,
( ~ cd(X1)
| ~ cdxcomp(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( cdxcomp(X1)
| ~ cc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X33] :
( ( cd(X33)
| ~ ca_Ax3(X33) )
& ( cc(X33)
| ~ ca_Ax3(X33) )
& ( ~ cd(X33)
| ~ cc(X33)
| ca_Ax3(X33) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_12])])]) ).
fof(c_0_14,plain,
! [X6,X8,X9,X10] :
( ( rr(X6,esk1_1(X6))
| ~ cUnsatisfiable(X6) )
& ( cowlThing(esk1_1(X6))
| ~ cUnsatisfiable(X6) )
& ( ~ rr(X6,X8)
| ca_Ax3(X8)
| ~ cUnsatisfiable(X6) )
& ( rr(X9,esk2_1(X9))
| ~ rr(X9,X10)
| ~ cowlThing(X10)
| cUnsatisfiable(X9) )
& ( ~ ca_Ax3(esk2_1(X9))
| ~ rr(X9,X10)
| ~ cowlThing(X10)
| cUnsatisfiable(X9) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])])])])]) ).
cnf(c_0_15,plain,
( ~ cd(X1)
| ~ cc(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( cc(X1)
| ~ ca_Ax3(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( cd(X1)
| ~ ca_Ax3(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( ca_Ax3(X2)
| ~ rr(X1,X2)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
~ ca_Ax3(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_21,plain,
cUnsatisfiable(i2003_11_14_17_22_10903),
inference(split_conjunct,[status(thm)],[axiom_13]) ).
cnf(c_0_22,plain,
~ cUnsatisfiable(X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_23,plain,
$false,
inference(sr,[status(thm)],[c_0_21,c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : KRS124+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.11 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.10/0.30 % Computer : n022.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Aug 28 01:25:24 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.14/0.51 start to proof: theBenchmark
% 0.14/0.52 % Version : CSE_E---1.5
% 0.14/0.52 % Problem : theBenchmark.p
% 0.14/0.52 % Proof found
% 0.14/0.52 % SZS status Theorem for theBenchmark.p
% 0.14/0.52 % SZS output start Proof
% See solution above
% 0.14/0.52 % Total time : 0.004000 s
% 0.14/0.52 % SZS output end Proof
% 0.14/0.52 % Total time : 0.006000 s
%------------------------------------------------------------------------------