TSTP Solution File: KRS114+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : KRS114+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n017.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 : Wed Aug 31 17:30:51 EDT 2022
% Result : Unsatisfiable 1.63s 0.57s
% Output : Refutation 1.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 18
% Syntax : Number of formulae : 94 ( 12 unt; 3 typ; 0 def)
% Number of atoms : 325 ( 19 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 365 ( 131 ~; 121 |; 84 &)
% ( 18 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 4 ( 0 usr; 3 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 16 ( 14 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-1 aty)
% Number of variables : 175 ( 134 !; 41 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_19,type,
sQ11_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_20,type,
sQ12_eqProxy: ( $rat * $rat ) > $o ).
tff(pred_def_21,type,
sQ13_eqProxy: ( $real * $real ) > $o ).
fof(f407,plain,
$false,
inference(subsumption_resolution,[],[f372,f406]) ).
fof(f406,plain,
! [X0] : ~ ra_Px1(sK5(i2003_11_14_17_21_262),X0),
inference(resolution,[],[f400,f246]) ).
fof(f246,plain,
! [X2,X0] :
( ~ cp(X0)
| ~ ra_Px1(X0,X2) ),
inference(literal_reordering,[],[f195]) ).
fof(f195,plain,
! [X2,X0] :
( ~ cp(X0)
| ~ ra_Px1(X0,X2) ),
inference(cnf_transformation,[],[f144]) ).
fof(f144,plain,
! [X0] :
( ( cp(X0)
| ra_Px1(X0,sK7(X0)) )
& ( ! [X2] : ~ ra_Px1(X0,X2)
| ~ cp(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f142,f143]) ).
fof(f143,plain,
! [X0] :
( ? [X1] : ra_Px1(X0,X1)
=> ra_Px1(X0,sK7(X0)) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
! [X0] :
( ( cp(X0)
| ? [X1] : ra_Px1(X0,X1) )
& ( ! [X2] : ~ ra_Px1(X0,X2)
| ~ cp(X0) ) ),
inference(rectify,[],[f141]) ).
fof(f141,plain,
! [X0] :
( ( cp(X0)
| ? [X1] : ra_Px1(X0,X1) )
& ( ! [X1] : ~ ra_Px1(X0,X1)
| ~ cp(X0) ) ),
inference(nnf_transformation,[],[f99]) ).
fof(f99,plain,
! [X0] :
( cp(X0)
<=> ! [X1] : ~ ra_Px1(X0,X1) ),
inference(ennf_transformation,[],[f39]) ).
fof(f39,plain,
! [X0] :
( ~ ? [X1] : ra_Px1(X0,X1)
<=> cp(X0) ),
inference(rectify,[],[f26]) ).
fof(f26,axiom,
! [X3] :
( ~ ? [X4] : ra_Px1(X3,X4)
<=> cp(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(f400,plain,
cp(sK5(i2003_11_14_17_21_262)),
inference(forward_demodulation,[],[f399,f386]) ).
fof(f386,plain,
i2003_11_14_17_21_262 = sK0(sK4(i2003_11_14_17_21_262)),
inference(resolution,[],[f362,f345]) ).
fof(f345,plain,
rinvR(sK4(i2003_11_14_17_21_262),sK0(sK4(i2003_11_14_17_21_262))),
inference(resolution,[],[f271,f338]) ).
fof(f338,plain,
ca_Ax4(sK4(i2003_11_14_17_21_262)),
inference(resolution,[],[f237,f275]) ).
fof(f275,plain,
cUnsatisfiable(i2003_11_14_17_21_262),
inference(literal_reordering,[],[f189]) ).
fof(f189,plain,
cUnsatisfiable(i2003_11_14_17_21_262),
inference(cnf_transformation,[],[f34]) ).
fof(f34,axiom,
cUnsatisfiable(i2003_11_14_17_21_262),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_11) ).
fof(f237,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| ca_Ax4(sK4(X0)) ),
inference(literal_reordering,[],[f187]) ).
fof(f187,plain,
! [X0] :
( ca_Ax4(sK4(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f133,plain,
! [X0] :
( ( ( ca_Ax4(sK4(X0))
& rr(X0,sK4(X0))
& ca_Ax3(sK5(X0))
& rs(X0,sK5(X0)) )
| ~ cUnsatisfiable(X0) )
& ( cUnsatisfiable(X0)
| ! [X3] :
( ~ ca_Ax4(X3)
| ~ rr(X0,X3) )
| ! [X4] :
( ~ ca_Ax3(X4)
| ~ rs(X0,X4) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f130,f132,f131]) ).
fof(f131,plain,
! [X0] :
( ? [X1] :
( ca_Ax4(X1)
& rr(X0,X1) )
=> ( ca_Ax4(sK4(X0))
& rr(X0,sK4(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
! [X0] :
( ? [X2] :
( ca_Ax3(X2)
& rs(X0,X2) )
=> ( ca_Ax3(sK5(X0))
& rs(X0,sK5(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f130,plain,
! [X0] :
( ( ( ? [X1] :
( ca_Ax4(X1)
& rr(X0,X1) )
& ? [X2] :
( ca_Ax3(X2)
& rs(X0,X2) ) )
| ~ cUnsatisfiable(X0) )
& ( cUnsatisfiable(X0)
| ! [X3] :
( ~ ca_Ax4(X3)
| ~ rr(X0,X3) )
| ! [X4] :
( ~ ca_Ax3(X4)
| ~ rs(X0,X4) ) ) ),
inference(rectify,[],[f129]) ).
fof(f129,plain,
! [X0] :
( ( ( ? [X2] :
( ca_Ax4(X2)
& rr(X0,X2) )
& ? [X1] :
( ca_Ax3(X1)
& rs(X0,X1) ) )
| ~ cUnsatisfiable(X0) )
& ( cUnsatisfiable(X0)
| ! [X2] :
( ~ ca_Ax4(X2)
| ~ rr(X0,X2) )
| ! [X1] :
( ~ ca_Ax3(X1)
| ~ rs(X0,X1) ) ) ),
inference(flattening,[],[f128]) ).
fof(f128,plain,
! [X0] :
( ( ( ? [X2] :
( ca_Ax4(X2)
& rr(X0,X2) )
& ? [X1] :
( ca_Ax3(X1)
& rs(X0,X1) ) )
| ~ cUnsatisfiable(X0) )
& ( cUnsatisfiable(X0)
| ! [X2] :
( ~ ca_Ax4(X2)
| ~ rr(X0,X2) )
| ! [X1] :
( ~ ca_Ax3(X1)
| ~ rs(X0,X1) ) ) ),
inference(nnf_transformation,[],[f54]) ).
fof(f54,plain,
! [X0] :
( ( ? [X2] :
( ca_Ax4(X2)
& rr(X0,X2) )
& ? [X1] :
( ca_Ax3(X1)
& rs(X0,X1) ) )
<=> cUnsatisfiable(X0) ),
inference(rectify,[],[f25]) ).
fof(f25,axiom,
! [X3] :
( cUnsatisfiable(X3)
<=> ( ? [X4] :
( ca_Ax3(X4)
& rs(X3,X4) )
& ? [X4] :
( ca_Ax4(X4)
& rr(X3,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f271,plain,
! [X0] :
( ~ ca_Ax4(X0)
| rinvR(X0,sK0(X0)) ),
inference(literal_reordering,[],[f168]) ).
fof(f168,plain,
! [X0] :
( rinvR(X0,sK0(X0))
| ~ ca_Ax4(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f118,plain,
! [X0] :
( ( ( ! [X1,X2] :
( ~ rinvR(X0,X1)
| ~ rinvR(X0,X2)
| X1 = X2 )
& ca_Vx5(sK0(X0))
& rinvR(X0,sK0(X0)) )
| ~ ca_Ax4(X0) )
& ( ca_Ax4(X0)
| ( rinvR(X0,sK1(X0))
& rinvR(X0,sK2(X0))
& sK1(X0) != sK2(X0) )
| ! [X6] :
( ~ ca_Vx5(X6)
| ~ rinvR(X0,X6) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f115,f117,f116]) ).
fof(f116,plain,
! [X0] :
( ? [X3] :
( ca_Vx5(X3)
& rinvR(X0,X3) )
=> ( ca_Vx5(sK0(X0))
& rinvR(X0,sK0(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f117,plain,
! [X0] :
( ? [X4,X5] :
( rinvR(X0,X4)
& rinvR(X0,X5)
& X4 != X5 )
=> ( rinvR(X0,sK1(X0))
& rinvR(X0,sK2(X0))
& sK1(X0) != sK2(X0) ) ),
introduced(choice_axiom,[]) ).
fof(f115,plain,
! [X0] :
( ( ( ! [X1,X2] :
( ~ rinvR(X0,X1)
| ~ rinvR(X0,X2)
| X1 = X2 )
& ? [X3] :
( ca_Vx5(X3)
& rinvR(X0,X3) ) )
| ~ ca_Ax4(X0) )
& ( ca_Ax4(X0)
| ? [X4,X5] :
( rinvR(X0,X4)
& rinvR(X0,X5)
& X4 != X5 )
| ! [X6] :
( ~ ca_Vx5(X6)
| ~ rinvR(X0,X6) ) ) ),
inference(rectify,[],[f114]) ).
fof(f114,plain,
! [X0] :
( ( ( ! [X1,X2] :
( ~ rinvR(X0,X1)
| ~ rinvR(X0,X2)
| X1 = X2 )
& ? [X3] :
( ca_Vx5(X3)
& rinvR(X0,X3) ) )
| ~ ca_Ax4(X0) )
& ( ca_Ax4(X0)
| ? [X1,X2] :
( rinvR(X0,X1)
& rinvR(X0,X2)
& X1 != X2 )
| ! [X3] :
( ~ ca_Vx5(X3)
| ~ rinvR(X0,X3) ) ) ),
inference(flattening,[],[f113]) ).
fof(f113,plain,
! [X0] :
( ( ( ! [X1,X2] :
( ~ rinvR(X0,X1)
| ~ rinvR(X0,X2)
| X1 = X2 )
& ? [X3] :
( ca_Vx5(X3)
& rinvR(X0,X3) ) )
| ~ ca_Ax4(X0) )
& ( ca_Ax4(X0)
| ? [X1,X2] :
( rinvR(X0,X1)
& rinvR(X0,X2)
& X1 != X2 )
| ! [X3] :
( ~ ca_Vx5(X3)
| ~ rinvR(X0,X3) ) ) ),
inference(nnf_transformation,[],[f69]) ).
fof(f69,plain,
! [X0] :
( ( ! [X1,X2] :
( ~ rinvR(X0,X1)
| ~ rinvR(X0,X2)
| X1 = X2 )
& ? [X3] :
( ca_Vx5(X3)
& rinvR(X0,X3) ) )
<=> ca_Ax4(X0) ),
inference(flattening,[],[f68]) ).
fof(f68,plain,
! [X0] :
( ( ! [X1,X2] :
( X1 = X2
| ~ rinvR(X0,X1)
| ~ rinvR(X0,X2) )
& ? [X3] :
( ca_Vx5(X3)
& rinvR(X0,X3) ) )
<=> ca_Ax4(X0) ),
inference(ennf_transformation,[],[f51]) ).
fof(f51,plain,
! [X0] :
( ( ! [X1,X2] :
( ( rinvR(X0,X1)
& rinvR(X0,X2) )
=> X1 = X2 )
& ? [X3] :
( ca_Vx5(X3)
& rinvR(X0,X3) ) )
<=> ca_Ax4(X0) ),
inference(rectify,[],[f31]) ).
fof(f31,axiom,
! [X3] :
( ca_Ax4(X3)
<=> ( ! [X6,X5] :
( ( rinvR(X3,X5)
& rinvR(X3,X6) )
=> X5 = X6 )
& ? [X4] :
( ca_Vx5(X4)
& rinvR(X3,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
fof(f362,plain,
! [X0] :
( ~ rinvR(sK4(i2003_11_14_17_21_262),X0)
| i2003_11_14_17_21_262 = X0 ),
inference(subsumption_resolution,[],[f358,f338]) ).
fof(f358,plain,
! [X0] :
( i2003_11_14_17_21_262 = X0
| ~ ca_Ax4(sK4(i2003_11_14_17_21_262))
| ~ rinvR(sK4(i2003_11_14_17_21_262),X0) ),
inference(resolution,[],[f353,f284]) ).
fof(f284,plain,
! [X2,X0,X1] :
( ~ rinvR(X0,X2)
| ~ rinvR(X0,X1)
| ~ ca_Ax4(X0)
| X1 = X2 ),
inference(literal_reordering,[],[f170]) ).
fof(f170,plain,
! [X2,X0,X1] :
( X1 = X2
| ~ rinvR(X0,X1)
| ~ rinvR(X0,X2)
| ~ ca_Ax4(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f353,plain,
rinvR(sK4(i2003_11_14_17_21_262),i2003_11_14_17_21_262),
inference(resolution,[],[f346,f275]) ).
fof(f346,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rinvR(sK4(X0),X0) ),
inference(resolution,[],[f273,f247]) ).
fof(f247,plain,
! [X0,X1] :
( ~ rr(X0,X1)
| rinvR(X1,X0) ),
inference(literal_reordering,[],[f161]) ).
fof(f161,plain,
! [X0,X1] :
( ~ rr(X0,X1)
| rinvR(X1,X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f111,plain,
! [X0,X1] :
( ( rinvR(X1,X0)
| ~ rr(X0,X1) )
& ( rr(X0,X1)
| ~ rinvR(X1,X0) ) ),
inference(rectify,[],[f110]) ).
fof(f110,plain,
! [X1,X0] :
( ( rinvR(X0,X1)
| ~ rr(X1,X0) )
& ( rr(X1,X0)
| ~ rinvR(X0,X1) ) ),
inference(nnf_transformation,[],[f45]) ).
fof(f45,plain,
! [X1,X0] :
( rinvR(X0,X1)
<=> rr(X1,X0) ),
inference(rectify,[],[f33]) ).
fof(f33,axiom,
! [X3,X4] :
( rr(X4,X3)
<=> rinvR(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_10) ).
fof(f273,plain,
! [X0] :
( rr(X0,sK4(X0))
| ~ cUnsatisfiable(X0) ),
inference(literal_reordering,[],[f186]) ).
fof(f186,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rr(X0,sK4(X0)) ),
inference(cnf_transformation,[],[f133]) ).
fof(f399,plain,
cp(sK5(sK0(sK4(i2003_11_14_17_21_262)))),
inference(subsumption_resolution,[],[f394,f275]) ).
fof(f394,plain,
( cp(sK5(sK0(sK4(i2003_11_14_17_21_262))))
| ~ cUnsatisfiable(i2003_11_14_17_21_262) ),
inference(backward_demodulation,[],[f370,f386]) ).
fof(f370,plain,
( ~ cUnsatisfiable(sK0(sK4(i2003_11_14_17_21_262)))
| cp(sK5(sK0(sK4(i2003_11_14_17_21_262)))) ),
inference(resolution,[],[f363,f265]) ).
fof(f265,plain,
! [X0] :
( rs(X0,sK5(X0))
| ~ cUnsatisfiable(X0) ),
inference(literal_reordering,[],[f184]) ).
fof(f184,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rs(X0,sK5(X0)) ),
inference(cnf_transformation,[],[f133]) ).
fof(f363,plain,
! [X0] :
( ~ rs(sK0(sK4(i2003_11_14_17_21_262)),X0)
| cp(X0) ),
inference(resolution,[],[f348,f338]) ).
fof(f348,plain,
! [X0,X1] :
( ~ ca_Ax4(X1)
| ~ rs(sK0(X1),X0)
| cp(X0) ),
inference(resolution,[],[f261,f263]) ).
fof(f263,plain,
! [X0] :
( ca_Vx5(sK0(X0))
| ~ ca_Ax4(X0) ),
inference(literal_reordering,[],[f169]) ).
fof(f169,plain,
! [X0] :
( ~ ca_Ax4(X0)
| ca_Vx5(sK0(X0)) ),
inference(cnf_transformation,[],[f118]) ).
fof(f261,plain,
! [X0,X1] :
( ~ ca_Vx5(X0)
| cp(X1)
| ~ rs(X0,X1) ),
inference(literal_reordering,[],[f201]) ).
fof(f201,plain,
! [X0,X1] :
( ~ rs(X0,X1)
| ~ ca_Vx5(X0)
| cp(X1) ),
inference(cnf_transformation,[],[f149]) ).
fof(f149,plain,
! [X0] :
( ( ! [X1] :
( ~ rs(X0,X1)
| cp(X1) )
| ~ ca_Vx5(X0) )
& ( ca_Vx5(X0)
| ( rs(X0,sK8(X0))
& ~ cp(sK8(X0)) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f147,f148]) ).
fof(f148,plain,
! [X0] :
( ? [X2] :
( rs(X0,X2)
& ~ cp(X2) )
=> ( rs(X0,sK8(X0))
& ~ cp(sK8(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f147,plain,
! [X0] :
( ( ! [X1] :
( ~ rs(X0,X1)
| cp(X1) )
| ~ ca_Vx5(X0) )
& ( ca_Vx5(X0)
| ? [X2] :
( rs(X0,X2)
& ~ cp(X2) ) ) ),
inference(rectify,[],[f146]) ).
fof(f146,plain,
! [X0] :
( ( ! [X1] :
( ~ rs(X0,X1)
| cp(X1) )
| ~ ca_Vx5(X0) )
& ( ca_Vx5(X0)
| ? [X1] :
( rs(X0,X1)
& ~ cp(X1) ) ) ),
inference(nnf_transformation,[],[f86]) ).
fof(f86,plain,
! [X0] :
( ! [X1] :
( ~ rs(X0,X1)
| cp(X1) )
<=> ca_Vx5(X0) ),
inference(ennf_transformation,[],[f48]) ).
fof(f48,plain,
! [X0] :
( ca_Vx5(X0)
<=> ! [X1] :
( rs(X0,X1)
=> cp(X1) ) ),
inference(rectify,[],[f32]) ).
fof(f32,axiom,
! [X3] :
( ! [X4] :
( rs(X3,X4)
=> cp(X4) )
<=> ca_Vx5(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).
fof(f372,plain,
ra_Px1(sK5(i2003_11_14_17_21_262),sK3(sK5(i2003_11_14_17_21_262))),
inference(resolution,[],[f350,f275]) ).
fof(f350,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| ra_Px1(sK5(X0),sK3(sK5(X0))) ),
inference(resolution,[],[f342,f260]) ).
fof(f260,plain,
! [X0] :
( ca_Ax3(sK5(X0))
| ~ cUnsatisfiable(X0) ),
inference(literal_reordering,[],[f185]) ).
fof(f185,plain,
! [X0] :
( ca_Ax3(sK5(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f342,plain,
! [X2] :
( ~ ca_Ax3(X2)
| ra_Px1(X2,sK3(X2)) ),
inference(resolution,[],[f252,f258]) ).
fof(f258,plain,
! [X0] :
( cpxcomp(X0)
| ~ ca_Ax3(X0) ),
inference(literal_reordering,[],[f208]) ).
fof(f208,plain,
! [X0] :
( cpxcomp(X0)
| ~ ca_Ax3(X0) ),
inference(cnf_transformation,[],[f153]) ).
fof(f153,plain,
! [X0] :
( ( ( cpxcomp(X0)
& cqxcomp(X0) )
| ~ ca_Ax3(X0) )
& ( ca_Ax3(X0)
| ~ cpxcomp(X0)
| ~ cqxcomp(X0) ) ),
inference(flattening,[],[f152]) ).
fof(f152,plain,
! [X0] :
( ( ( cpxcomp(X0)
& cqxcomp(X0) )
| ~ ca_Ax3(X0) )
& ( ca_Ax3(X0)
| ~ cpxcomp(X0)
| ~ cqxcomp(X0) ) ),
inference(nnf_transformation,[],[f47]) ).
fof(f47,plain,
! [X0] :
( ( cpxcomp(X0)
& cqxcomp(X0) )
<=> ca_Ax3(X0) ),
inference(rectify,[],[f30]) ).
fof(f30,axiom,
! [X3] :
( ( cpxcomp(X3)
& cqxcomp(X3) )
<=> ca_Ax3(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(f252,plain,
! [X0] :
( ~ cpxcomp(X0)
| ra_Px1(X0,sK3(X0)) ),
inference(literal_reordering,[],[f181]) ).
fof(f181,plain,
! [X0] :
( ra_Px1(X0,sK3(X0))
| ~ cpxcomp(X0) ),
inference(cnf_transformation,[],[f127]) ).
fof(f127,plain,
! [X0] :
( ( ra_Px1(X0,sK3(X0))
| ~ cpxcomp(X0) )
& ( cpxcomp(X0)
| ! [X2] : ~ ra_Px1(X0,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f125,f126]) ).
fof(f126,plain,
! [X0] :
( ? [X1] : ra_Px1(X0,X1)
=> ra_Px1(X0,sK3(X0)) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
! [X0] :
( ( ? [X1] : ra_Px1(X0,X1)
| ~ cpxcomp(X0) )
& ( cpxcomp(X0)
| ! [X2] : ~ ra_Px1(X0,X2) ) ),
inference(rectify,[],[f124]) ).
fof(f124,plain,
! [X0] :
( ( ? [X1] : ra_Px1(X0,X1)
| ~ cpxcomp(X0) )
& ( cpxcomp(X0)
| ! [X1] : ~ ra_Px1(X0,X1) ) ),
inference(nnf_transformation,[],[f35]) ).
fof(f35,plain,
! [X0] :
( ? [X1] : ra_Px1(X0,X1)
<=> cpxcomp(X0) ),
inference(rectify,[],[f27]) ).
fof(f27,axiom,
! [X3] :
( cpxcomp(X3)
<=> ? [X5] : ra_Px1(X3,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : KRS114+1 : TPTP v8.1.0. Released v3.1.0.
% 0.04/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n017.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 29 23:57:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.54 % (6409)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.19/0.55 % (6401)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.56 % (6409)First to succeed.
% 0.19/0.56 TRYING [1]
% 1.63/0.56 % (6396)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.63/0.56 % (6417)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 1.63/0.57 % (6408)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.63/0.57 TRYING [2]
% 1.63/0.57 TRYING [3]
% 1.63/0.57 TRYING [4]
% 1.63/0.57 % (6420)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.63/0.57 % (6396)Refutation not found, incomplete strategy% (6396)------------------------------
% 1.63/0.57 % (6396)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.63/0.57 % (6396)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.63/0.57 % (6396)Termination reason: Refutation not found, incomplete strategy
% 1.63/0.57
% 1.63/0.57 % (6396)Memory used [KB]: 5500
% 1.63/0.57 % (6396)Time elapsed: 0.160 s
% 1.63/0.57 % (6396)Instructions burned: 3 (million)
% 1.63/0.57 % (6396)------------------------------
% 1.63/0.57 % (6396)------------------------------
% 1.63/0.57 % (6417)Also succeeded, but the first one will report.
% 1.63/0.57 % (6409)Refutation found. Thanks to Tanya!
% 1.63/0.57 % SZS status Unsatisfiable for theBenchmark
% 1.63/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 1.63/0.57 % (6409)------------------------------
% 1.63/0.57 % (6409)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.63/0.57 % (6409)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.63/0.57 % (6409)Termination reason: Refutation
% 1.63/0.57
% 1.63/0.57 % (6409)Memory used [KB]: 5884
% 1.63/0.57 % (6409)Time elapsed: 0.011 s
% 1.63/0.57 % (6409)Instructions burned: 8 (million)
% 1.63/0.57 % (6409)------------------------------
% 1.63/0.57 % (6409)------------------------------
% 1.63/0.57 % (6394)Success in time 0.223 s
%------------------------------------------------------------------------------