TSTP Solution File: KRS106+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : KRS106+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 : n013.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:16 EDT 2023
% Result : Unsatisfiable 0.20s 0.56s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 26
% Syntax : Number of formulae : 56 ( 4 unt; 18 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 : 21 ( 17 >; 4 *; 0 +; 0 <<)
% Number of predicates : 14 ( 12 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,
cp1: $i > $o ).
tff(decl_26,type,
cp1xcomp: $i > $o ).
tff(decl_27,type,
cp2: $i > $o ).
tff(decl_28,type,
ra_Px1: ( $i * $i ) > $o ).
tff(decl_29,type,
rf1: ( $i * $i ) > $o ).
tff(decl_30,type,
rf2: ( $i * $i ) > $o ).
tff(decl_31,type,
rf3: ( $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_20_57644: $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 ).
fof(axiom_5,axiom,
! [X4,X5,X7] :
( ( rf1(X4,X5)
& rf1(X4,X7) )
=> X5 = X7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rf3(X4,X5)
& cp2(X5) )
& ? [X5] :
( rf1(X4,X5)
& cp1(X5) )
& ? [X5] :
( rf2(X4,X5)
& cp1xcomp(X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_9,axiom,
! [X4,X5] :
( rf3(X4,X5)
=> rf1(X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).
fof(axiom_6,axiom,
! [X4,X5,X7] :
( ( rf2(X4,X5)
& rf2(X4,X7) )
=> X5 = X7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_10,axiom,
! [X4,X5] :
( rf3(X4,X5)
=> rf2(X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_10) ).
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_8,axiom,
cUnsatisfiable(i2003_11_14_17_20_57644),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
fof(c_0_8,plain,
! [X66,X67,X68] :
( ~ rf1(X66,X67)
| ~ rf1(X66,X68)
| X67 = X68 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])]) ).
fof(c_0_9,plain,
! [X50,X54,X55,X56,X57] :
( ( rf3(X50,esk1_1(X50))
| ~ cUnsatisfiable(X50) )
& ( cp2(esk1_1(X50))
| ~ cUnsatisfiable(X50) )
& ( rf1(X50,esk2_1(X50))
| ~ cUnsatisfiable(X50) )
& ( cp1(esk2_1(X50))
| ~ cUnsatisfiable(X50) )
& ( rf2(X50,esk3_1(X50))
| ~ cUnsatisfiable(X50) )
& ( cp1xcomp(esk3_1(X50))
| ~ cUnsatisfiable(X50) )
& ( ~ rf3(X54,X55)
| ~ cp2(X55)
| ~ rf1(X54,X56)
| ~ cp1(X56)
| ~ rf2(X54,X57)
| ~ cp1xcomp(X57)
| cUnsatisfiable(X54) ) ),
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,
! [X75,X76] :
( ~ rf3(X75,X76)
| rf1(X75,X76) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_9])]) ).
fof(c_0_11,plain,
! [X69,X70,X71] :
( ~ rf2(X69,X70)
| ~ rf2(X69,X71)
| X70 = X71 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])]) ).
fof(c_0_12,plain,
! [X77,X78] :
( ~ rf3(X77,X78)
| rf2(X77,X78) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_10])]) ).
fof(c_0_13,plain,
! [X58,X59,X60] :
( ( ~ cp1(X58)
| ~ ra_Px1(X58,X59) )
& ( ra_Px1(X60,esk4_1(X60))
| cp1(X60) ) ),
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,
! [X62,X64,X65] :
( ( ~ cp1xcomp(X62)
| ra_Px1(X62,esk5_1(X62)) )
& ( ~ ra_Px1(X64,X65)
| cp1xcomp(X64) ) ),
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
| ~ rf1(X1,X2)
| ~ rf1(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( rf1(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
( rf1(X1,X2)
| ~ rf3(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( rf3(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,plain,
( X2 = X3
| ~ rf2(X1,X2)
| ~ rf2(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
( rf2(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,plain,
( rf2(X1,X2)
| ~ rf3(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,plain,
( ~ cp1(X1)
| ~ ra_Px1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,plain,
( ra_Px1(X1,esk5_1(X1))
| ~ cp1xcomp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
( X1 = esk2_1(X2)
| ~ rf1(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_25,plain,
( rf1(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,plain,
( X1 = esk3_1(X2)
| ~ rf2(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
( rf2(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_28,plain,
( ~ cp1xcomp(X1)
| ~ cp1(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( cp1xcomp(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_30,plain,
( esk1_1(X1) = esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( esk1_1(X1) = esk3_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( ~ cp1(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( esk3_1(X1) = esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
( cp1(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_35,plain,
cUnsatisfiable(i2003_11_14_17_20_57644),
inference(split_conjunct,[status(thm)],[axiom_8]) ).
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.12 % Problem : KRS106+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.13/0.33 % Computer : n013.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Aug 28 01:47:17 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.20/0.55 start to proof: theBenchmark
% 0.20/0.56 % Version : CSE_E---1.5
% 0.20/0.56 % Problem : theBenchmark.p
% 0.20/0.56 % Proof found
% 0.20/0.56 % SZS status Theorem for theBenchmark.p
% 0.20/0.56 % SZS output start Proof
% See solution above
% 0.20/0.57 % Total time : 0.009000 s
% 0.20/0.57 % SZS output end Proof
% 0.20/0.57 % Total time : 0.012000 s
%------------------------------------------------------------------------------