TSTP Solution File: KRS089+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : KRS089+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 : n008.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:12 EDT 2023
% Result : Unsatisfiable 0.20s 0.56s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 20
% Syntax : Number of formulae : 42 ( 8 unt; 14 typ; 0 def)
% Number of atoms : 82 ( 27 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 90 ( 36 ~; 32 |; 18 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 12 >; 3 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-1 aty)
% Number of variables : 41 ( 5 sgn; 17 !; 4 ?; 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,
rinvP: ( $i * $i ) > $o ).
tff(decl_26,type,
rp: ( $i * $i ) > $o ).
tff(decl_27,type,
rr: ( $i * $i ) > $o ).
tff(decl_28,type,
xsd_integer: $i > $o ).
tff(decl_29,type,
xsd_string: $i > $o ).
tff(decl_30,type,
ispy: $i ).
tff(decl_31,type,
i2003_11_14_17_19_53168: $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 ).
fof(axiom_0,axiom,
! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).
fof(axiom_3,axiom,
! [X4] :
( cowlThing(X4)
=> ? [X8] :
( rp(X4,X8)
& X8 = ispy ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
! [X4,X8] :
( rp(X4,X8)
<=> rinvP(X8,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_5,axiom,
! [X9,X10,X11] :
( ( rinvP(ispy,X9)
& rinvP(ispy,X10)
& rinvP(ispy,X11) )
=> ( X9 = X10
| X9 = X11
| X10 = X11 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
=> ? [X5,X6,X7] :
( rr(X4,X5)
& rr(X4,X6)
& rr(X4,X7)
& X5 != X6
& X5 != X7
& X6 != X7 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_7,axiom,
cUnsatisfiable(i2003_11_14_17_19_53168),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(c_0_6,plain,
! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_7,plain,
! [X46] :
( ( rp(X46,esk4_1(X46))
| ~ cowlThing(X46) )
& ( esk4_1(X46) = ispy
| ~ cowlThing(X46) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])])]) ).
fof(c_0_8,plain,
! [X40] :
( cowlThing(X40)
& ~ cowlNothing(X40) ),
inference(variable_rename,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( esk4_1(X1) = ispy
| ~ cowlThing(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X48,X49] :
( ( ~ rp(X48,X49)
| rinvP(X49,X48) )
& ( ~ rinvP(X49,X48)
| rp(X48,X49) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])]) ).
cnf(c_0_12,plain,
( rp(X1,esk4_1(X1))
| ~ cowlThing(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
esk4_1(X1) = ispy,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
fof(c_0_14,plain,
! [X50,X51,X52] :
( ~ rinvP(ispy,X50)
| ~ rinvP(ispy,X51)
| ~ rinvP(ispy,X52)
| X50 = X51
| X50 = X52
| X51 = X52 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])]) ).
cnf(c_0_15,plain,
( rinvP(X2,X1)
| ~ rp(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
rp(X1,ispy),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_10])]),c_0_13]) ).
fof(c_0_17,plain,
! [X42] :
( ( rr(X42,esk1_1(X42))
| ~ cUnsatisfiable(X42) )
& ( rr(X42,esk2_1(X42))
| ~ cUnsatisfiable(X42) )
& ( rr(X42,esk3_1(X42))
| ~ cUnsatisfiable(X42) )
& ( esk1_1(X42) != esk2_1(X42)
| ~ cUnsatisfiable(X42) )
& ( esk1_1(X42) != esk3_1(X42)
| ~ cUnsatisfiable(X42) )
& ( esk2_1(X42) != esk3_1(X42)
| ~ cUnsatisfiable(X42) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])])]) ).
cnf(c_0_18,plain,
( X1 = X2
| X1 = X3
| X2 = X3
| ~ rinvP(ispy,X1)
| ~ rinvP(ispy,X2)
| ~ rinvP(ispy,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
rinvP(ispy,X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( esk1_1(X1) != esk3_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
( X1 = X2
| X3 = X2
| X3 = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_19]),c_0_19])]) ).
cnf(c_0_22,plain,
( esk2_1(X1) != esk3_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( esk1_1(X1) = X2
| esk3_1(X1) = X2
| ~ cUnsatisfiable(X1) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_24,plain,
( esk1_1(X1) != esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
cUnsatisfiable(i2003_11_14_17_19_53168),
inference(split_conjunct,[status(thm)],[axiom_7]) ).
cnf(c_0_26,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23])]),c_0_24]) ).
cnf(c_0_27,plain,
$false,
inference(sr,[status(thm)],[c_0_25,c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS089+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n008.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 02:29:17 EDT 2023
% 0.13/0.35 % 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.008000 s
% 0.20/0.57 % SZS output end Proof
% 0.20/0.57 % Total time : 0.011000 s
%------------------------------------------------------------------------------