TSTP Solution File: KRS077+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : KRS077+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 : n015.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.22s 0.60s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 19
% Syntax : Number of formulae : 38 ( 4 unt; 15 typ; 0 def)
% Number of atoms : 121 ( 8 equ)
% Maximal formula atoms : 57 ( 5 avg)
% Number of connectives : 156 ( 58 ~; 66 |; 24 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 14 >; 4 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 48 ( 1 sgn; 23 !; 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,
cp: $i > $o ).
tff(decl_26,type,
rinvS: ( $i * $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_19_09372: $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_2: ( $i * $i ) > $i ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ! [X5,X6] :
( ( rr(X4,X5)
& rr(X4,X6) )
=> X5 = X6 )
& ? [X7] :
( rr(X4,X7)
& ! [X8] :
( rinvS(X7,X8)
=> cp(X8) ) )
& ~ cp(X4)
& ? [X7] :
( rs(X4,X7)
& cp(X7) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_5,axiom,
! [X4,X7] :
( rs(X4,X7)
=> rr(X4,X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_3,axiom,
! [X4,X7] :
( rinvS(X4,X7)
<=> rs(X7,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
cUnsatisfiable(i2003_11_14_17_19_09372),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(c_0_4,plain,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ! [X5,X6] :
( ( rr(X4,X5)
& rr(X4,X6) )
=> X5 = X6 )
& ? [X7] :
( rr(X4,X7)
& ! [X8] :
( rinvS(X7,X8)
=> cp(X8) ) )
& ~ cp(X4)
& ? [X7] :
( rs(X4,X7)
& cp(X7) ) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_5,plain,
! [X41,X42,X43,X45,X47,X50,X52] :
( ( ~ rr(X41,X42)
| ~ rr(X41,X43)
| X42 = X43
| ~ cUnsatisfiable(X41) )
& ( rr(X41,esk1_1(X41))
| ~ cUnsatisfiable(X41) )
& ( ~ rinvS(esk1_1(X41),X45)
| cp(X45)
| ~ cUnsatisfiable(X41) )
& ( ~ cp(X41)
| ~ cUnsatisfiable(X41) )
& ( rs(X41,esk2_1(X41))
| ~ cUnsatisfiable(X41) )
& ( cp(esk2_1(X41))
| ~ cUnsatisfiable(X41) )
& ( rinvS(X50,esk5_2(X47,X50))
| ~ rr(X47,X50)
| rr(X47,esk3_1(X47))
| cp(X47)
| ~ rs(X47,X52)
| ~ cp(X52)
| cUnsatisfiable(X47) )
& ( ~ cp(esk5_2(X47,X50))
| ~ rr(X47,X50)
| rr(X47,esk3_1(X47))
| cp(X47)
| ~ rs(X47,X52)
| ~ cp(X52)
| cUnsatisfiable(X47) )
& ( rinvS(X50,esk5_2(X47,X50))
| ~ rr(X47,X50)
| rr(X47,esk4_1(X47))
| cp(X47)
| ~ rs(X47,X52)
| ~ cp(X52)
| cUnsatisfiable(X47) )
& ( ~ cp(esk5_2(X47,X50))
| ~ rr(X47,X50)
| rr(X47,esk4_1(X47))
| cp(X47)
| ~ rs(X47,X52)
| ~ cp(X52)
| cUnsatisfiable(X47) )
& ( rinvS(X50,esk5_2(X47,X50))
| ~ rr(X47,X50)
| esk3_1(X47) != esk4_1(X47)
| cp(X47)
| ~ rs(X47,X52)
| ~ cp(X52)
| cUnsatisfiable(X47) )
& ( ~ cp(esk5_2(X47,X50))
| ~ rr(X47,X50)
| esk3_1(X47) != esk4_1(X47)
| cp(X47)
| ~ rs(X47,X52)
| ~ cp(X52)
| cUnsatisfiable(X47) ) ),
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)],[c_0_4])])])])])]) ).
fof(c_0_6,plain,
! [X55,X56] :
( ~ rs(X55,X56)
| rr(X55,X56) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])]) ).
fof(c_0_7,plain,
! [X53,X54] :
( ( ~ rinvS(X53,X54)
| rs(X54,X53) )
& ( ~ rs(X54,X53)
| rinvS(X53,X54) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])]) ).
cnf(c_0_8,plain,
( X2 = X3
| ~ rr(X1,X2)
| ~ rr(X1,X3)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( rr(X1,X2)
| ~ rs(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( rs(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( cp(X2)
| ~ rinvS(esk1_1(X1),X2)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
( rinvS(X2,X1)
| ~ rs(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( X1 = esk1_1(X2)
| ~ rr(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,plain,
( rr(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( cp(X1)
| ~ rs(X1,esk1_1(X2))
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( esk1_1(X1) = esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( cp(X1)
| ~ rs(X1,esk2_1(X2))
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,plain,
( ~ cp(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,plain,
cUnsatisfiable(i2003_11_14_17_19_09372),
inference(split_conjunct,[status(thm)],[axiom_4]) ).
cnf(c_0_21,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_11]),c_0_19]) ).
cnf(c_0_22,plain,
$false,
inference(sr,[status(thm)],[c_0_20,c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KRS077+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.15/0.35 % Computer : n015.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Aug 28 02:04:24 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.59 start to proof: theBenchmark
% 0.22/0.60 % Version : CSE_E---1.5
% 0.22/0.60 % Problem : theBenchmark.p
% 0.22/0.60 % Proof found
% 0.22/0.60 % SZS status Theorem for theBenchmark.p
% 0.22/0.60 % SZS output start Proof
% See solution above
% 0.22/0.61 % Total time : 0.008000 s
% 0.22/0.61 % SZS output end Proof
% 0.22/0.61 % Total time : 0.011000 s
%------------------------------------------------------------------------------