TSTP Solution File: KRS111+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : KRS111+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 : n032.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:17 EDT 2023
% Result : Unsatisfiable 0.12s 0.46s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 28
% Syntax : Number of formulae : 58 ( 4 unt; 20 typ; 0 def)
% Number of atoms : 106 ( 11 equ)
% Maximal formula atoms : 19 ( 2 avg)
% Number of connectives : 119 ( 51 ~; 46 |; 15 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 26 ( 19 >; 7 *; 0 +; 0 <<)
% Number of predicates : 16 ( 14 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 69 ( 2 sgn; 34 !; 5 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
cUnsatisfiable: $i > $o ).
tff(decl_23,type,
cowlNothing: $i > $o ).
tff(decl_24,type,
cowlThing: $i > $o ).
tff(decl_25,type,
cp: $i > $o ).
tff(decl_26,type,
cpxcomp: $i > $o ).
tff(decl_27,type,
ra_Px1: ( $i * $i ) > $o ).
tff(decl_28,type,
rf: ( $i * $i ) > $o ).
tff(decl_29,type,
rf1: ( $i * $i ) > $o ).
tff(decl_30,type,
rinvF: ( $i * $i ) > $o ).
tff(decl_31,type,
rinvF1: ( $i * $i ) > $o ).
tff(decl_32,type,
rinvS: ( $i * $i ) > $o ).
tff(decl_33,type,
rs: ( $i * $i ) > $o ).
tff(decl_34,type,
xsd_integer: $i > $o ).
tff(decl_35,type,
xsd_string: $i > $o ).
tff(decl_36,type,
i2003_11_14_17_21_15425: $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 ).
tff(decl_41,type,
esk5_1: $i > $i ).
fof(axiom_5,axiom,
! [X4,X5,X7] :
( ( rf(X4,X5)
& rf(X4,X7) )
=> X5 = X7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rf1(X4,X5)
& cpxcomp(X5) )
& ? [X5] :
( rs(X4,X5)
& cowlThing(X5) )
& ? [X5] :
( rf(X4,X5)
& cp(X5) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_12,axiom,
! [X4,X5] :
( rs(X4,X5)
=> rf(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_12) ).
fof(axiom_6,axiom,
! [X4,X5,X7] :
( ( rf1(X4,X5)
& rf1(X4,X7) )
=> X5 = X7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_13,axiom,
! [X4,X5] :
( rs(X4,X5)
=> rf1(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_13) ).
fof(axiom_3,axiom,
! [X4] :
( cp(X4)
<=> ~ ? [X5] : ra_Px1(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
! [X4] :
( cpxcomp(X4)
<=> ? [X6] : ra_Px1(X4,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_11,axiom,
cUnsatisfiable(i2003_11_14_17_21_15425),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_11) ).
fof(c_0_8,plain,
! [X82,X83,X84] :
( ~ rf(X82,X83)
| ~ rf(X82,X84)
| X83 = X84 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])]) ).
fof(c_0_9,plain,
! [X66,X70,X71,X72,X73] :
( ( rf1(X66,esk1_1(X66))
| ~ cUnsatisfiable(X66) )
& ( cpxcomp(esk1_1(X66))
| ~ cUnsatisfiable(X66) )
& ( rs(X66,esk2_1(X66))
| ~ cUnsatisfiable(X66) )
& ( cowlThing(esk2_1(X66))
| ~ cUnsatisfiable(X66) )
& ( rf(X66,esk3_1(X66))
| ~ cUnsatisfiable(X66) )
& ( cp(esk3_1(X66))
| ~ cUnsatisfiable(X66) )
& ( ~ rf1(X70,X71)
| ~ cpxcomp(X71)
| ~ rs(X70,X72)
| ~ cowlThing(X72)
| ~ rf(X70,X73)
| ~ cp(X73)
| cUnsatisfiable(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_2])])])])])]) ).
fof(c_0_10,plain,
! [X97,X98] :
( ~ rs(X97,X98)
| rf(X97,X98) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_12])]) ).
fof(c_0_11,plain,
! [X85,X86,X87] :
( ~ rf1(X85,X86)
| ~ rf1(X85,X87)
| X86 = X87 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])]) ).
fof(c_0_12,plain,
! [X99,X100] :
( ~ rs(X99,X100)
| rf1(X99,X100) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_13])]) ).
fof(c_0_13,plain,
! [X74,X75,X76] :
( ( ~ cp(X74)
| ~ ra_Px1(X74,X75) )
& ( ra_Px1(X76,esk4_1(X76))
| cp(X76) ) ),
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_14,plain,
! [X78,X80,X81] :
( ( ~ cpxcomp(X78)
| ra_Px1(X78,esk5_1(X78)) )
& ( ~ ra_Px1(X80,X81)
| cpxcomp(X80) ) ),
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])])])])]) ).
cnf(c_0_15,plain,
( X2 = X3
| ~ rf(X1,X2)
| ~ rf(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( rf(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
( rf(X1,X2)
| ~ rs(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( rs(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,plain,
( X2 = X3
| ~ rf1(X1,X2)
| ~ rf1(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
( rf1(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,plain,
( rf1(X1,X2)
| ~ rs(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,plain,
( ~ cp(X1)
| ~ ra_Px1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,plain,
( ra_Px1(X1,esk5_1(X1))
| ~ cpxcomp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
( X1 = esk3_1(X2)
| ~ rf(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_25,plain,
( rf(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,plain,
( X1 = esk1_1(X2)
| ~ rf1(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
( rf1(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_28,plain,
( ~ cpxcomp(X1)
| ~ cp(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( cpxcomp(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_30,plain,
( esk2_1(X1) = esk3_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( esk2_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( ~ cp(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( esk1_1(X1) = esk3_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
( cp(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_35,plain,
cUnsatisfiable(i2003_11_14_17_21_15425),
inference(split_conjunct,[status(thm)],[axiom_11]) ).
cnf(c_0_36,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_37,plain,
$false,
inference(sr,[status(thm)],[c_0_35,c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : KRS111+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.09 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Mon Aug 28 01:52:30 EDT 2023
% 0.08/0.28 % CPUTime :
% 0.12/0.45 start to proof: theBenchmark
% 0.12/0.46 % Version : CSE_E---1.5
% 0.12/0.46 % Problem : theBenchmark.p
% 0.12/0.46 % Proof found
% 0.12/0.46 % SZS status Theorem for theBenchmark.p
% 0.12/0.46 % SZS output start Proof
% See solution above
% 0.12/0.47 % Total time : 0.006000 s
% 0.12/0.47 % SZS output end Proof
% 0.12/0.47 % Total time : 0.008000 s
%------------------------------------------------------------------------------