TSTP Solution File: KRS125+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : KRS125+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n018.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.18s 0.48s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 27
% Syntax : Number of formulae : 47 ( 4 unt; 20 typ; 0 def)
% Number of atoms : 60 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 60 ( 27 ~; 22 |; 5 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 21 ( 19 >; 2 *; 0 +; 0 <<)
% Number of predicates : 16 ( 15 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 31 ( 2 sgn; 16 !; 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,
ce3: $i > $o ).
tff(decl_28,type,
cf: $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,
cd1xcomp: $i > $o ).
tff(decl_33,type,
cd1: $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,
i2003_11_14_17_22_17947: $i ).
tff(decl_38,type,
esk1_1: $i > $i ).
tff(decl_39,type,
esk2_1: $i > $i ).
tff(decl_40,type,
esk3_1: $i > $i ).
tff(decl_41,type,
esk4_1: $i > $i ).
fof(axiom_6,axiom,
! [X1] :
( cd(X1)
<=> ~ ? [X2] : ra_Px1(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_7,axiom,
! [X1] :
( cdxcomp(X1)
<=> ? [X3] : ra_Px1(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(axiom_3,axiom,
! [X1] :
( cc(X1)
=> cdxcomp(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_10,axiom,
! [X1] :
( ce3(X1)
=> cc(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_10) ).
fof(axiom_11,axiom,
! [X1] :
( cf(X1)
=> cd(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_11) ).
fof(axiom_2,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ce3(X1)
& cf(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_12,axiom,
cUnsatisfiable(i2003_11_14_17_22_17947),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_12) ).
fof(c_0_7,plain,
! [X10,X11,X12] :
( ( ~ cd(X10)
| ~ ra_Px1(X10,X11) )
& ( ra_Px1(X12,esk1_1(X12))
| cd(X12) ) ),
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_8,plain,
! [X14,X16,X17] :
( ( ~ cdxcomp(X14)
| ra_Px1(X14,esk2_1(X14)) )
& ( ~ ra_Px1(X16,X17)
| cdxcomp(X16) ) ),
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])])])])]) ).
fof(c_0_9,plain,
! [X7] :
( ~ cc(X7)
| cdxcomp(X7) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])]) ).
fof(c_0_10,plain,
! [X26] :
( ~ ce3(X26)
| cc(X26) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_10])]) ).
cnf(c_0_11,plain,
( ~ cd(X1)
| ~ ra_Px1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ra_Px1(X1,esk2_1(X1))
| ~ cdxcomp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( cdxcomp(X1)
| ~ cc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( cc(X1)
| ~ ce3(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X27] :
( ~ cf(X27)
| cd(X27) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_11])]) ).
fof(c_0_16,plain,
! [X6] :
( ( ce3(X6)
| ~ cUnsatisfiable(X6) )
& ( cf(X6)
| ~ cUnsatisfiable(X6) )
& ( ~ ce3(X6)
| ~ cf(X6)
| cUnsatisfiable(X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])]) ).
cnf(c_0_17,plain,
( ~ cd(X1)
| ~ cdxcomp(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
( cdxcomp(X1)
| ~ ce3(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
( cd(X1)
| ~ cf(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( cf(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( ~ cd(X1)
| ~ ce3(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( ce3(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( cd(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
cUnsatisfiable(i2003_11_14_17_22_17947),
inference(split_conjunct,[status(thm)],[axiom_12]) ).
cnf(c_0_25,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[c_0_24,c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KRS125+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Aug 28 02:20:46 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.47 start to proof: theBenchmark
% 0.18/0.48 % Version : CSE_E---1.5
% 0.18/0.48 % Problem : theBenchmark.p
% 0.18/0.48 % Proof found
% 0.18/0.48 % SZS status Theorem for theBenchmark.p
% 0.18/0.48 % SZS output start Proof
% See solution above
% 0.18/0.49 % Total time : 0.007000 s
% 0.18/0.49 % SZS output end Proof
% 0.18/0.49 % Total time : 0.010000 s
%------------------------------------------------------------------------------