TSTP Solution File: KRS105+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : KRS105+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 : n024.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.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 23
% Syntax : Number of formulae : 46 ( 5 unt; 15 typ; 0 def)
% Number of atoms : 70 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 69 ( 30 ~; 26 |; 4 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 14 >; 2 *; 0 +; 0 <<)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 39 ( 1 sgn; 23 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
cowlThing: $i > $o ).
tff(decl_23,type,
cowlNothing: $i > $o ).
tff(decl_24,type,
xsd_string: $i > $o ).
tff(decl_25,type,
xsd_integer: $i > $o ).
tff(decl_26,type,
cUnsatisfiable: $i > $o ).
tff(decl_27,type,
cdxcomp: $i > $o ).
tff(decl_28,type,
cc: $i > $o ).
tff(decl_29,type,
rr: ( $i * $i ) > $o ).
tff(decl_30,type,
cd: $i > $o ).
tff(decl_31,type,
ra_Px1: ( $i * $i ) > $o ).
tff(decl_32,type,
ca_Ax2: $i > $o ).
tff(decl_33,type,
i2003_11_14_17_20_53634: $i ).
tff(decl_34,type,
esk1_1: $i > $i ).
tff(decl_35,type,
esk2_1: $i > $i ).
tff(decl_36,type,
esk3_1: $i > $i ).
fof(axiom_5,axiom,
! [X1] :
( cd(X1)
<=> ~ ? [X2] : ra_Px1(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_6,axiom,
! [X1] :
( cdxcomp(X1)
<=> ? [X3] : ra_Px1(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_2,axiom,
! [X1] :
( cUnsatisfiable(X1)
=> cdxcomp(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_8,axiom,
! [X1] :
( ca_Ax2(X1)
=> cd(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
fof(axiom_4,axiom,
! [X1] :
( cc(X1)
=> ! [X2] :
( rr(X1,X2)
=> cc(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_7,axiom,
! [X1] :
( ca_Ax2(X1)
<=> ! [X2] :
( rr(X1,X2)
=> cc(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(axiom_3,axiom,
! [X1] :
( cUnsatisfiable(X1)
=> cc(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_9,axiom,
cUnsatisfiable(i2003_11_14_17_20_53634),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).
fof(c_0_8,plain,
! [X10,X11,X12] :
( ( ~ cd(X10)
| ~ ra_Px1(X10,X11) )
& ( ra_Px1(X12,esk1_1(X12))
| cd(X12) ) ),
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])])])])]) ).
fof(c_0_9,plain,
! [X14,X16,X17] :
( ( ~ cdxcomp(X14)
| ra_Px1(X14,esk2_1(X14)) )
& ( ~ ra_Px1(X16,X17)
| cdxcomp(X16) ) ),
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])])])])]) ).
cnf(c_0_10,plain,
( ~ cd(X1)
| ~ ra_Px1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( ra_Px1(X1,esk2_1(X1))
| ~ cdxcomp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X6] :
( ~ cUnsatisfiable(X6)
| cdxcomp(X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])]) ).
cnf(c_0_13,plain,
( ~ cd(X1)
| ~ cdxcomp(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( cdxcomp(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X22] :
( ~ ca_Ax2(X22)
| cd(X22) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_8])]) ).
cnf(c_0_16,plain,
( ~ cd(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( cd(X1)
| ~ ca_Ax2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X8,X9] :
( ~ cc(X8)
| ~ rr(X8,X9)
| cc(X9) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])]) ).
fof(c_0_19,plain,
! [X18,X19,X20] :
( ( ~ ca_Ax2(X18)
| ~ rr(X18,X19)
| cc(X19) )
& ( rr(X20,esk3_1(X20))
| ca_Ax2(X20) )
& ( ~ cc(esk3_1(X20))
| ca_Ax2(X20) ) ),
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_7])])])])])]) ).
fof(c_0_20,plain,
! [X7] :
( ~ cUnsatisfiable(X7)
| cc(X7) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])]) ).
cnf(c_0_21,plain,
( ~ ca_Ax2(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
cUnsatisfiable(i2003_11_14_17_20_53634),
inference(split_conjunct,[status(thm)],[axiom_9]) ).
cnf(c_0_23,plain,
( cc(X2)
| ~ cc(X1)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( rr(X1,esk3_1(X1))
| ca_Ax2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( ca_Ax2(X1)
| ~ cc(esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( cc(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
~ ca_Ax2(i2003_11_14_17_20_53634),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( ca_Ax2(X1)
| ~ cc(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_29,plain,
cc(i2003_11_14_17_20_53634),
inference(spm,[status(thm)],[c_0_26,c_0_22]) ).
cnf(c_0_30,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS105+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.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Aug 28 02:11:38 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.006000 s
% 0.19/0.58 % SZS output end Proof
% 0.19/0.58 % Total time : 0.008000 s
%------------------------------------------------------------------------------