TSTP Solution File: KRS095+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : KRS095+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 : n022.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:13 EDT 2023
% Result : Unsatisfiable 0.20s 0.58s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 15
% Syntax : Number of formulae : 24 ( 4 unt; 13 typ; 0 def)
% Number of atoms : 49 ( 11 equ)
% Maximal formula atoms : 25 ( 4 avg)
% Number of connectives : 63 ( 25 ~; 26 |; 10 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 12 >; 1 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 20 ( 1 sgn; 9 !; 2 ?; 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,
xsd_integer: $i > $o ).
tff(decl_29,type,
xsd_string: $i > $o ).
tff(decl_30,type,
i2003_11_14_17_20_14253: $i ).
tff(decl_31,type,
esk1_1: $i > $i ).
tff(decl_32,type,
esk2_1: $i > $i ).
tff(decl_33,type,
esk3_1: $i > $i ).
tff(decl_34,type,
esk4_1: $i > $i ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5,X6] :
( rr(X4,X5)
& rr(X4,X6)
& X5 != X6 )
& ! [X5,X6] :
( ( rr(X4,X5)
& rr(X4,X6) )
=> X5 = X6 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_4,axiom,
cUnsatisfiable(i2003_11_14_17_20_14253),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(c_0_2,plain,
! [X29,X32,X33,X34,X35,X36] :
( ( rr(X29,esk1_1(X29))
| ~ cUnsatisfiable(X29) )
& ( rr(X29,esk2_1(X29))
| ~ cUnsatisfiable(X29) )
& ( esk1_1(X29) != esk2_1(X29)
| ~ cUnsatisfiable(X29) )
& ( ~ rr(X29,X32)
| ~ rr(X29,X33)
| X32 = X33
| ~ cUnsatisfiable(X29) )
& ( rr(X34,esk3_1(X34))
| ~ rr(X34,X35)
| ~ rr(X34,X36)
| X35 = X36
| cUnsatisfiable(X34) )
& ( rr(X34,esk4_1(X34))
| ~ rr(X34,X35)
| ~ rr(X34,X36)
| X35 = X36
| cUnsatisfiable(X34) )
& ( esk3_1(X34) != esk4_1(X34)
| ~ rr(X34,X35)
| ~ rr(X34,X36)
| X35 = X36
| cUnsatisfiable(X34) ) ),
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_3,plain,
( X2 = X3
| ~ rr(X1,X2)
| ~ rr(X1,X3)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,plain,
( rr(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,plain,
( X1 = esk2_1(X2)
| ~ rr(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,plain,
( esk1_1(X1) != esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,plain,
cUnsatisfiable(i2003_11_14_17_20_14253),
inference(split_conjunct,[status(thm)],[axiom_4]) ).
cnf(c_0_9,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
cnf(c_0_10,plain,
$false,
inference(sr,[status(thm)],[c_0_8,c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS095+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n022.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 01:05:24 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.56 start to proof: theBenchmark
% 0.20/0.58 % Version : CSE_E---1.5
% 0.20/0.58 % Problem : theBenchmark.p
% 0.20/0.58 % Proof found
% 0.20/0.58 % SZS status Theorem for theBenchmark.p
% 0.20/0.58 % SZS output start Proof
% See solution above
% 0.20/0.58 % Total time : 0.006000 s
% 0.20/0.58 % SZS output end Proof
% 0.20/0.58 % Total time : 0.009000 s
%------------------------------------------------------------------------------