TSTP Solution File: KRS079+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : KRS079+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 : n011.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:09 EDT 2023
% Result : Unsatisfiable 0.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 22
% Syntax : Number of formulae : 55 ( 5 unt; 14 typ; 0 def)
% Number of atoms : 115 ( 13 equ)
% Maximal formula atoms : 19 ( 2 avg)
% Number of connectives : 132 ( 58 ~; 49 |; 16 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 13 >; 3 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 69 ( 2 sgn; 32 !; 3 ?; 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,
cp2: $i > $o ).
tff(decl_27,type,
rf1: ( $i * $i ) > $o ).
tff(decl_28,type,
rf2: ( $i * $i ) > $o ).
tff(decl_29,type,
rr: ( $i * $i ) > $o ).
tff(decl_30,type,
xsd_integer: $i > $o ).
tff(decl_31,type,
xsd_string: $i > $o ).
tff(decl_32,type,
i2003_11_14_17_19_17492: $i ).
tff(decl_33,type,
esk1_1: $i > $i ).
tff(decl_34,type,
esk2_1: $i > $i ).
tff(decl_35,type,
esk3_1: $i > $i ).
fof(axiom_0,axiom,
! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_0) ).
fof(axiom_4,axiom,
! [X4] :
( cowlThing(X4)
=> ! [X6,X7] :
( ( rf1(X4,X6)
& rf1(X4,X7) )
=> X6 = X7 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_7,axiom,
! [X4,X5] :
( rr(X4,X5)
=> rf1(X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rf2(X4,X5)
& cp2(X5) )
& ? [X5] :
( rf1(X4,X5)
& cp1(X5) )
& ? [X5] :
( rr(X4,X5)
& cowlThing(X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_5,axiom,
! [X4] :
( cowlThing(X4)
=> ! [X6,X7] :
( ( rf2(X4,X6)
& rf2(X4,X7) )
=> X6 = X7 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_8,axiom,
! [X4,X5] :
( rr(X4,X5)
=> rf2(X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
fof(axiom_3,axiom,
! [X4] :
( cp1(X4)
=> ~ cp2(X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_6,axiom,
cUnsatisfiable(i2003_11_14_17_19_17492),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(c_0_8,plain,
! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_9,plain,
! [X51,X52,X53] :
( ~ cowlThing(X51)
| ~ rf1(X51,X52)
| ~ rf1(X51,X53)
| X52 = X53 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])]) ).
fof(c_0_10,plain,
! [X40] :
( cowlThing(X40)
& ~ cowlNothing(X40) ),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X57,X58] :
( ~ rr(X57,X58)
| rf1(X57,X58) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])]) ).
fof(c_0_12,plain,
! [X42,X46,X47,X48,X49] :
( ( rf2(X42,esk1_1(X42))
| ~ cUnsatisfiable(X42) )
& ( cp2(esk1_1(X42))
| ~ cUnsatisfiable(X42) )
& ( rf1(X42,esk2_1(X42))
| ~ cUnsatisfiable(X42) )
& ( cp1(esk2_1(X42))
| ~ cUnsatisfiable(X42) )
& ( rr(X42,esk3_1(X42))
| ~ cUnsatisfiable(X42) )
& ( cowlThing(esk3_1(X42))
| ~ cUnsatisfiable(X42) )
& ( ~ rf2(X46,X47)
| ~ cp2(X47)
| ~ rf1(X46,X48)
| ~ cp1(X48)
| ~ rr(X46,X49)
| ~ cowlThing(X49)
| cUnsatisfiable(X46) ) ),
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_13,plain,
! [X54,X55,X56] :
( ~ cowlThing(X54)
| ~ rf2(X54,X55)
| ~ rf2(X54,X56)
| X55 = X56 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])]) ).
cnf(c_0_14,plain,
( X2 = X3
| ~ cowlThing(X1)
| ~ rf1(X1,X2)
| ~ rf1(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( rf1(X1,X2)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( rr(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( X2 = X3
| ~ cowlThing(X1)
| ~ rf2(X1,X2)
| ~ rf2(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,plain,
! [X59,X60] :
( ~ rr(X59,X60)
| rf2(X59,X60) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_8])]) ).
fof(c_0_20,plain,
! [X4] :
( cp1(X4)
=> ~ cp2(X4) ),
inference(fof_simplification,[status(thm)],[axiom_3]) ).
cnf(c_0_21,plain,
( X2 = X3
| ~ rf1(X1,X3)
| ~ rf1(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
cnf(c_0_22,plain,
( rf1(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
( X2 = X3
| ~ rf2(X1,X3)
| ~ rf2(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_15])]) ).
cnf(c_0_24,plain,
( rf2(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,plain,
( rf2(X1,X2)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_26,plain,
! [X50] :
( ~ cp1(X50)
| ~ cp2(X50) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])]) ).
cnf(c_0_27,plain,
( X1 = esk3_1(X2)
| ~ rf1(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( rf1(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_29,plain,
( X1 = esk1_1(X2)
| ~ rf2(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( rf2(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_17]) ).
cnf(c_0_31,plain,
( ~ cp1(X1)
| ~ cp2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,plain,
( cp2(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_33,plain,
( esk3_1(X1) = esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
( esk3_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
( ~ cp1(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
( esk1_1(X1) = esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
( cp1(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_38,plain,
cUnsatisfiable(i2003_11_14_17_19_17492),
inference(split_conjunct,[status(thm)],[axiom_6]) ).
cnf(c_0_39,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_40,plain,
$false,
inference(sr,[status(thm)],[c_0_38,c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS079+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n011.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:20:10 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.57 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.59 % Total time : 0.009000 s
% 0.19/0.59 % SZS output end Proof
% 0.19/0.59 % Total time : 0.011000 s
%------------------------------------------------------------------------------