TSTP Solution File: SWV417+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWV417+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 : n016.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:46 EDT 2022
% Result : Theorem 0.21s 0.54s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 10
% Syntax : Number of formulae : 46 ( 15 unt; 0 def)
% Number of atoms : 109 ( 25 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 108 ( 45 ~; 33 |; 19 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-3 aty)
% Number of variables : 69 ( 57 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f378,plain,
$false,
inference(subsumption_resolution,[],[f377,f312]) ).
fof(f312,plain,
pi_sharp_find_min(sF9,sF8),
inference(forward_demodulation,[],[f311,f298]) ).
fof(f298,plain,
sF9 = i(sF6),
introduced(function_definition,[]) ).
fof(f311,plain,
pi_sharp_find_min(i(sF6),sF8),
inference(subsumption_resolution,[],[f310,f296]) ).
fof(f296,plain,
phi(sF7),
inference(definition_folding,[],[f253,f295,f293]) ).
fof(f293,plain,
sF6 = triple(sK2,sK4,sK3),
introduced(function_definition,[]) ).
fof(f295,plain,
findmin_cpq_eff(sF6) = sF7,
introduced(function_definition,[]) ).
fof(f253,plain,
phi(findmin_cpq_eff(triple(sK2,sK4,sK3))),
inference(cnf_transformation,[],[f184]) ).
fof(f184,plain,
( pi_find_min(triple(sK2,sK4,sK3))
& phi(findmin_cpq_eff(triple(sK2,sK4,sK3)))
& ! [X3] :
( findmin_cpq_res(triple(sK2,sK4,sK3)) != findmin_pq_res(i(triple(sK2,sK4,sK3)),X3)
| ~ pi_sharp_find_min(i(triple(sK2,sK4,sK3)),X3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f111,f183]) ).
fof(f183,plain,
( ? [X0,X1,X2] :
( pi_find_min(triple(X0,X2,X1))
& phi(findmin_cpq_eff(triple(X0,X2,X1)))
& ! [X3] :
( findmin_cpq_res(triple(X0,X2,X1)) != findmin_pq_res(i(triple(X0,X2,X1)),X3)
| ~ pi_sharp_find_min(i(triple(X0,X2,X1)),X3) ) )
=> ( pi_find_min(triple(sK2,sK4,sK3))
& phi(findmin_cpq_eff(triple(sK2,sK4,sK3)))
& ! [X3] :
( findmin_cpq_res(triple(sK2,sK4,sK3)) != findmin_pq_res(i(triple(sK2,sK4,sK3)),X3)
| ~ pi_sharp_find_min(i(triple(sK2,sK4,sK3)),X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f111,plain,
? [X0,X1,X2] :
( pi_find_min(triple(X0,X2,X1))
& phi(findmin_cpq_eff(triple(X0,X2,X1)))
& ! [X3] :
( findmin_cpq_res(triple(X0,X2,X1)) != findmin_pq_res(i(triple(X0,X2,X1)),X3)
| ~ pi_sharp_find_min(i(triple(X0,X2,X1)),X3) ) ),
inference(flattening,[],[f110]) ).
fof(f110,plain,
? [X0,X1,X2] :
( ! [X3] :
( findmin_cpq_res(triple(X0,X2,X1)) != findmin_pq_res(i(triple(X0,X2,X1)),X3)
| ~ pi_sharp_find_min(i(triple(X0,X2,X1)),X3) )
& phi(findmin_cpq_eff(triple(X0,X2,X1)))
& pi_find_min(triple(X0,X2,X1)) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0,X1,X2] :
( pi_find_min(triple(X0,X2,X1))
=> ( phi(findmin_cpq_eff(triple(X0,X2,X1)))
=> ? [X3] :
( findmin_cpq_res(triple(X0,X2,X1)) = findmin_pq_res(i(triple(X0,X2,X1)),X3)
& pi_sharp_find_min(i(triple(X0,X2,X1)),X3) ) ) ),
inference(rectify,[],[f65]) ).
fof(f65,negated_conjecture,
~ ! [X0,X2,X1] :
( pi_find_min(triple(X0,X1,X2))
=> ( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> ? [X3] :
( findmin_cpq_res(triple(X0,X1,X2)) = findmin_pq_res(i(triple(X0,X1,X2)),X3)
& pi_sharp_find_min(i(triple(X0,X1,X2)),X3) ) ) ),
inference(negated_conjecture,[],[f64]) ).
fof(f64,conjecture,
! [X0,X2,X1] :
( pi_find_min(triple(X0,X1,X2))
=> ( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> ? [X3] :
( findmin_cpq_res(triple(X0,X1,X2)) = findmin_pq_res(i(triple(X0,X1,X2)),X3)
& pi_sharp_find_min(i(triple(X0,X1,X2)),X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co4) ).
fof(f310,plain,
( pi_sharp_find_min(i(sF6),sF8)
| ~ phi(sF7) ),
inference(forward_demodulation,[],[f309,f295]) ).
fof(f309,plain,
( ~ phi(findmin_cpq_eff(sF6))
| pi_sharp_find_min(i(sF6),sF8) ),
inference(forward_demodulation,[],[f308,f297]) ).
fof(f297,plain,
removemin_cpq_res(sF6) = sF8,
introduced(function_definition,[]) ).
fof(f308,plain,
( pi_sharp_find_min(i(sF6),removemin_cpq_res(sF6))
| ~ phi(findmin_cpq_eff(sF6)) ),
inference(superposition,[],[f288,f293]) ).
fof(f288,plain,
! [X2,X0,X1] :
( ~ phi(findmin_cpq_eff(triple(X1,X0,X2)))
| pi_sharp_find_min(i(triple(X1,X0,X2)),removemin_cpq_res(triple(X1,X0,X2))) ),
inference(definition_unfolding,[],[f266,f220]) ).
fof(f220,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(f266,plain,
! [X2,X0,X1] :
( ~ phi(findmin_cpq_eff(triple(X1,X0,X2)))
| pi_sharp_find_min(i(triple(X1,X0,X2)),findmin_cpq_res(triple(X1,X0,X2))) ),
inference(cnf_transformation,[],[f196]) ).
fof(f196,plain,
! [X0,X1,X2] :
( ~ phi(findmin_cpq_eff(triple(X1,X0,X2)))
| pi_sharp_find_min(i(triple(X1,X0,X2)),findmin_cpq_res(triple(X1,X0,X2))) ),
inference(rectify,[],[f137]) ).
fof(f137,plain,
! [X2,X1,X0] :
( ~ phi(findmin_cpq_eff(triple(X1,X2,X0)))
| pi_sharp_find_min(i(triple(X1,X2,X0)),findmin_cpq_res(triple(X1,X2,X0))) ),
inference(ennf_transformation,[],[f67]) ).
fof(f67,plain,
! [X1,X2,X0] :
( phi(findmin_cpq_eff(triple(X1,X2,X0)))
=> pi_sharp_find_min(i(triple(X1,X2,X0)),findmin_cpq_res(triple(X1,X2,X0))) ),
inference(rectify,[],[f63]) ).
fof(f63,axiom,
! [X2,X0,X1] :
( 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',main4_l7) ).
fof(f377,plain,
~ pi_sharp_find_min(sF9,sF8),
inference(trivial_inequality_removal,[],[f376]) ).
fof(f376,plain,
( sF8 != sF8
| ~ pi_sharp_find_min(sF9,sF8) ),
inference(superposition,[],[f299,f325]) ).
fof(f325,plain,
findmin_pq_res(sF9,sF8) = sF8,
inference(subsumption_resolution,[],[f324,f314]) ).
fof(f314,plain,
issmallestelement_pq(sF9,sF8),
inference(resolution,[],[f312,f270]) ).
fof(f270,plain,
! [X0,X1] :
( ~ pi_sharp_find_min(X0,X1)
| issmallestelement_pq(X0,X1) ),
inference(cnf_transformation,[],[f200]) ).
fof(f200,plain,
! [X0,X1] :
( ( pi_sharp_find_min(X0,X1)
| ~ contains_pq(X0,X1)
| ~ issmallestelement_pq(X0,X1) )
& ( ( contains_pq(X0,X1)
& issmallestelement_pq(X0,X1) )
| ~ pi_sharp_find_min(X0,X1) ) ),
inference(flattening,[],[f199]) ).
fof(f199,plain,
! [X0,X1] :
( ( pi_sharp_find_min(X0,X1)
| ~ contains_pq(X0,X1)
| ~ issmallestelement_pq(X0,X1) )
& ( ( contains_pq(X0,X1)
& issmallestelement_pq(X0,X1) )
| ~ pi_sharp_find_min(X0,X1) ) ),
inference(nnf_transformation,[],[f58]) ).
fof(f58,axiom,
! [X0,X1] :
( pi_sharp_find_min(X0,X1)
<=> ( contains_pq(X0,X1)
& issmallestelement_pq(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax58) ).
fof(f324,plain,
( ~ issmallestelement_pq(sF9,sF8)
| findmin_pq_res(sF9,sF8) = sF8 ),
inference(resolution,[],[f260,f313]) ).
fof(f313,plain,
contains_pq(sF9,sF8),
inference(resolution,[],[f312,f271]) ).
fof(f271,plain,
! [X0,X1] :
( ~ pi_sharp_find_min(X0,X1)
| contains_pq(X0,X1) ),
inference(cnf_transformation,[],[f200]) ).
fof(f260,plain,
! [X0,X1] :
( ~ contains_pq(X1,X0)
| ~ issmallestelement_pq(X1,X0)
| findmin_pq_res(X1,X0) = X0 ),
inference(cnf_transformation,[],[f191]) ).
fof(f191,plain,
! [X0,X1] :
( findmin_pq_res(X1,X0) = X0
| ~ issmallestelement_pq(X1,X0)
| ~ contains_pq(X1,X0) ),
inference(rectify,[],[f133]) ).
fof(f133,plain,
! [X1,X0] :
( findmin_pq_res(X0,X1) = X1
| ~ issmallestelement_pq(X0,X1)
| ~ contains_pq(X0,X1) ),
inference(flattening,[],[f132]) ).
fof(f132,plain,
! [X0,X1] :
( findmin_pq_res(X0,X1) = X1
| ~ contains_pq(X0,X1)
| ~ issmallestelement_pq(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,axiom,
! [X0,X1] :
( ( contains_pq(X0,X1)
& issmallestelement_pq(X0,X1) )
=> findmin_pq_res(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax14) ).
fof(f299,plain,
! [X3] :
( findmin_pq_res(sF9,X3) != sF8
| ~ pi_sharp_find_min(sF9,X3) ),
inference(definition_folding,[],[f287,f298,f293,f298,f293,f297,f293]) ).
fof(f287,plain,
! [X3] :
( removemin_cpq_res(triple(sK2,sK4,sK3)) != findmin_pq_res(i(triple(sK2,sK4,sK3)),X3)
| ~ pi_sharp_find_min(i(triple(sK2,sK4,sK3)),X3) ),
inference(definition_unfolding,[],[f252,f220]) ).
fof(f252,plain,
! [X3] :
( findmin_cpq_res(triple(sK2,sK4,sK3)) != findmin_pq_res(i(triple(sK2,sK4,sK3)),X3)
| ~ pi_sharp_find_min(i(triple(sK2,sK4,sK3)),X3) ),
inference(cnf_transformation,[],[f184]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWV417+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/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.14/0.35 % Computer : n016.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 Aug 30 19:46:01 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.47 % (14429)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.21/0.49 % (14438)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.21/0.49 TRYING [1]
% 0.21/0.50 % (14446)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)
% 0.21/0.50 TRYING [2]
% 0.21/0.51 % (14431)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.21/0.52 % (14427)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.52 % (14431)Instruction limit reached!
% 0.21/0.52 % (14431)------------------------------
% 0.21/0.52 % (14431)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52 % (14423)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.21/0.52 % (14431)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52 % (14431)Termination reason: Unknown
% 0.21/0.52 % (14431)Termination phase: Preprocessing 3
% 0.21/0.52
% 0.21/0.52 % (14431)Memory used [KB]: 1023
% 0.21/0.52 % (14431)Time elapsed: 0.003 s
% 0.21/0.52 % (14431)Instructions burned: 3 (million)
% 0.21/0.52 % (14431)------------------------------
% 0.21/0.52 % (14431)------------------------------
% 0.21/0.52 % (14440)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.21/0.52 % (14441)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.21/0.52 % (14424)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.21/0.53 % (14448)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.21/0.53 % (14447)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.21/0.53 TRYING [1]
% 0.21/0.53 % (14442)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.54 TRYING [3]
% 0.21/0.54 % (14439)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.21/0.54 % (14451)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.21/0.54 % (14429)Instruction limit reached!
% 0.21/0.54 % (14429)------------------------------
% 0.21/0.54 % (14429)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.54 % (14429)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.54 % (14429)Termination reason: Unknown
% 0.21/0.54 % (14429)Termination phase: Finite model building constraint generation
% 0.21/0.54
% 0.21/0.54 % (14429)Memory used [KB]: 8315
% 0.21/0.54 % (14429)Time elapsed: 0.151 s
% 0.21/0.54 % (14429)Instructions burned: 52 (million)
% 0.21/0.54 % (14429)------------------------------
% 0.21/0.54 % (14429)------------------------------
% 0.21/0.54 TRYING [2]
% 0.21/0.54 % (14426)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.21/0.54 % (14450)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.21/0.54 % (14427)First to succeed.
% 0.21/0.54 % (14425)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.21/0.54 % (14430)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.54 % (14427)Refutation found. Thanks to Tanya!
% 0.21/0.54 % SZS status Theorem for theBenchmark
% 0.21/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.55 % (14427)------------------------------
% 0.21/0.55 % (14427)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.55 % (14427)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.55 % (14427)Termination reason: Refutation
% 0.21/0.55
% 0.21/0.55 % (14427)Memory used [KB]: 5756
% 0.21/0.55 % (14427)Time elapsed: 0.145 s
% 0.21/0.55 % (14427)Instructions burned: 8 (million)
% 0.21/0.55 % (14427)------------------------------
% 0.21/0.55 % (14427)------------------------------
% 0.21/0.55 % (14418)Success in time 0.19 s
%------------------------------------------------------------------------------