TSTP Solution File: KRS110+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : KRS110+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 : n002.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:50 EDT 2022
% Result : Unsatisfiable 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 44 ( 4 unt; 0 def)
% Number of atoms : 173 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 201 ( 72 ~; 62 |; 50 &)
% ( 10 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 92 ( 65 !; 27 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f252,plain,
$false,
inference(subsumption_resolution,[],[f173,f251]) ).
fof(f251,plain,
! [X0] : ~ cUnsatisfiable(X0),
inference(subsumption_resolution,[],[f250,f197]) ).
fof(f197,plain,
! [X0] :
( ca_Ax2(sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f152]) ).
fof(f152,plain,
! [X0] :
( ( ( ! [X1] :
( cpxcomp(X1)
| ~ rs(X0,X1) )
& ca_Ax2(sK3(X0))
& rs(X0,sK3(X0)) )
| ~ cUnsatisfiable(X0) )
& ( cUnsatisfiable(X0)
| ( ~ cpxcomp(sK4(X0))
& rs(X0,sK4(X0)) )
| ! [X4] :
( ~ ca_Ax2(X4)
| ~ rs(X0,X4) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f149,f151,f150]) ).
fof(f150,plain,
! [X0] :
( ? [X2] :
( ca_Ax2(X2)
& rs(X0,X2) )
=> ( ca_Ax2(sK3(X0))
& rs(X0,sK3(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f151,plain,
! [X0] :
( ? [X3] :
( ~ cpxcomp(X3)
& rs(X0,X3) )
=> ( ~ cpxcomp(sK4(X0))
& rs(X0,sK4(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f149,plain,
! [X0] :
( ( ( ! [X1] :
( cpxcomp(X1)
| ~ rs(X0,X1) )
& ? [X2] :
( ca_Ax2(X2)
& rs(X0,X2) ) )
| ~ cUnsatisfiable(X0) )
& ( cUnsatisfiable(X0)
| ? [X3] :
( ~ cpxcomp(X3)
& rs(X0,X3) )
| ! [X4] :
( ~ ca_Ax2(X4)
| ~ rs(X0,X4) ) ) ),
inference(rectify,[],[f148]) ).
fof(f148,plain,
! [X0] :
( ( ( ! [X2] :
( cpxcomp(X2)
| ~ rs(X0,X2) )
& ? [X1] :
( ca_Ax2(X1)
& rs(X0,X1) ) )
| ~ cUnsatisfiable(X0) )
& ( cUnsatisfiable(X0)
| ? [X2] :
( ~ cpxcomp(X2)
& rs(X0,X2) )
| ! [X1] :
( ~ ca_Ax2(X1)
| ~ rs(X0,X1) ) ) ),
inference(flattening,[],[f147]) ).
fof(f147,plain,
! [X0] :
( ( ( ! [X2] :
( cpxcomp(X2)
| ~ rs(X0,X2) )
& ? [X1] :
( ca_Ax2(X1)
& rs(X0,X1) ) )
| ~ cUnsatisfiable(X0) )
& ( cUnsatisfiable(X0)
| ? [X2] :
( ~ cpxcomp(X2)
& rs(X0,X2) )
| ! [X1] :
( ~ ca_Ax2(X1)
| ~ rs(X0,X1) ) ) ),
inference(nnf_transformation,[],[f111]) ).
fof(f111,plain,
! [X0] :
( ( ! [X2] :
( cpxcomp(X2)
| ~ rs(X0,X2) )
& ? [X1] :
( ca_Ax2(X1)
& rs(X0,X1) ) )
<=> cUnsatisfiable(X0) ),
inference(ennf_transformation,[],[f47]) ).
fof(f47,plain,
! [X0] :
( ( ! [X2] :
( rs(X0,X2)
=> cpxcomp(X2) )
& ? [X1] :
( ca_Ax2(X1)
& rs(X0,X1) ) )
<=> cUnsatisfiable(X0) ),
inference(rectify,[],[f25]) ).
fof(f25,axiom,
! [X3] :
( ( ? [X4] :
( ca_Ax2(X4)
& rs(X3,X4) )
& ! [X4] :
( rs(X3,X4)
=> cpxcomp(X4) ) )
<=> cUnsatisfiable(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f250,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| ~ ca_Ax2(sK3(X0)) ),
inference(resolution,[],[f249,f169]) ).
fof(f169,plain,
! [X0] :
( cp(X0)
| ~ ca_Ax2(X0) ),
inference(cnf_transformation,[],[f129]) ).
fof(f129,plain,
! [X0] :
( ( ca_Ax2(X0)
| ! [X1] :
( ~ rinvS(X0,X1)
| ~ cp(X1) )
| ~ cp(X0) )
& ( ( rinvS(X0,sK0(X0))
& cp(sK0(X0))
& cp(X0) )
| ~ ca_Ax2(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f127,f128]) ).
fof(f128,plain,
! [X0] :
( ? [X2] :
( rinvS(X0,X2)
& cp(X2) )
=> ( rinvS(X0,sK0(X0))
& cp(sK0(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f127,plain,
! [X0] :
( ( ca_Ax2(X0)
| ! [X1] :
( ~ rinvS(X0,X1)
| ~ cp(X1) )
| ~ cp(X0) )
& ( ( ? [X2] :
( rinvS(X0,X2)
& cp(X2) )
& cp(X0) )
| ~ ca_Ax2(X0) ) ),
inference(rectify,[],[f126]) ).
fof(f126,plain,
! [X0] :
( ( ca_Ax2(X0)
| ! [X1] :
( ~ rinvS(X0,X1)
| ~ cp(X1) )
| ~ cp(X0) )
& ( ( ? [X1] :
( rinvS(X0,X1)
& cp(X1) )
& cp(X0) )
| ~ ca_Ax2(X0) ) ),
inference(flattening,[],[f125]) ).
fof(f125,plain,
! [X0] :
( ( ca_Ax2(X0)
| ! [X1] :
( ~ rinvS(X0,X1)
| ~ cp(X1) )
| ~ cp(X0) )
& ( ( ? [X1] :
( rinvS(X0,X1)
& cp(X1) )
& cp(X0) )
| ~ ca_Ax2(X0) ) ),
inference(nnf_transformation,[],[f53]) ).
fof(f53,plain,
! [X0] :
( ca_Ax2(X0)
<=> ( ? [X1] :
( rinvS(X0,X1)
& cp(X1) )
& cp(X0) ) ),
inference(rectify,[],[f28]) ).
fof(f28,axiom,
! [X3] :
( ca_Ax2(X3)
<=> ( ? [X4] :
( rinvS(X3,X4)
& cp(X4) )
& cp(X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(f249,plain,
! [X0] :
( ~ cp(sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f248,f239]) ).
fof(f239,plain,
! [X0] :
( ~ cpxcomp(X0)
| ~ cp(X0) ),
inference(resolution,[],[f181,f191]) ).
fof(f191,plain,
! [X0,X1] :
( ~ ra_Px1(X0,X1)
| ~ cp(X0) ),
inference(cnf_transformation,[],[f144]) ).
fof(f144,plain,
! [X0] :
( ( ! [X1] : ~ ra_Px1(X0,X1)
| ~ cp(X0) )
& ( cp(X0)
| ra_Px1(X0,sK2(X0)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f142,f143]) ).
fof(f143,plain,
! [X0] :
( ? [X2] : ra_Px1(X0,X2)
=> ra_Px1(X0,sK2(X0)) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
! [X0] :
( ( ! [X1] : ~ ra_Px1(X0,X1)
| ~ cp(X0) )
& ( cp(X0)
| ? [X2] : ra_Px1(X0,X2) ) ),
inference(rectify,[],[f141]) ).
fof(f141,plain,
! [X0] :
( ( ! [X1] : ~ ra_Px1(X0,X1)
| ~ cp(X0) )
& ( cp(X0)
| ? [X1] : ra_Px1(X0,X1) ) ),
inference(nnf_transformation,[],[f78]) ).
fof(f78,plain,
! [X0] :
( ! [X1] : ~ ra_Px1(X0,X1)
<=> cp(X0) ),
inference(ennf_transformation,[],[f46]) ).
fof(f46,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(f181,plain,
! [X0] :
( ra_Px1(X0,sK1(X0))
| ~ cpxcomp(X0) ),
inference(cnf_transformation,[],[f136]) ).
fof(f136,plain,
! [X0] :
( ( ra_Px1(X0,sK1(X0))
| ~ cpxcomp(X0) )
& ( cpxcomp(X0)
| ! [X2] : ~ ra_Px1(X0,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f134,f135]) ).
fof(f135,plain,
! [X0] :
( ? [X1] : ra_Px1(X0,X1)
=> ra_Px1(X0,sK1(X0)) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
! [X0] :
( ( ? [X1] : ra_Px1(X0,X1)
| ~ cpxcomp(X0) )
& ( cpxcomp(X0)
| ! [X2] : ~ ra_Px1(X0,X2) ) ),
inference(rectify,[],[f133]) ).
fof(f133,plain,
! [X0] :
( ( ? [X1] : ra_Px1(X0,X1)
| ~ cpxcomp(X0) )
& ( cpxcomp(X0)
| ! [X1] : ~ ra_Px1(X0,X1) ) ),
inference(nnf_transformation,[],[f61]) ).
fof(f61,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) ).
fof(f248,plain,
! [X0] :
( cpxcomp(sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(duplicate_literal_removal,[],[f246]) ).
fof(f246,plain,
! [X0] :
( cpxcomp(sK3(X0))
| ~ cUnsatisfiable(X0)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f198,f196]) ).
fof(f196,plain,
! [X0] :
( rs(X0,sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f152]) ).
fof(f198,plain,
! [X0,X1] :
( ~ rs(X0,X1)
| ~ cUnsatisfiable(X0)
| cpxcomp(X1) ),
inference(cnf_transformation,[],[f152]) ).
fof(f173,plain,
cUnsatisfiable(i2003_11_14_17_21_12565),
inference(cnf_transformation,[],[f35]) ).
fof(f35,axiom,
cUnsatisfiable(i2003_11_14_17_21_12565),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_12) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS110+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/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 : n002.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.35 % DateTime : Tue Aug 30 00:45:58 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.50 % (30987)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.50 % (30976)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.20/0.50 % (30973)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.50 % (30976)First to succeed.
% 0.20/0.51 % (30976)Refutation found. Thanks to Tanya!
% 0.20/0.51 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51 % (30976)------------------------------
% 0.20/0.51 % (30976)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (30976)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (30976)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51 % (30976)Memory used [KB]: 5500
% 0.20/0.51 % (30976)Time elapsed: 0.094 s
% 0.20/0.51 % (30976)Instructions burned: 4 (million)
% 0.20/0.51 % (30976)------------------------------
% 0.20/0.51 % (30976)------------------------------
% 0.20/0.51 % (30967)Success in time 0.151 s
%------------------------------------------------------------------------------