TSTP Solution File: KRS087+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : KRS087+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 : n003.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:11 EDT 2023
% Result : Unsatisfiable 0.20s 0.61s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 18
% Syntax : Number of formulae : 34 ( 4 unt; 14 typ; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 23 ( 3 avg)
% Number of connectives : 92 ( 37 ~; 33 |; 16 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 19 ( 13 >; 6 *; 0 +; 0 <<)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-3 aty)
% Number of variables : 39 ( 1 sgn; 19 !; 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,
cp1: $i > $o ).
tff(decl_26,type,
rf: ( $i * $i ) > $o ).
tff(decl_27,type,
rinvF: ( $i * $i ) > $o ).
tff(decl_28,type,
rinvR: ( $i * $i ) > $o ).
tff(decl_29,type,
rr: ( $i * $i ) > $o ).
tff(decl_30,type,
xsd_integer: $i > $o ).
tff(decl_31,type,
xsd_string: $i > $o ).
tff(decl_32,type,
i2003_11_14_17_19_46763: $i ).
tff(decl_33,type,
esk1_1: $i > $i ).
tff(decl_34,type,
esk2_1: $i > $i ).
tff(decl_35,type,
esk3_3: ( $i * $i * $i ) > $i ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( cp1(X4)
& ? [X5] :
( rr(X4,X5)
& ? [X6] :
( rr(X5,X6)
& ! [X7] :
( rinvR(X6,X7)
=> ~ cp1(X7) )
& cp1(X6) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_6,axiom,
! [X4,X5,X6] :
( ( rr(X4,X5)
& rr(X5,X6) )
=> rr(X4,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_5,axiom,
! [X4,X5] :
( rinvR(X4,X5)
<=> rr(X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_7,axiom,
cUnsatisfiable(i2003_11_14_17_19_46763),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(c_0_4,plain,
! [X4] :
( cUnsatisfiable(X4)
<=> ( cp1(X4)
& ? [X5] :
( rr(X4,X5)
& ? [X6] :
( rr(X5,X6)
& ! [X7] :
( rinvR(X6,X7)
=> ~ cp1(X7) )
& cp1(X6) ) ) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_5,plain,
! [X61,X62,X63] :
( ~ rr(X61,X62)
| ~ rr(X62,X63)
| rr(X61,X63) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])]) ).
fof(c_0_6,plain,
! [X46,X49,X50,X51,X52] :
( ( cp1(X46)
| ~ cUnsatisfiable(X46) )
& ( rr(X46,esk1_1(X46))
| ~ cUnsatisfiable(X46) )
& ( rr(esk1_1(X46),esk2_1(X46))
| ~ cUnsatisfiable(X46) )
& ( ~ rinvR(esk2_1(X46),X49)
| ~ cp1(X49)
| ~ cUnsatisfiable(X46) )
& ( cp1(esk2_1(X46))
| ~ cUnsatisfiable(X46) )
& ( rinvR(X52,esk3_3(X50,X51,X52))
| ~ rr(X51,X52)
| ~ cp1(X52)
| ~ rr(X50,X51)
| ~ cp1(X50)
| cUnsatisfiable(X50) )
& ( cp1(esk3_3(X50,X51,X52))
| ~ rr(X51,X52)
| ~ cp1(X52)
| ~ rr(X50,X51)
| ~ cp1(X50)
| cUnsatisfiable(X50) ) ),
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_7,plain,
! [X59,X60] :
( ( ~ rinvR(X59,X60)
| rr(X60,X59) )
& ( ~ rr(X60,X59)
| rinvR(X59,X60) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])]) ).
cnf(c_0_8,plain,
( rr(X1,X3)
| ~ rr(X1,X2)
| ~ rr(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( rr(esk1_1(X1),esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ rinvR(esk2_1(X1),X2)
| ~ cp1(X2)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( rinvR(X2,X1)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( rr(X1,esk2_1(X2))
| ~ rr(X1,esk1_1(X2))
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
( ~ rr(X1,esk2_1(X2))
| ~ cp1(X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( rr(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( cp1(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,plain,
cUnsatisfiable(i2003_11_14_17_19_46763),
inference(split_conjunct,[status(thm)],[axiom_7]) ).
cnf(c_0_18,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,plain,
$false,
inference(sr,[status(thm)],[c_0_17,c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KRS087+1 : TPTP v8.1.2. Released v3.1.0.
% 0.13/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35 % Computer : n003.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 28 01:07:10 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.59 start to proof: theBenchmark
% 0.20/0.61 % Version : CSE_E---1.5
% 0.20/0.61 % Problem : theBenchmark.p
% 0.20/0.61 % Proof found
% 0.20/0.61 % SZS status Theorem for theBenchmark.p
% 0.20/0.61 % SZS output start Proof
% See solution above
% 0.20/0.61 % Total time : 0.007000 s
% 0.20/0.61 % SZS output end Proof
% 0.20/0.61 % Total time : 0.010000 s
%------------------------------------------------------------------------------