TSTP Solution File: KRS067+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : KRS067+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 : n016.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:06 EDT 2023
% Result : Unsatisfiable 0.23s 0.62s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of formulae : 31 ( 4 unt; 9 typ; 0 def)
% Number of atoms : 96 ( 0 equ)
% Maximal formula atoms : 41 ( 4 avg)
% Number of connectives : 112 ( 38 ~; 56 |; 14 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 19 ( 1 sgn; 7 !; 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,
cc: $i > $o ).
tff(decl_28,type,
cb: $i > $o ).
tff(decl_29,type,
ca: $i > $o ).
tff(decl_30,type,
i2003_11_14_17_18_1956: $i ).
fof(axiom_2,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ( cc(X1)
& cb(X1) )
| ( cb(X1)
& ca(X1) )
| ( cc(X1)
& ca(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_3,axiom,
! [X1] :
( ca(X1)
=> ~ ( cc(X1)
| cb(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
! [X1] :
( cb(X1)
=> ~ cc(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_5,axiom,
cUnsatisfiable(i2003_11_14_17_18_1956),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(c_0_4,plain,
! [X4] :
( ( cc(X4)
| cb(X4)
| cc(X4)
| ~ cUnsatisfiable(X4) )
& ( ca(X4)
| cb(X4)
| cc(X4)
| ~ cUnsatisfiable(X4) )
& ( cc(X4)
| ca(X4)
| cc(X4)
| ~ cUnsatisfiable(X4) )
& ( ca(X4)
| ca(X4)
| cc(X4)
| ~ cUnsatisfiable(X4) )
& ( cc(X4)
| cb(X4)
| cb(X4)
| ~ cUnsatisfiable(X4) )
& ( ca(X4)
| cb(X4)
| cb(X4)
| ~ cUnsatisfiable(X4) )
& ( cc(X4)
| ca(X4)
| cb(X4)
| ~ cUnsatisfiable(X4) )
& ( ca(X4)
| ca(X4)
| cb(X4)
| ~ cUnsatisfiable(X4) )
& ( ~ cc(X4)
| ~ cb(X4)
| cUnsatisfiable(X4) )
& ( ~ cb(X4)
| ~ ca(X4)
| cUnsatisfiable(X4) )
& ( ~ cc(X4)
| ~ ca(X4)
| cUnsatisfiable(X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])]) ).
fof(c_0_5,plain,
! [X5] :
( ( ~ cc(X5)
| ~ ca(X5) )
& ( ~ cb(X5)
| ~ ca(X5) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])]) ).
cnf(c_0_6,plain,
( ca(X1)
| ca(X1)
| cc(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( cc(X1)
| cb(X1)
| cb(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,plain,
! [X1] :
( cb(X1)
=> ~ cc(X1) ),
inference(fof_simplification,[status(thm)],[axiom_4]) ).
cnf(c_0_9,plain,
( ca(X1)
| ca(X1)
| cb(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
( ~ cb(X1)
| ~ ca(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( cc(X1)
| ca(X1)
| ~ cUnsatisfiable(X1) ),
inference(cn,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( cc(X1)
| cb(X1)
| ~ cUnsatisfiable(X1) ),
inference(cn,[status(thm)],[c_0_7]) ).
fof(c_0_13,plain,
! [X6] :
( ~ cb(X6)
| ~ cc(X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).
cnf(c_0_14,plain,
( ~ cc(X1)
| ~ ca(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( cb(X1)
| ca(X1)
| ~ cUnsatisfiable(X1) ),
inference(cn,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( cc(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_17,plain,
( ~ cb(X1)
| ~ cc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( cb(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,plain,
cUnsatisfiable(i2003_11_14_17_18_1956),
inference(split_conjunct,[status(thm)],[axiom_5]) ).
cnf(c_0_20,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_16]) ).
cnf(c_0_21,plain,
$false,
inference(sr,[status(thm)],[c_0_19,c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : KRS067+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.16/0.36 % Computer : n016.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Mon Aug 28 02:50:14 EDT 2023
% 0.16/0.36 % CPUTime :
% 0.23/0.60 start to proof: theBenchmark
% 0.23/0.62 % Version : CSE_E---1.5
% 0.23/0.62 % Problem : theBenchmark.p
% 0.23/0.62 % Proof found
% 0.23/0.62 % SZS status Theorem for theBenchmark.p
% 0.23/0.62 % SZS output start Proof
% See solution above
% 0.23/0.62 % Total time : 0.005000 s
% 0.23/0.62 % SZS output end Proof
% 0.23/0.62 % Total time : 0.008000 s
%------------------------------------------------------------------------------