TSTP Solution File: KRS113+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : KRS113+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 : n012.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:18 EDT 2023
% Result : Unsatisfiable 0.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 27
% Syntax : Number of formulae : 53 ( 4 unt; 20 typ; 0 def)
% Number of atoms : 118 ( 6 equ)
% Maximal formula atoms : 35 ( 3 avg)
% Number of connectives : 146 ( 61 ~; 58 |; 19 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 23 ( 19 >; 4 *; 0 +; 0 <<)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-1 aty)
% Number of variables : 59 ( 2 sgn; 30 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
cUnsatisfiable: $i > $o ).
tff(decl_23,type,
ca_Vx2: $i > $o ).
tff(decl_24,type,
cowlNothing: $i > $o ).
tff(decl_25,type,
cowlThing: $i > $o ).
tff(decl_26,type,
cp: $i > $o ).
tff(decl_27,type,
cpxcomp: $i > $o ).
tff(decl_28,type,
ra_Px1: ( $i * $i ) > $o ).
tff(decl_29,type,
rinvS: ( $i * $i ) > $o ).
tff(decl_30,type,
rr: ( $i * $i ) > $o ).
tff(decl_31,type,
rs: ( $i * $i ) > $o ).
tff(decl_32,type,
xsd_integer: $i > $o ).
tff(decl_33,type,
xsd_string: $i > $o ).
tff(decl_34,type,
i2003_11_14_17_21_22376: $i ).
tff(decl_35,type,
esk1_1: $i > $i ).
tff(decl_36,type,
esk2_1: $i > $i ).
tff(decl_37,type,
esk3_1: $i > $i ).
tff(decl_38,type,
esk4_1: $i > $i ).
tff(decl_39,type,
esk5_1: $i > $i ).
tff(decl_40,type,
esk6_1: $i > $i ).
tff(decl_41,type,
esk7_1: $i > $i ).
fof(axiom_3,axiom,
! [X4] :
( cp(X4)
<=> ~ ? [X7] : ra_Px1(X4,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
! [X4] :
( cpxcomp(X4)
<=> ? [X5] : ra_Px1(X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_8,axiom,
! [X4,X7] :
( rs(X4,X7)
=> rr(X4,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ! [X5,X6] :
( ( rr(X4,X5)
& rr(X4,X6) )
=> X5 = X6 )
& ? [X7] :
( rr(X4,X7)
& ca_Vx2(X7) )
& ? [X7] :
( rs(X4,X7)
& cp(X7) )
& cpxcomp(X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_6,axiom,
! [X4,X7] :
( rinvS(X4,X7)
<=> rs(X7,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_5,axiom,
! [X4] :
( ca_Vx2(X4)
<=> ! [X7] :
( rinvS(X4,X7)
=> cp(X7) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_7,axiom,
cUnsatisfiable(i2003_11_14_17_21_22376),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(c_0_7,plain,
! [X60,X61,X62] :
( ( ~ cp(X60)
| ~ ra_Px1(X60,X61) )
& ( ra_Px1(X62,esk5_1(X62))
| cp(X62) ) ),
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_3])])])])]) ).
fof(c_0_8,plain,
! [X64,X66,X67] :
( ( ~ cpxcomp(X64)
| ra_Px1(X64,esk6_1(X64)) )
& ( ~ ra_Px1(X66,X67)
| cpxcomp(X66) ) ),
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_4])])])])]) ).
fof(c_0_9,plain,
! [X74,X75] :
( ~ rs(X74,X75)
| rr(X74,X75) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_8])]) ).
fof(c_0_10,plain,
! [X50,X51,X52,X55,X58,X59] :
( ( ~ rr(X50,X51)
| ~ rr(X50,X52)
| X51 = X52
| ~ cUnsatisfiable(X50) )
& ( rr(X50,esk1_1(X50))
| ~ cUnsatisfiable(X50) )
& ( ca_Vx2(esk1_1(X50))
| ~ cUnsatisfiable(X50) )
& ( rs(X50,esk2_1(X50))
| ~ cUnsatisfiable(X50) )
& ( cp(esk2_1(X50))
| ~ cUnsatisfiable(X50) )
& ( cpxcomp(X50)
| ~ cUnsatisfiable(X50) )
& ( rr(X55,esk3_1(X55))
| ~ rr(X55,X58)
| ~ ca_Vx2(X58)
| ~ rs(X55,X59)
| ~ cp(X59)
| ~ cpxcomp(X55)
| cUnsatisfiable(X55) )
& ( rr(X55,esk4_1(X55))
| ~ rr(X55,X58)
| ~ ca_Vx2(X58)
| ~ rs(X55,X59)
| ~ cp(X59)
| ~ cpxcomp(X55)
| cUnsatisfiable(X55) )
& ( esk3_1(X55) != esk4_1(X55)
| ~ rr(X55,X58)
| ~ ca_Vx2(X58)
| ~ rs(X55,X59)
| ~ cp(X59)
| ~ cpxcomp(X55)
| cUnsatisfiable(X55) ) ),
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])])])])])]) ).
fof(c_0_11,plain,
! [X72,X73] :
( ( ~ rinvS(X72,X73)
| rs(X73,X72) )
& ( ~ rs(X73,X72)
| rinvS(X72,X73) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])]) ).
cnf(c_0_12,plain,
( ~ cp(X1)
| ~ ra_Px1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( ra_Px1(X1,esk6_1(X1))
| ~ cpxcomp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( rr(X1,X2)
| ~ rs(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( rs(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X68,X69,X70] :
( ( ~ ca_Vx2(X68)
| ~ rinvS(X68,X69)
| cp(X69) )
& ( rinvS(X70,esk7_1(X70))
| ca_Vx2(X70) )
& ( ~ cp(esk7_1(X70))
| ca_Vx2(X70) ) ),
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_5])])])])])]) ).
cnf(c_0_17,plain,
( rinvS(X2,X1)
| ~ rs(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ~ cpxcomp(X1)
| ~ cp(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( cpxcomp(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,plain,
( X2 = X3
| ~ rr(X1,X2)
| ~ rr(X1,X3)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,plain,
( rr(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,plain,
( cp(X2)
| ~ ca_Vx2(X1)
| ~ rinvS(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( rinvS(esk2_1(X1),X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_24,plain,
( ~ cp(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( X1 = esk2_1(X2)
| ~ rr(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_27,plain,
( ~ ca_Vx2(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_28,plain,
( esk2_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( ca_Vx2(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,plain,
cUnsatisfiable(i2003_11_14_17_21_22376),
inference(split_conjunct,[status(thm)],[axiom_7]) ).
cnf(c_0_31,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_32,plain,
$false,
inference(sr,[status(thm)],[c_0_30,c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS113+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n012.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 01:29:40 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 0.19/0.58 % Version : CSE_E---1.5
% 0.19/0.58 % Problem : theBenchmark.p
% 0.19/0.58 % Proof found
% 0.19/0.58 % SZS status Theorem for theBenchmark.p
% 0.19/0.58 % SZS output start Proof
% See solution above
% 0.19/0.58 % Total time : 0.008000 s
% 0.19/0.58 % SZS output end Proof
% 0.19/0.58 % Total time : 0.011000 s
%------------------------------------------------------------------------------