TSTP Solution File: KRS126+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : KRS126+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 : n004.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.19s 0.56s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 24
% Syntax : Number of formulae : 36 ( 4 unt; 19 typ; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 32 ( 15 ~; 11 |; 2 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 20 ( 18 >; 2 *; 0 +; 0 <<)
% Number of predicates : 15 ( 14 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 21 ( 2 sgn; 12 !; 2 ?; 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,
cd1xcomp: $i > $o ).
tff(decl_28,type,
cd1: $i > $o ).
tff(decl_29,type,
cc: $i > $o ).
tff(decl_30,type,
cdxcomp: $i > $o ).
tff(decl_31,type,
cd: $i > $o ).
tff(decl_32,type,
ra_Px1: ( $i * $i ) > $o ).
tff(decl_33,type,
ra_Px2: ( $i * $i ) > $o ).
tff(decl_34,type,
ce3: $i > $o ).
tff(decl_35,type,
cf: $i > $o ).
tff(decl_36,type,
i2003_11_14_17_22_23554: $i ).
tff(decl_37,type,
esk1_1: $i > $i ).
tff(decl_38,type,
esk2_1: $i > $i ).
tff(decl_39,type,
esk3_1: $i > $i ).
tff(decl_40,type,
esk4_1: $i > $i ).
fof(axiom_8,axiom,
! [X1] :
( cd1xcomp(X1)
<=> ~ ? [X2] : ra_Px2(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
fof(axiom_7,axiom,
! [X1] :
( cd1(X1)
<=> ? [X3] : ra_Px2(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(axiom_3,axiom,
! [X1] :
( cUnsatisfiable(X1)
=> cd1(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_2,axiom,
! [X1] :
( cUnsatisfiable(X1)
=> cd1xcomp(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_11,axiom,
cUnsatisfiable(i2003_11_14_17_22_23554),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_11) ).
fof(c_0_5,plain,
! [X21,X22,X23] :
( ( ~ cd1xcomp(X21)
| ~ ra_Px2(X21,X22) )
& ( ra_Px2(X23,esk4_1(X23))
| cd1xcomp(X23) ) ),
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_8])])])])]) ).
fof(c_0_6,plain,
! [X17,X19,X20] :
( ( ~ cd1(X17)
| ra_Px2(X17,esk3_1(X17)) )
& ( ~ ra_Px2(X19,X20)
| cd1(X19) ) ),
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_7,plain,
( ~ cd1xcomp(X1)
| ~ ra_Px2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( ra_Px2(X1,esk3_1(X1))
| ~ cd1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X7] :
( ~ cUnsatisfiable(X7)
| cd1(X7) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])]) ).
fof(c_0_10,plain,
! [X6] :
( ~ cUnsatisfiable(X6)
| cd1xcomp(X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])]) ).
cnf(c_0_11,plain,
( ~ cd1(X1)
| ~ cd1xcomp(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( cd1(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( cd1xcomp(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
cUnsatisfiable(i2003_11_14_17_22_23554),
inference(split_conjunct,[status(thm)],[axiom_11]) ).
cnf(c_0_15,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_16,plain,
$false,
inference(sr,[status(thm)],[c_0_14,c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS126+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.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Aug 28 02:18:07 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.55 start to proof: theBenchmark
% 0.19/0.56 % Version : CSE_E---1.5
% 0.19/0.56 % Problem : theBenchmark.p
% 0.19/0.56 % Proof found
% 0.19/0.56 % SZS status Theorem for theBenchmark.p
% 0.19/0.56 % SZS output start Proof
% See solution above
% 0.19/0.57 % Total time : 0.005000 s
% 0.19/0.57 % SZS output end Proof
% 0.19/0.57 % Total time : 0.008000 s
%------------------------------------------------------------------------------