TSTP Solution File: KRS119+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : KRS119+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 : n028.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:19 EDT 2023
% Result : Unsatisfiable 0.19s 0.56s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 28
% Syntax : Number of formulae : 57 ( 4 unt; 20 typ; 0 def)
% Number of atoms : 110 ( 0 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 126 ( 53 ~; 49 |; 16 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 24 ( 19 >; 5 *; 0 +; 0 <<)
% Number of predicates : 15 ( 14 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 62 ( 2 sgn; 31 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
cUnsatisfiable: $i > $o ).
tff(decl_23,type,
ca_Ax2: $i > $o ).
tff(decl_24,type,
ca_Vx3: $i > $o ).
tff(decl_25,type,
cowlNothing: $i > $o ).
tff(decl_26,type,
cowlThing: $i > $o ).
tff(decl_27,type,
cp1: $i > $o ).
tff(decl_28,type,
cp1xcomp: $i > $o ).
tff(decl_29,type,
ra_Px1: ( $i * $i ) > $o ).
tff(decl_30,type,
rf: ( $i * $i ) > $o ).
tff(decl_31,type,
rinvF: ( $i * $i ) > $o ).
tff(decl_32,type,
rinvR: ( $i * $i ) > $o ).
tff(decl_33,type,
rr: ( $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_44786: $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_10,axiom,
! [X4,X5,X8] :
( ( rr(X4,X5)
& rr(X5,X8) )
=> rr(X4,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_10) ).
fof(axiom_6,axiom,
! [X4] :
( ca_Vx3(X4)
<=> ? [X5] :
( rr(X4,X5)
& ca_Ax2(X5) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_9,axiom,
! [X4,X5] :
( rinvR(X4,X5)
<=> rr(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rr(X4,X5)
& ca_Vx3(X5) )
& cp1(X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_3,axiom,
! [X4] :
( cp1(X4)
<=> ~ ? [X5] : ra_Px1(X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
! [X4] :
( cp1xcomp(X4)
<=> ? [X6] : ra_Px1(X4,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_5,axiom,
! [X4] :
( ca_Ax2(X4)
<=> ( cp1(X4)
& ! [X5] :
( rinvR(X4,X5)
=> cp1xcomp(X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_11,axiom,
cUnsatisfiable(i2003_11_14_17_21_44786),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_11) ).
fof(c_0_8,plain,
! [X86,X87,X88] :
( ~ rr(X86,X87)
| ~ rr(X87,X88)
| rr(X86,X88) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_10])]) ).
fof(c_0_9,plain,
! [X75,X77,X78] :
( ( rr(X75,esk5_1(X75))
| ~ ca_Vx3(X75) )
& ( ca_Ax2(esk5_1(X75))
| ~ ca_Vx3(X75) )
& ( ~ rr(X77,X78)
| ~ ca_Ax2(X78)
| ca_Vx3(X77) ) ),
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_6])])])])])]) ).
fof(c_0_10,plain,
! [X84,X85] :
( ( ~ rinvR(X84,X85)
| rr(X85,X84) )
& ( ~ rr(X85,X84)
| rinvR(X84,X85) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_9])]) ).
cnf(c_0_11,plain,
( rr(X1,X3)
| ~ rr(X1,X2)
| ~ rr(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( rr(X1,esk5_1(X1))
| ~ ca_Vx3(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X59,X61,X62] :
( ( rr(X59,esk1_1(X59))
| ~ cUnsatisfiable(X59) )
& ( ca_Vx3(esk1_1(X59))
| ~ cUnsatisfiable(X59) )
& ( cp1(X59)
| ~ cUnsatisfiable(X59) )
& ( ~ rr(X61,X62)
| ~ ca_Vx3(X62)
| ~ cp1(X61)
| cUnsatisfiable(X61) ) ),
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_14,plain,
! [X63,X64,X65] :
( ( ~ cp1(X63)
| ~ ra_Px1(X63,X64) )
& ( ra_Px1(X65,esk2_1(X65))
| cp1(X65) ) ),
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_15,plain,
! [X67,X69,X70] :
( ( ~ cp1xcomp(X67)
| ra_Px1(X67,esk3_1(X67)) )
& ( ~ ra_Px1(X69,X70)
| cp1xcomp(X69) ) ),
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_16,plain,
! [X71,X72,X73] :
( ( cp1(X71)
| ~ ca_Ax2(X71) )
& ( ~ rinvR(X71,X72)
| cp1xcomp(X72)
| ~ ca_Ax2(X71) )
& ( rinvR(X73,esk4_1(X73))
| ~ cp1(X73)
| ca_Ax2(X73) )
& ( ~ cp1xcomp(esk4_1(X73))
| ~ cp1(X73)
| ca_Ax2(X73) ) ),
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,
( rinvR(X2,X1)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( rr(X1,esk5_1(X2))
| ~ rr(X1,X2)
| ~ ca_Vx3(X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_19,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( ca_Vx3(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( ~ cp1(X1)
| ~ ra_Px1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( ra_Px1(X1,esk3_1(X1))
| ~ cp1xcomp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( cp1xcomp(X2)
| ~ rinvR(X1,X2)
| ~ ca_Ax2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( rinvR(esk5_1(X1),X1)
| ~ ca_Vx3(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_25,plain,
( ca_Ax2(esk5_1(X1))
| ~ ca_Vx3(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,plain,
( ca_Vx3(X1)
| ~ rr(X1,X2)
| ~ ca_Ax2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_27,plain,
( rr(X1,esk5_1(esk1_1(X1)))
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_28,plain,
( ~ cp1xcomp(X1)
| ~ cp1(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
( cp1xcomp(X1)
| ~ ca_Vx3(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_30,plain,
( ca_Vx3(X1)
| ~ ca_Ax2(esk5_1(esk1_1(X1)))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( ~ cp1(X1)
| ~ ca_Vx3(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( ca_Vx3(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_25]),c_0_20]) ).
cnf(c_0_33,plain,
( cp1(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_34,plain,
cUnsatisfiable(i2003_11_14_17_21_44786),
inference(split_conjunct,[status(thm)],[axiom_11]) ).
cnf(c_0_35,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_36,plain,
$false,
inference(sr,[status(thm)],[c_0_34,c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS119+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.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 28 01:36:54 EDT 2023
% 0.13/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.009000 s
% 0.19/0.57 % SZS output end Proof
% 0.19/0.57 % Total time : 0.012000 s
%------------------------------------------------------------------------------