TSTP Solution File: KRS091+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : KRS091+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 : n023.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.56s 0.61s
% Output : CNFRefutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 15
% Syntax : Number of formulae : 24 ( 4 unt; 12 typ; 0 def)
% Number of atoms : 26 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 27 ( 13 ~; 8 |; 3 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 9 ( 1 sgn; 5 !; 0 ?; 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,
cd: $i > $o ).
tff(decl_28,type,
cc: $i > $o ).
tff(decl_29,type,
cc1: $i > $o ).
tff(decl_30,type,
cd1: $i > $o ).
tff(decl_31,type,
ce3: $i > $o ).
tff(decl_32,type,
cf: $i > $o ).
tff(decl_33,type,
i2003_11_14_17_20_00819: $i ).
fof(axiom_3,axiom,
! [X1] :
( cc(X1)
=> ~ cd(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_2,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( cd(X1)
& cc(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_8,axiom,
cUnsatisfiable(i2003_11_14_17_20_00819),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
fof(c_0_3,plain,
! [X1] :
( cc(X1)
=> ~ cd(X1) ),
inference(fof_simplification,[status(thm)],[axiom_3]) ).
fof(c_0_4,plain,
! [X5] :
( ~ cc(X5)
| ~ cd(X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
fof(c_0_5,plain,
! [X4] :
( ( cd(X4)
| ~ cUnsatisfiable(X4) )
& ( cc(X4)
| ~ cUnsatisfiable(X4) )
& ( ~ cd(X4)
| ~ cc(X4)
| cUnsatisfiable(X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])]) ).
cnf(c_0_6,plain,
( ~ cc(X1)
| ~ cd(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( cc(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( cd(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
cUnsatisfiable(i2003_11_14_17_20_00819),
inference(split_conjunct,[status(thm)],[axiom_8]) ).
cnf(c_0_10,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_11,plain,
$false,
inference(sr,[status(thm)],[c_0_9,c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : KRS091+1 : TPTP v8.1.2. Released v3.1.0.
% 0.08/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.36 % Computer : n023.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Aug 28 02:15:55 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.22/0.59 start to proof: theBenchmark
% 0.56/0.61 % Version : CSE_E---1.5
% 0.56/0.61 % Problem : theBenchmark.p
% 0.56/0.61 % Proof found
% 0.56/0.61 % SZS status Theorem for theBenchmark.p
% 0.56/0.61 % SZS output start Proof
% See solution above
% 0.56/0.61 % Total time : 0.006000 s
% 0.56/0.61 % SZS output end Proof
% 0.56/0.61 % Total time : 0.008000 s
%------------------------------------------------------------------------------