TSTP Solution File: KRS068+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : KRS068+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 : n018.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:07 EDT 2023
% Result : Unsatisfiable 0.19s 0.59s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 15
% Syntax : Number of formulae : 29 ( 4 unt; 10 typ; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 37 ( 16 ~; 13 |; 1 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 9 >; 1 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 20 ( 1 sgn; 12 !; 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,
cd: $i > $o ).
tff(decl_29,type,
rr: ( $i * $i ) > $o ).
tff(decl_30,type,
i2003_11_14_17_18_23845: $i ).
tff(decl_31,type,
esk1_1: $i > $i ).
fof(axiom_3,axiom,
! [X1] :
( cUnsatisfiable(X1)
=> ~ cd(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
! [X1] :
( cc(X1)
=> ! [X2] :
( rr(X1,X2)
=> cc(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_6,axiom,
! [X1] :
( ! [X2] :
( rr(X1,X2)
=> cc(X2) )
=> cd(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_2,axiom,
! [X1] :
( cUnsatisfiable(X1)
=> cc(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_5,axiom,
cUnsatisfiable(i2003_11_14_17_18_23845),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(c_0_5,plain,
! [X1] :
( cUnsatisfiable(X1)
=> ~ cd(X1) ),
inference(fof_simplification,[status(thm)],[axiom_3]) ).
fof(c_0_6,plain,
! [X7,X8] :
( ~ cc(X7)
| ~ rr(X7,X8)
| cc(X8) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])]) ).
fof(c_0_7,plain,
! [X9] :
( ( rr(X9,esk1_1(X9))
| cd(X9) )
& ( ~ cc(esk1_1(X9))
| cd(X9) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])])])]) ).
fof(c_0_8,plain,
! [X6] :
( ~ cUnsatisfiable(X6)
| ~ cd(X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
cnf(c_0_9,plain,
( cc(X2)
| ~ cc(X1)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( rr(X1,esk1_1(X1))
| cd(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( cd(X1)
| ~ cc(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X5] :
( ~ cUnsatisfiable(X5)
| cc(X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])]) ).
cnf(c_0_13,plain,
( ~ cUnsatisfiable(X1)
| ~ cd(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( cd(X1)
| ~ cc(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_15,plain,
( cc(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
cUnsatisfiable(i2003_11_14_17_18_23845),
inference(split_conjunct,[status(thm)],[axiom_5]) ).
cnf(c_0_17,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_18,plain,
$false,
inference(sr,[status(thm)],[c_0_16,c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS068+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.15/0.34 % Computer : n018.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Mon Aug 28 01:58:02 EDT 2023
% 0.15/0.34 % CPUTime :
% 0.19/0.58 start to proof: theBenchmark
% 0.19/0.59 % Version : CSE_E---1.5
% 0.19/0.59 % Problem : theBenchmark.p
% 0.19/0.59 % Proof found
% 0.19/0.59 % SZS status Theorem for theBenchmark.p
% 0.19/0.59 % SZS output start Proof
% See solution above
% 0.19/0.59 % Total time : 0.006000 s
% 0.19/0.59 % SZS output end Proof
% 0.19/0.59 % Total time : 0.008000 s
%------------------------------------------------------------------------------