TSTP Solution File: SWV371+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWV371+1 : TPTP v8.1.0. Released v3.3.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 : n029.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 18:56:38 EDT 2022
% Result : Theorem 0.11s 0.40s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 48 ( 18 unt; 0 def)
% Number of atoms : 86 ( 6 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 70 ( 32 ~; 22 |; 7 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 65 ( 56 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f343,plain,
$false,
inference(subsumption_resolution,[],[f342,f306]) ).
fof(f306,plain,
~ pi_sharp_find_min(sF7,sF8),
inference(definition_folding,[],[f296,f305,f301,f304,f301]) ).
fof(f304,plain,
i(sF5) = sF7,
introduced(function_definition,[]) ).
fof(f301,plain,
sF5 = triple(sK2,sK3,sK4),
introduced(function_definition,[]) ).
fof(f305,plain,
removemin_cpq_res(sF5) = sF8,
introduced(function_definition,[]) ).
fof(f296,plain,
~ pi_sharp_find_min(i(triple(sK2,sK3,sK4)),removemin_cpq_res(triple(sK2,sK3,sK4))),
inference(definition_unfolding,[],[f288,f247]) ).
fof(f247,plain,
! [X0] : findmin_cpq_res(X0) = removemin_cpq_res(X0),
inference(cnf_transformation,[],[f53]) ).
fof(f53,axiom,
! [X0] : findmin_cpq_res(X0) = removemin_cpq_res(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax53) ).
fof(f288,plain,
~ pi_sharp_find_min(i(triple(sK2,sK3,sK4)),findmin_cpq_res(triple(sK2,sK3,sK4))),
inference(cnf_transformation,[],[f212]) ).
fof(f212,plain,
( phi(findmin_cpq_eff(triple(sK2,sK3,sK4)))
& ~ pi_sharp_find_min(i(triple(sK2,sK3,sK4)),findmin_cpq_res(triple(sK2,sK3,sK4))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f210,f211]) ).
fof(f211,plain,
( ? [X0,X1,X2] :
( phi(findmin_cpq_eff(triple(X0,X1,X2)))
& ~ pi_sharp_find_min(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) )
=> ( phi(findmin_cpq_eff(triple(sK2,sK3,sK4)))
& ~ pi_sharp_find_min(i(triple(sK2,sK3,sK4)),findmin_cpq_res(triple(sK2,sK3,sK4))) ) ),
introduced(choice_axiom,[]) ).
fof(f210,plain,
? [X0,X1,X2] :
( phi(findmin_cpq_eff(triple(X0,X1,X2)))
& ~ pi_sharp_find_min(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
inference(rectify,[],[f133]) ).
fof(f133,plain,
? [X2,X1,X0] :
( phi(findmin_cpq_eff(triple(X2,X1,X0)))
& ~ pi_sharp_find_min(i(triple(X2,X1,X0)),findmin_cpq_res(triple(X2,X1,X0))) ),
inference(ennf_transformation,[],[f94]) ).
fof(f94,plain,
~ ! [X0,X2,X1] :
( phi(findmin_cpq_eff(triple(X2,X1,X0)))
=> pi_sharp_find_min(i(triple(X2,X1,X0)),findmin_cpq_res(triple(X2,X1,X0))) ),
inference(rectify,[],[f66]) ).
fof(f66,negated_conjecture,
~ ! [X2,X1,X0] :
( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> pi_sharp_find_min(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
inference(negated_conjecture,[],[f65]) ).
fof(f65,conjecture,
! [X2,X1,X0] :
( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> pi_sharp_find_min(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l7_co) ).
fof(f342,plain,
pi_sharp_find_min(sF7,sF8),
inference(subsumption_resolution,[],[f341,f327]) ).
fof(f327,plain,
issmallestelement_pq(sF7,sF8),
inference(forward_demodulation,[],[f326,f304]) ).
fof(f326,plain,
issmallestelement_pq(i(sF5),sF8),
inference(forward_demodulation,[],[f325,f305]) ).
fof(f325,plain,
issmallestelement_pq(i(sF5),removemin_cpq_res(sF5)),
inference(subsumption_resolution,[],[f324,f303]) ).
fof(f303,plain,
phi(sF6),
inference(definition_folding,[],[f289,f302,f301]) ).
fof(f302,plain,
sF6 = findmin_cpq_eff(sF5),
introduced(function_definition,[]) ).
fof(f289,plain,
phi(findmin_cpq_eff(triple(sK2,sK3,sK4))),
inference(cnf_transformation,[],[f212]) ).
fof(f324,plain,
( issmallestelement_pq(i(sF5),removemin_cpq_res(sF5))
| ~ phi(sF6) ),
inference(forward_demodulation,[],[f319,f302]) ).
fof(f319,plain,
( ~ phi(findmin_cpq_eff(sF5))
| issmallestelement_pq(i(sF5),removemin_cpq_res(sF5)) ),
inference(superposition,[],[f292,f301]) ).
fof(f292,plain,
! [X2,X0,X1] :
( ~ phi(findmin_cpq_eff(triple(X2,X1,X0)))
| issmallestelement_pq(i(triple(X2,X1,X0)),removemin_cpq_res(triple(X2,X1,X0))) ),
inference(definition_unfolding,[],[f224,f247]) ).
fof(f224,plain,
! [X2,X0,X1] :
( ~ phi(findmin_cpq_eff(triple(X2,X1,X0)))
| issmallestelement_pq(i(triple(X2,X1,X0)),findmin_cpq_res(triple(X2,X1,X0))) ),
inference(cnf_transformation,[],[f162]) ).
fof(f162,plain,
! [X0,X1,X2] :
( ~ phi(findmin_cpq_eff(triple(X2,X1,X0)))
| issmallestelement_pq(i(triple(X2,X1,X0)),findmin_cpq_res(triple(X2,X1,X0))) ),
inference(rectify,[],[f146]) ).
fof(f146,plain,
! [X1,X2,X0] :
( ~ phi(findmin_cpq_eff(triple(X0,X2,X1)))
| issmallestelement_pq(i(triple(X0,X2,X1)),findmin_cpq_res(triple(X0,X2,X1))) ),
inference(ennf_transformation,[],[f77]) ).
fof(f77,plain,
! [X0,X2,X1] :
( phi(findmin_cpq_eff(triple(X0,X2,X1)))
=> issmallestelement_pq(i(triple(X0,X2,X1)),findmin_cpq_res(triple(X0,X2,X1))) ),
inference(rectify,[],[f64]) ).
fof(f64,axiom,
! [X0,X2,X1] :
( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> issmallestelement_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l7_lX) ).
fof(f341,plain,
( ~ issmallestelement_pq(sF7,sF8)
| pi_sharp_find_min(sF7,sF8) ),
inference(resolution,[],[f246,f323]) ).
fof(f323,plain,
contains_pq(sF7,sF8),
inference(forward_demodulation,[],[f322,f304]) ).
fof(f322,plain,
contains_pq(i(sF5),sF8),
inference(subsumption_resolution,[],[f321,f303]) ).
fof(f321,plain,
( contains_pq(i(sF5),sF8)
| ~ phi(sF6) ),
inference(forward_demodulation,[],[f320,f302]) ).
fof(f320,plain,
( ~ phi(findmin_cpq_eff(sF5))
| contains_pq(i(sF5),sF8) ),
inference(forward_demodulation,[],[f318,f305]) ).
fof(f318,plain,
( contains_pq(i(sF5),removemin_cpq_res(sF5))
| ~ phi(findmin_cpq_eff(sF5)) ),
inference(superposition,[],[f294,f301]) ).
fof(f294,plain,
! [X2,X0,X1] :
( ~ phi(findmin_cpq_eff(triple(X1,X2,X0)))
| contains_pq(i(triple(X1,X2,X0)),removemin_cpq_res(triple(X1,X2,X0))) ),
inference(definition_unfolding,[],[f278,f247]) ).
fof(f278,plain,
! [X2,X0,X1] :
( contains_pq(i(triple(X1,X2,X0)),findmin_cpq_res(triple(X1,X2,X0)))
| ~ phi(findmin_cpq_eff(triple(X1,X2,X0))) ),
inference(cnf_transformation,[],[f202]) ).
fof(f202,plain,
! [X0,X1,X2] :
( contains_pq(i(triple(X1,X2,X0)),findmin_cpq_res(triple(X1,X2,X0)))
| ~ phi(findmin_cpq_eff(triple(X1,X2,X0))) ),
inference(rectify,[],[f147]) ).
fof(f147,plain,
! [X2,X0,X1] :
( contains_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2)))
| ~ phi(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f63]) ).
fof(f63,axiom,
! [X0,X1,X2] :
( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> contains_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l7_l8) ).
fof(f246,plain,
! [X0,X1] :
( ~ contains_pq(X1,X0)
| ~ issmallestelement_pq(X1,X0)
| pi_sharp_find_min(X1,X0) ),
inference(cnf_transformation,[],[f180]) ).
fof(f180,plain,
! [X0,X1] :
( ~ issmallestelement_pq(X1,X0)
| pi_sharp_find_min(X1,X0)
| ~ contains_pq(X1,X0) ),
inference(rectify,[],[f142]) ).
fof(f142,plain,
! [X1,X0] :
( ~ issmallestelement_pq(X0,X1)
| pi_sharp_find_min(X0,X1)
| ~ contains_pq(X0,X1) ),
inference(flattening,[],[f141]) ).
fof(f141,plain,
! [X0,X1] :
( pi_sharp_find_min(X0,X1)
| ~ contains_pq(X0,X1)
| ~ issmallestelement_pq(X0,X1) ),
inference(ennf_transformation,[],[f108]) ).
fof(f108,plain,
! [X0,X1] :
( ( contains_pq(X0,X1)
& issmallestelement_pq(X0,X1) )
=> pi_sharp_find_min(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f58]) ).
fof(f58,axiom,
! [X0,X1] :
( ( contains_pq(X0,X1)
& issmallestelement_pq(X0,X1) )
<=> pi_sharp_find_min(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax58) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.07 % Problem : SWV371+1 : TPTP v8.1.0. Released v3.3.0.
% 0.02/0.08 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.07/0.26 % Computer : n029.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Tue Aug 30 19:32:27 EDT 2022
% 0.07/0.26 % CPUTime :
% 0.11/0.36 % (9796)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.11/0.36 % (9790)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.11/0.37 % (9791)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)
% 0.11/0.37 % (9816)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.11/0.37 % (9808)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.11/0.38 % (9818)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.11/0.38 % (9800)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.11/0.38 % (9792)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.11/0.39 % (9809)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.11/0.39 % (9818)First to succeed.
% 0.11/0.39 % (9793)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.11/0.39 % (9813)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.11/0.39 % (9810)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.11/0.39 % (9806)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.11/0.39 % (9795)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.11/0.40 % (9801)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.11/0.40 % (9794)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.11/0.40 % (9817)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.11/0.40 TRYING [1]
% 0.11/0.40 % (9798)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.11/0.40 TRYING [1]
% 0.11/0.40 % (9802)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.11/0.40 % (9798)Instruction limit reached!
% 0.11/0.40 % (9798)------------------------------
% 0.11/0.40 % (9798)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.11/0.40 % (9798)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.11/0.40 % (9798)Termination reason: Unknown
% 0.11/0.40 % (9798)Termination phase: Property scanning
% 0.11/0.40
% 0.11/0.40 % (9798)Memory used [KB]: 1023
% 0.11/0.40 % (9798)Time elapsed: 0.003 s
% 0.11/0.40 % (9798)Instructions burned: 3 (million)
% 0.11/0.40 % (9798)------------------------------
% 0.11/0.40 % (9798)------------------------------
% 0.11/0.40 TRYING [2]
% 0.11/0.40 TRYING [2]
% 0.11/0.40 % (9818)Refutation found. Thanks to Tanya!
% 0.11/0.40 % SZS status Theorem for theBenchmark
% 0.11/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.40 % (9818)------------------------------
% 0.11/0.40 % (9818)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.11/0.40 % (9818)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.11/0.40 % (9818)Termination reason: Refutation
% 0.11/0.40
% 0.11/0.40 % (9818)Memory used [KB]: 5628
% 0.11/0.40 % (9818)Time elapsed: 0.098 s
% 0.11/0.40 % (9818)Instructions burned: 7 (million)
% 0.11/0.40 % (9818)------------------------------
% 0.11/0.40 % (9818)------------------------------
% 0.11/0.40 % (9789)Success in time 0.131 s
%------------------------------------------------------------------------------