TSTP Solution File: SWV041+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWV041+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n031.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 : Tue Apr 30 16:36:56 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 42 ( 22 unt; 0 def)
% Number of atoms : 110 ( 25 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 94 ( 26 ~; 13 |; 41 &)
% ( 1 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 11 con; 0-3 aty)
% Number of variables : 41 ( 33 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8690,plain,
$false,
inference(subsumption_resolution,[],[f8689,f647]) ).
fof(f647,plain,
! [X0] : ~ leq(X0,pred(X0)),
inference(superposition,[],[f631,f321]) ).
fof(f321,plain,
! [X0] : succ(pred(X0)) = X0,
inference(cnf_transformation,[],[f41]) ).
fof(f41,axiom,
! [X0] : succ(pred(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_pred) ).
fof(f631,plain,
! [X0] : ~ leq(succ(X0),X0),
inference(resolution,[],[f368,f317]) ).
fof(f317,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',irreflexivity_gt) ).
fof(f368,plain,
! [X0,X1] :
( gt(succ(X1),X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f217]) ).
fof(f217,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/sandbox/benchmark/theBenchmark.p',leq_succ_gt_equiv) ).
fof(f8689,plain,
leq(n0,pred(n0)),
inference(forward_demodulation,[],[f8679,f325]) ).
fof(f325,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[],[f39]) ).
fof(f39,axiom,
! [X0] : minus(X0,n1) = pred(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pred_minus_1) ).
fof(f8679,plain,
leq(n0,minus(n0,n1)),
inference(superposition,[],[f272,f8677]) ).
fof(f8677,plain,
n0 = sK14,
inference(subsumption_resolution,[],[f8618,f578]) ).
fof(f578,plain,
leq(sK14,n0),
inference(resolution,[],[f549,f468]) ).
fof(f468,plain,
leq(sK14,tptp_minus_1),
inference(forward_demodulation,[],[f465,f449]) ).
fof(f449,plain,
tptp_minus_1 = pred(n0),
inference(superposition,[],[f320,f312]) ).
fof(f312,plain,
n0 = succ(tptp_minus_1),
inference(cnf_transformation,[],[f28]) ).
fof(f28,axiom,
n0 = succ(tptp_minus_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_tptp_minus_1) ).
fof(f320,plain,
! [X0] : pred(succ(X0)) = X0,
inference(cnf_transformation,[],[f40]) ).
fof(f40,axiom,
! [X0] : pred(succ(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pred_succ) ).
fof(f465,plain,
leq(sK14,pred(n0)),
inference(superposition,[],[f272,f325]) ).
fof(f549,plain,
! [X0] :
( ~ leq(X0,tptp_minus_1)
| leq(X0,n0) ),
inference(superposition,[],[f342,f312]) ).
fof(f342,plain,
! [X0,X1] :
( leq(X0,succ(X1))
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f139]) ).
fof(f139,plain,
! [X0,X1] :
( leq(X0,succ(X1))
| ~ leq(X0,X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
=> leq(X0,succ(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_succ) ).
fof(f8618,plain,
( ~ leq(sK14,n0)
| n0 = sK14 ),
inference(resolution,[],[f340,f271]) ).
fof(f271,plain,
leq(n0,sK14),
inference(cnf_transformation,[],[f204]) ).
fof(f204,plain,
( init != a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),sK14,sK13)
& leq(sK14,minus(n0,n1))
& leq(n0,sK14)
& leq(sK13,n2)
& leq(n0,sK13)
& geq(minus(n410,n1),n0)
& geq(minus(n330,n1),n0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14])],[f126,f203,f202]) ).
fof(f202,plain,
( ? [X0] :
( ? [X1] :
( init != a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,X0)
& leq(X1,minus(n0,n1))
& leq(n0,X1) )
& leq(X0,n2)
& leq(n0,X0) )
=> ( ? [X1] :
( init != a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,sK13)
& leq(X1,minus(n0,n1))
& leq(n0,X1) )
& leq(sK13,n2)
& leq(n0,sK13) ) ),
introduced(choice_axiom,[]) ).
fof(f203,plain,
( ? [X1] :
( init != a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,sK13)
& leq(X1,minus(n0,n1))
& leq(n0,X1) )
=> ( init != a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),sK14,sK13)
& leq(sK14,minus(n0,n1))
& leq(n0,sK14) ) ),
introduced(choice_axiom,[]) ).
fof(f126,plain,
( ? [X0] :
( ? [X1] :
( init != a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,X0)
& leq(X1,minus(n0,n1))
& leq(n0,X1) )
& leq(X0,n2)
& leq(n0,X0) )
& geq(minus(n410,n1),n0)
& geq(minus(n330,n1),n0) ),
inference(flattening,[],[f125]) ).
fof(f125,plain,
( ? [X0] :
( ? [X1] :
( init != a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,X0)
& leq(X1,minus(n0,n1))
& leq(n0,X1) )
& leq(X0,n2)
& leq(n0,X0) )
& geq(minus(n410,n1),n0)
& geq(minus(n330,n1),n0) ),
inference(ennf_transformation,[],[f102]) ).
fof(f102,plain,
~ ( ( geq(minus(n410,n1),n0)
& geq(minus(n330,n1),n0) )
=> ! [X0] :
( ( leq(X0,n2)
& leq(n0,X0) )
=> ! [X1] :
( ( leq(X1,minus(n0,n1))
& leq(n0,X1) )
=> init = a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,X0) ) ) ),
inference(rectify,[],[f54]) ).
fof(f54,negated_conjecture,
~ ( ( geq(minus(n410,n1),n0)
& geq(minus(n330,n1),n0) )
=> ! [X13] :
( ( leq(X13,n2)
& leq(n0,X13) )
=> ! [X17] :
( ( leq(X17,minus(n0,n1))
& leq(n0,X17) )
=> a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X17,X13) = init ) ) ),
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
( ( geq(minus(n410,n1),n0)
& geq(minus(n330,n1),n0) )
=> ! [X13] :
( ( leq(X13,n2)
& leq(n0,X13) )
=> ! [X17] :
( ( leq(X17,minus(n0,n1))
& leq(n0,X17) )
=> a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X17,X13) = init ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_init_0077) ).
fof(f340,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,n0)
| n0 = X0 ),
inference(cnf_transformation,[],[f138]) ).
fof(f138,plain,
! [X0] :
( n0 = X0
| ~ leq(X0,n0)
| ~ leq(n0,X0) ),
inference(flattening,[],[f137]) ).
fof(f137,plain,
! [X0] :
( n0 = X0
| ~ leq(X0,n0)
| ~ leq(n0,X0) ),
inference(ennf_transformation,[],[f93]) ).
fof(f93,axiom,
! [X0] :
( ( leq(X0,n0)
& leq(n0,X0) )
=> n0 = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',finite_domain_0) ).
fof(f272,plain,
leq(sK14,minus(n0,n1)),
inference(cnf_transformation,[],[f204]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV041+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n031.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Apr 30 05:27:43 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % (2474)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (2477)WARNING: value z3 for option sas not known
% 0.14/0.38 % (2478)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38 % (2476)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.38 % (2475)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.38 % (2477)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.38 % (2479)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.14/0.38 % (2480)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.14/0.38 % (2481)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.21/0.48 TRYING [1]
% 0.21/0.49 TRYING [2]
% 0.21/0.49 % (2477)First to succeed.
% 0.21/0.50 % (2477)Refutation found. Thanks to Tanya!
% 0.21/0.50 % SZS status Theorem for theBenchmark
% 0.21/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.50 % (2477)------------------------------
% 0.21/0.50 % (2477)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.21/0.50 % (2477)Termination reason: Refutation
% 0.21/0.50
% 0.21/0.50 % (2477)Memory used [KB]: 2321
% 0.21/0.50 % (2477)Time elapsed: 0.121 s
% 0.21/0.50 % (2477)Instructions burned: 229 (million)
% 0.21/0.50 % (2477)------------------------------
% 0.21/0.50 % (2477)------------------------------
% 0.21/0.50 % (2474)Success in time 0.14 s
%------------------------------------------------------------------------------