TSTP Solution File: SWV174+1 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SWV174+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n025.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 : Mon Jun 24 17:34:34 EDT 2024
% Result : Theorem 0.23s 0.45s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 15 unt; 0 def)
% Number of atoms : 171 ( 33 equ)
% Maximal formula atoms : 16 ( 5 avg)
% Number of connectives : 200 ( 61 ~; 45 |; 74 &)
% ( 1 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 11 con; 0-3 aty)
% Number of variables : 47 ( 39 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f332,plain,
$false,
inference(subsumption_resolution,[],[f331,f132]) ).
fof(f132,plain,
gt(pv10,sK0),
inference(cnf_transformation,[],[f120]) ).
fof(f120,plain,
( init != a_select3(q_init,sK0,sK1)
& gt(pv10,sK0)
& leq(sK1,n4)
& leq(sK0,n135299)
& leq(n0,sK1)
& leq(n0,sK0)
& ! [X2] :
( init = a_select3(center_init,X2,n0)
| ~ leq(X2,n4)
| ~ leq(n0,X2) )
& ! [X3] :
( ! [X4] :
( init = a_select3(q_init,X3,X4)
| ~ leq(X4,n4)
| ~ leq(n0,X4) )
| ~ leq(X3,pred(pv10))
| ~ leq(n0,X3) )
& leq(pv10,n135299)
& leq(n0,pv10) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f118,f119]) ).
fof(f119,plain,
( ? [X0,X1] :
( init != a_select3(q_init,X0,X1)
& gt(pv10,X0)
& leq(X1,n4)
& leq(X0,n135299)
& leq(n0,X1)
& leq(n0,X0) )
=> ( init != a_select3(q_init,sK0,sK1)
& gt(pv10,sK0)
& leq(sK1,n4)
& leq(sK0,n135299)
& leq(n0,sK1)
& leq(n0,sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f118,plain,
( ? [X0,X1] :
( init != a_select3(q_init,X0,X1)
& gt(pv10,X0)
& leq(X1,n4)
& leq(X0,n135299)
& leq(n0,X1)
& leq(n0,X0) )
& ! [X2] :
( init = a_select3(center_init,X2,n0)
| ~ leq(X2,n4)
| ~ leq(n0,X2) )
& ! [X3] :
( ! [X4] :
( init = a_select3(q_init,X3,X4)
| ~ leq(X4,n4)
| ~ leq(n0,X4) )
| ~ leq(X3,pred(pv10))
| ~ leq(n0,X3) )
& leq(pv10,n135299)
& leq(n0,pv10) ),
inference(rectify,[],[f96]) ).
fof(f96,plain,
( ? [X3,X4] :
( init != a_select3(q_init,X3,X4)
& gt(pv10,X3)
& leq(X4,n4)
& leq(X3,n135299)
& leq(n0,X4)
& leq(n0,X3) )
& ! [X0] :
( init = a_select3(center_init,X0,n0)
| ~ leq(X0,n4)
| ~ leq(n0,X0) )
& ! [X1] :
( ! [X2] :
( init = a_select3(q_init,X1,X2)
| ~ leq(X2,n4)
| ~ leq(n0,X2) )
| ~ leq(X1,pred(pv10))
| ~ leq(n0,X1) )
& leq(pv10,n135299)
& leq(n0,pv10) ),
inference(flattening,[],[f95]) ).
fof(f95,plain,
( ? [X3,X4] :
( init != a_select3(q_init,X3,X4)
& gt(pv10,X3)
& leq(X4,n4)
& leq(X3,n135299)
& leq(n0,X4)
& leq(n0,X3) )
& ! [X0] :
( init = a_select3(center_init,X0,n0)
| ~ leq(X0,n4)
| ~ leq(n0,X0) )
& ! [X1] :
( ! [X2] :
( init = a_select3(q_init,X1,X2)
| ~ leq(X2,n4)
| ~ leq(n0,X2) )
| ~ leq(X1,pred(pv10))
| ~ leq(n0,X1) )
& leq(pv10,n135299)
& leq(n0,pv10) ),
inference(ennf_transformation,[],[f94]) ).
fof(f94,plain,
~ ( ( ! [X0] :
( ( leq(X0,n4)
& leq(n0,X0) )
=> init = a_select3(center_init,X0,n0) )
& ! [X1] :
( ( leq(X1,pred(pv10))
& leq(n0,X1) )
=> ! [X2] :
( ( leq(X2,n4)
& leq(n0,X2) )
=> init = a_select3(q_init,X1,X2) ) )
& leq(pv10,n135299)
& leq(n0,pv10) )
=> ! [X3,X4] :
( ( leq(X4,n4)
& leq(X3,n135299)
& leq(n0,X4)
& leq(n0,X3) )
=> ( gt(pv10,X3)
=> init = a_select3(q_init,X3,X4) ) ) ),
inference(rectify,[],[f54]) ).
fof(f54,negated_conjecture,
~ ( ( ! [X3] :
( ( leq(X3,n4)
& leq(n0,X3) )
=> init = a_select3(center_init,X3,n0) )
& ! [X13] :
( ( leq(X13,pred(pv10))
& leq(n0,X13) )
=> ! [X17] :
( ( leq(X17,n4)
& leq(n0,X17) )
=> a_select3(q_init,X13,X17) = init ) )
& leq(pv10,n135299)
& leq(n0,pv10) )
=> ! [X19,X20] :
( ( leq(X20,n4)
& leq(X19,n135299)
& leq(n0,X20)
& leq(n0,X19) )
=> ( gt(pv10,X19)
=> init = a_select3(q_init,X19,X20) ) ) ),
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
( ( ! [X3] :
( ( leq(X3,n4)
& leq(n0,X3) )
=> init = a_select3(center_init,X3,n0) )
& ! [X13] :
( ( leq(X13,pred(pv10))
& leq(n0,X13) )
=> ! [X17] :
( ( leq(X17,n4)
& leq(n0,X17) )
=> a_select3(q_init,X13,X17) = init ) )
& leq(pv10,n135299)
& leq(n0,pv10) )
=> ! [X19,X20] :
( ( leq(X20,n4)
& leq(X19,n135299)
& leq(n0,X20)
& leq(n0,X19) )
=> ( gt(pv10,X19)
=> init = a_select3(q_init,X19,X20) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f331,plain,
~ gt(pv10,sK0),
inference(forward_demodulation,[],[f328,f200]) ).
fof(f200,plain,
pv10 = succ(sF3),
inference(superposition,[],[f175,f194]) ).
fof(f194,plain,
pred(pv10) = sF3,
introduced(function_definition,[new_symbols(definition,[sF3])]) ).
fof(f175,plain,
! [X0] : succ(pred(X0)) = X0,
inference(cnf_transformation,[],[f41]) ).
fof(f41,axiom,
! [X0] : succ(pred(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f328,plain,
~ gt(succ(sF3),sK0),
inference(resolution,[],[f305,f188]) ).
fof(f188,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ gt(succ(X1),X0) ),
inference(cnf_transformation,[],[f123]) ).
fof(f123,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ~ gt(succ(X1),X0) )
& ( gt(succ(X1),X0)
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f13,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> gt(succ(X1),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f305,plain,
~ leq(sK0,sF3),
inference(subsumption_resolution,[],[f304,f128]) ).
fof(f128,plain,
leq(n0,sK0),
inference(cnf_transformation,[],[f120]) ).
fof(f304,plain,
( ~ leq(sK0,sF3)
| ~ leq(n0,sK0) ),
inference(subsumption_resolution,[],[f303,f129]) ).
fof(f129,plain,
leq(n0,sK1),
inference(cnf_transformation,[],[f120]) ).
fof(f303,plain,
( ~ leq(n0,sK1)
| ~ leq(sK0,sF3)
| ~ leq(n0,sK0) ),
inference(subsumption_resolution,[],[f302,f131]) ).
fof(f131,plain,
leq(sK1,n4),
inference(cnf_transformation,[],[f120]) ).
fof(f302,plain,
( ~ leq(sK1,n4)
| ~ leq(n0,sK1)
| ~ leq(sK0,sF3)
| ~ leq(n0,sK0) ),
inference(subsumption_resolution,[],[f300,f193]) ).
fof(f193,plain,
init != sF2,
inference(definition_folding,[],[f133,f192]) ).
fof(f192,plain,
a_select3(q_init,sK0,sK1) = sF2,
introduced(function_definition,[new_symbols(definition,[sF2])]) ).
fof(f133,plain,
init != a_select3(q_init,sK0,sK1),
inference(cnf_transformation,[],[f120]) ).
fof(f300,plain,
( init = sF2
| ~ leq(sK1,n4)
| ~ leq(n0,sK1)
| ~ leq(sK0,sF3)
| ~ leq(n0,sK0) ),
inference(superposition,[],[f195,f192]) ).
fof(f195,plain,
! [X3,X4] :
( init = a_select3(q_init,X3,X4)
| ~ leq(X4,n4)
| ~ leq(n0,X4)
| ~ leq(X3,sF3)
| ~ leq(n0,X3) ),
inference(definition_folding,[],[f126,f194]) ).
fof(f126,plain,
! [X3,X4] :
( init = a_select3(q_init,X3,X4)
| ~ leq(X4,n4)
| ~ leq(n0,X4)
| ~ leq(X3,pred(pv10))
| ~ leq(n0,X3) ),
inference(cnf_transformation,[],[f120]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : SWV174+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% 0.03/0.14 % Command : run_vampire %s %d THM
% 0.15/0.36 % Computer : n025.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Jun 20 18:06:24 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.38 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.38 Running first-order theorem proving
% 0.15/0.38 Running /export/starexec/sandbox2/solver/bin/vampire --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.23/0.44 % (5075)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.44 % (5079)lrs+10_1:3_drc=off:sil=256000:sp=unary_first:lwlo=on:i=216875:kws=precedence:ins=3:rawr=on:nwc=10.0_0 on theBenchmark for (2999ds/216875Mi)
% 0.23/0.44 % (5075)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.44 % (5080)dis+1011_3:1_sil=256000:tgt=ground:sac=on:i=109:sd=1:ss=included_0 on theBenchmark for (2999ds/109Mi)
% 0.23/0.45 % (5080)First to succeed.
% 0.23/0.45 % (5075)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.45 % (5081)dis+1010_1:1_sil=2000:nwc=3.0:s2a=on:i=132:ins=5:fsr=off:ss=axioms:sd=2:fd=off_0 on theBenchmark for (2999ds/132Mi)
% 0.23/0.45 % (5080)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-5075"
% 0.23/0.45 % (5075)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.45 % (5080)Refutation found. Thanks to Tanya!
% 0.23/0.45 % SZS status Theorem for theBenchmark
% 0.23/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.46 % (5080)------------------------------
% 0.23/0.46 % (5080)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.23/0.46 % (5080)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.23/0.46 % (5080)Termination reason: Refutation
% 0.23/0.46
% 0.23/0.46 % (5080)Memory used [KB]: 1278
% 0.23/0.46 % (5080)Time elapsed: 0.010 s
% 0.23/0.46 % (5080)Instructions burned: 14 (million)
% 0.23/0.46 % (5080)------------------------------
% 0.23/0.46 % (5080)------------------------------
% 0.23/0.46 % (5075)Success in time 0.069 s
%------------------------------------------------------------------------------