TSTP Solution File: KRS101+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : KRS101+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 : n005.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:15 EDT 2023
% Result : Unsatisfiable 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 20
% Syntax : Number of formulae : 40 ( 8 unt; 17 typ; 0 def)
% Number of atoms : 141 ( 22 equ)
% Maximal formula atoms : 87 ( 6 avg)
% Number of connectives : 191 ( 73 ~; 91 |; 21 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 16 >; 2 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-1 aty)
% Number of variables : 34 ( 0 sgn; 17 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
cUnsatisfiable: $i > $o ).
tff(decl_23,type,
cc: $i > $o ).
tff(decl_24,type,
cd: $i > $o ).
tff(decl_25,type,
cowlNothing: $i > $o ).
tff(decl_26,type,
cowlThing: $i > $o ).
tff(decl_27,type,
rr: ( $i * $i ) > $o ).
tff(decl_28,type,
rs: ( $i * $i ) > $o ).
tff(decl_29,type,
xsd_integer: $i > $o ).
tff(decl_30,type,
xsd_string: $i > $o ).
tff(decl_31,type,
i2003_11_14_17_20_36582: $i ).
tff(decl_32,type,
esk1_1: $i > $i ).
tff(decl_33,type,
esk2_1: $i > $i ).
tff(decl_34,type,
esk3_1: $i > $i ).
tff(decl_35,type,
esk4_1: $i > $i ).
tff(decl_36,type,
esk5_1: $i > $i ).
tff(decl_37,type,
esk6_1: $i > $i ).
tff(decl_38,type,
esk7_1: $i > $i ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ! [X5] :
( rr(X4,X5)
=> cd(X5) )
& ! [X5] :
( rr(X4,X5)
=> ( ~ ? [X6,X7] :
( rs(X5,X6)
& rs(X5,X7)
& X6 != X7 )
| cc(X5) ) )
& ? [X5] :
( rr(X4,X5)
& ~ ! [X6,X7] :
( ( rs(X5,X6)
& rs(X5,X7) )
=> X6 = X7 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_4,axiom,
cUnsatisfiable(i2003_11_14_17_20_36582),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_3,axiom,
! [X4] :
( cc(X4)
=> ~ cd(X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(c_0_3,plain,
! [X36,X37,X38,X39,X40,X44,X49,X50,X51] :
( ( ~ rr(X36,X37)
| cd(X37)
| ~ cUnsatisfiable(X36) )
& ( ~ rr(X36,X38)
| ~ rs(X38,X39)
| ~ rs(X38,X40)
| X39 = X40
| cc(X38)
| ~ cUnsatisfiable(X36) )
& ( rr(X36,esk1_1(X36))
| ~ cUnsatisfiable(X36) )
& ( rs(esk1_1(X36),esk2_1(X36))
| ~ cUnsatisfiable(X36) )
& ( rs(esk1_1(X36),esk3_1(X36))
| ~ cUnsatisfiable(X36) )
& ( esk2_1(X36) != esk3_1(X36)
| ~ cUnsatisfiable(X36) )
& ( rr(X44,esk5_1(X44))
| rr(X44,esk4_1(X44))
| ~ rr(X44,X49)
| ~ rs(X49,X50)
| ~ rs(X49,X51)
| X50 = X51
| cUnsatisfiable(X44) )
& ( rs(esk5_1(X44),esk6_1(X44))
| rr(X44,esk4_1(X44))
| ~ rr(X44,X49)
| ~ rs(X49,X50)
| ~ rs(X49,X51)
| X50 = X51
| cUnsatisfiable(X44) )
& ( rs(esk5_1(X44),esk7_1(X44))
| rr(X44,esk4_1(X44))
| ~ rr(X44,X49)
| ~ rs(X49,X50)
| ~ rs(X49,X51)
| X50 = X51
| cUnsatisfiable(X44) )
& ( esk6_1(X44) != esk7_1(X44)
| rr(X44,esk4_1(X44))
| ~ rr(X44,X49)
| ~ rs(X49,X50)
| ~ rs(X49,X51)
| X50 = X51
| cUnsatisfiable(X44) )
& ( ~ cc(esk5_1(X44))
| rr(X44,esk4_1(X44))
| ~ rr(X44,X49)
| ~ rs(X49,X50)
| ~ rs(X49,X51)
| X50 = X51
| cUnsatisfiable(X44) )
& ( rr(X44,esk5_1(X44))
| ~ cd(esk4_1(X44))
| ~ rr(X44,X49)
| ~ rs(X49,X50)
| ~ rs(X49,X51)
| X50 = X51
| cUnsatisfiable(X44) )
& ( rs(esk5_1(X44),esk6_1(X44))
| ~ cd(esk4_1(X44))
| ~ rr(X44,X49)
| ~ rs(X49,X50)
| ~ rs(X49,X51)
| X50 = X51
| cUnsatisfiable(X44) )
& ( rs(esk5_1(X44),esk7_1(X44))
| ~ cd(esk4_1(X44))
| ~ rr(X44,X49)
| ~ rs(X49,X50)
| ~ rs(X49,X51)
| X50 = X51
| cUnsatisfiable(X44) )
& ( esk6_1(X44) != esk7_1(X44)
| ~ cd(esk4_1(X44))
| ~ rr(X44,X49)
| ~ rs(X49,X50)
| ~ rs(X49,X51)
| X50 = X51
| cUnsatisfiable(X44) )
& ( ~ cc(esk5_1(X44))
| ~ cd(esk4_1(X44))
| ~ rr(X44,X49)
| ~ rs(X49,X50)
| ~ rs(X49,X51)
| X50 = X51
| cUnsatisfiable(X44) ) ),
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])])])])])]) ).
cnf(c_0_4,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,plain,
cUnsatisfiable(i2003_11_14_17_20_36582),
inference(split_conjunct,[status(thm)],[axiom_4]) ).
cnf(c_0_6,plain,
( X3 = X4
| cc(X2)
| ~ rr(X1,X2)
| ~ rs(X2,X3)
| ~ rs(X2,X4)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
rr(i2003_11_14_17_20_36582,esk1_1(i2003_11_14_17_20_36582)),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,plain,
( rs(esk1_1(X1),esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_9,plain,
! [X4] :
( cc(X4)
=> ~ cd(X4) ),
inference(fof_simplification,[status(thm)],[axiom_3]) ).
cnf(c_0_10,plain,
( X1 = X2
| cc(esk1_1(i2003_11_14_17_20_36582))
| ~ rs(esk1_1(i2003_11_14_17_20_36582),X2)
| ~ rs(esk1_1(i2003_11_14_17_20_36582),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_5])]) ).
cnf(c_0_11,plain,
rs(esk1_1(i2003_11_14_17_20_36582),esk3_1(i2003_11_14_17_20_36582)),
inference(spm,[status(thm)],[c_0_8,c_0_5]) ).
cnf(c_0_12,plain,
( rs(esk1_1(X1),esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_13,plain,
! [X52] :
( ~ cc(X52)
| ~ cd(X52) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).
cnf(c_0_14,plain,
( X1 = esk3_1(i2003_11_14_17_20_36582)
| cc(esk1_1(i2003_11_14_17_20_36582))
| ~ rs(esk1_1(i2003_11_14_17_20_36582),X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
rs(esk1_1(i2003_11_14_17_20_36582),esk2_1(i2003_11_14_17_20_36582)),
inference(spm,[status(thm)],[c_0_12,c_0_5]) ).
cnf(c_0_16,plain,
( cd(X2)
| ~ rr(X1,X2)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_17,plain,
( ~ cc(X1)
| ~ cd(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( esk3_1(i2003_11_14_17_20_36582) = esk2_1(i2003_11_14_17_20_36582)
| cc(esk1_1(i2003_11_14_17_20_36582)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
cd(esk1_1(i2003_11_14_17_20_36582)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_7]),c_0_5])]) ).
cnf(c_0_20,plain,
( esk2_1(X1) != esk3_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_21,plain,
esk3_1(i2003_11_14_17_20_36582) = esk2_1(i2003_11_14_17_20_36582),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_22,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_5])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS101+1 : TPTP v8.1.2. Released v3.1.0.
% 0.11/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33 % Computer : n005.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 02:27:38 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.20/0.50 start to proof: theBenchmark
% 0.20/0.52 % Version : CSE_E---1.5
% 0.20/0.52 % Problem : theBenchmark.p
% 0.20/0.52 % Proof found
% 0.20/0.52 % SZS status Theorem for theBenchmark.p
% 0.20/0.52 % SZS output start Proof
% See solution above
% 0.20/0.52 % Total time : 0.008000 s
% 0.20/0.52 % SZS output end Proof
% 0.20/0.52 % Total time : 0.011000 s
%------------------------------------------------------------------------------