%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV379+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:21:07 PM UTC 2026
% Result : Theorem 0.20s 0.29s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 67 ( 16 unt; 2 def)
% Number of atoms : 160 ( 61 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 149 ( 56 ~; 66 |; 13 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 125 ( 3 sgn 122 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(f4,axiom,
! [X0,X1] :
( strictly_less_than(X0,X1)
<=> ( less_than(X0,X1)
& ~ less_than(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(f28,axiom,
! [X0,X1] :
( ok(triple(X0,X1,bad))
<=> $false ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax40) ).
fof(f29,axiom,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> X2 = bad ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax41) ).
fof(f34,axiom,
! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax46) ).
fof(f35,axiom,
! [X0,X1,X2,X3] :
( ( X1 != create_slb
& ~ contains_slb(X1,findmin_pqp_res(X0)) )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax47) ).
fof(f36,axiom,
! [X0,X1,X2,X3] :
( ( X1 != create_slb
& contains_slb(X1,findmin_pqp_res(X0))
& strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax48) ).
fof(f37,axiom,
! [X0,X1,X2,X3] :
( ( X1 != create_slb
& contains_slb(X1,findmin_pqp_res(X0))
& less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0)) )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax49) ).
fof(f42,conjecture,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ~ ok(findmin_cpq_eff(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l15_co) ).
fof(f43,negated_conjecture,
~ ! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ~ ok(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(negated_conjecture,[status(cth)],[f42]) ).
fof(f44,plain,
! [X0,X1,X2] :
( ( X1 != create_slb
& ~ contains_slb(X1,findmin_pqp_res(X0)) )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(rectify,[],[f35]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ( X1 != create_slb
& contains_slb(X1,findmin_pqp_res(X0))
& strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(rectify,[],[f36]) ).
fof(f46,plain,
! [X0,X1,X2] :
( ( X1 != create_slb
& contains_slb(X1,findmin_pqp_res(X0))
& less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0)) )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2) ),
inference(rectify,[],[f37]) ).
fof(f48,plain,
! [X0,X1] :
( ( less_than(X0,X1)
& ~ less_than(X1,X0) )
=> strictly_less_than(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f51,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(ennf_transformation,[],[f48]) ).
fof(f52,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(flattening,[],[f51]) ).
fof(f65,plain,
! [X0,X1,X2] :
( X2 = bad
| ok(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f29]) ).
fof(f71,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| create_slb = X1
| contains_slb(X1,findmin_pqp_res(X0)) ),
inference(ennf_transformation,[],[f44]) ).
fof(f72,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| create_slb = X1
| contains_slb(X1,findmin_pqp_res(X0)) ),
inference(flattening,[],[f71]) ).
fof(f73,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| create_slb = X1
| ~ contains_slb(X1,findmin_pqp_res(X0))
| ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) ),
inference(ennf_transformation,[],[f45]) ).
fof(f74,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| create_slb = X1
| ~ contains_slb(X1,findmin_pqp_res(X0))
| ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) ),
inference(flattening,[],[f73]) ).
fof(f75,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2)
| create_slb = X1
| ~ contains_slb(X1,findmin_pqp_res(X0))
| ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0)) ),
inference(ennf_transformation,[],[f46]) ).
fof(f76,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2)
| create_slb = X1
| ~ contains_slb(X1,findmin_pqp_res(X0))
| ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0)) ),
inference(flattening,[],[f75]) ).
fof(f78,plain,
? [X0,X1,X2] :
( ok(findmin_cpq_eff(triple(X0,X1,X2)))
& ~ ok(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f43]) ).
fof(f80,plain,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f82,plain,
! [X0,X1] :
( less_than(X1,X0)
| ~ less_than(X0,X1)
| strictly_less_than(X0,X1) ),
inference(cnf_transformation,[],[f52]) ).
fof(f113,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f28]) ).
fof(f114,plain,
! [X2,X0,X1] :
( ok(triple(X0,X1,X2))
| bad = X2 ),
inference(cnf_transformation,[],[f65]) ).
fof(f119,plain,
! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
inference(cnf_transformation,[],[f34]) ).
fof(f120,plain,
! [X2,X0,X1] :
( contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(cnf_transformation,[],[f72]) ).
fof(f121,plain,
! [X2,X0,X1] :
( ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
| ~ contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(cnf_transformation,[],[f74]) ).
fof(f122,plain,
! [X2,X0,X1] :
( ~ contains_slb(X1,findmin_pqp_res(X0))
| ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2) ),
inference(cnf_transformation,[],[f76]) ).
fof(f127,plain,
~ ok(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f78]) ).
fof(f128,plain,
ok(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f78]) ).
fof(f136,plain,
! [X0,X1] :
( less_than(X1,X0)
| ~ less_than(X0,X1)
| ~ strictly_less_than(X0,X1) ),
inference(consistent_polarity_flipping,[],[f82]) ).
fof(f147,plain,
! [X0,X1] : ok(triple(X0,X1,bad)),
inference(consistent_polarity_flipping,[],[f113]) ).
fof(f148,plain,
! [X2,X0,X1] :
( ~ ok(triple(X0,X1,X2))
| bad = X2 ),
inference(consistent_polarity_flipping,[],[f114]) ).
fof(f150,plain,
! [X2,X0,X1] :
( strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
| ~ contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(consistent_polarity_flipping,[],[f121]) ).
fof(f151,plain,
~ ok(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(consistent_polarity_flipping,[],[f128]) ).
fof(f152,plain,
ok(triple(sK0,sK1,sK2)),
inference(consistent_polarity_flipping,[],[f127]) ).
fof(f154,plain,
bad = sK2,
inference(resolution,[],[f148,f152]) ).
fof(f160,plain,
~ ok(findmin_cpq_eff(triple(sK0,sK1,bad))),
inference(superposition,[],[f151,f154]) ).
fof(f163,plain,
! [X0,X1] :
( ~ strictly_less_than(X0,X1)
| less_than(X1,X0) ),
inference(forward_subsumption_resolution,[],[f136,f80]) ).
fof(f264,plain,
! [X2,X3,X0,X1] :
( ~ less_than(lookup_slb(X0,findmin_pqp_res(X1)),findmin_pqp_res(X1))
| create_slb = X0
| findmin_cpq_eff(triple(X1,X0,X2)) = triple(X1,update_slb(X0,findmin_pqp_res(X1)),X2)
| create_slb = X0
| triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad) = findmin_cpq_eff(triple(X1,X0,X3)) ),
inference(resolution,[],[f122,f120]) ).
fof(f266,plain,
! [X2,X3,X0,X1] :
( ~ less_than(lookup_slb(X0,findmin_pqp_res(X1)),findmin_pqp_res(X1))
| create_slb = X0
| findmin_cpq_eff(triple(X1,X0,X2)) = triple(X1,update_slb(X0,findmin_pqp_res(X1)),X2)
| triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad) = findmin_cpq_eff(triple(X1,X0,X3)) ),
inference(duplicate_literal_removal,[],[f264]) ).
fof(f268,plain,
! [X2,X0,X1] :
( strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(forward_subsumption_resolution,[],[f150,f120]) ).
fof(f270,plain,
! [X2,X0,X1] :
( less_than(lookup_slb(X0,findmin_pqp_res(X1)),findmin_pqp_res(X1))
| findmin_cpq_eff(triple(X1,X0,X2)) = triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad)
| create_slb = X0 ),
inference(resolution,[],[f268,f163]) ).
fof(f568,plain,
! [X2,X3,X0,X1] :
( findmin_cpq_eff(triple(X1,X0,X2)) = triple(X1,update_slb(X0,findmin_pqp_res(X1)),X2)
| triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad) = findmin_cpq_eff(triple(X1,X0,X3))
| create_slb = X0 ),
inference(forward_subsumption_resolution,[],[f266,f270]) ).
fof(f583,plain,
! [X2,X0,X1] :
( ok(findmin_cpq_eff(triple(X0,X1,bad)))
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| create_slb = X1 ),
inference(superposition,[],[f147,f568]) ).
fof(f1014,plain,
! [X0] :
( triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) = findmin_cpq_eff(triple(sK0,sK1,X0))
| create_slb = sK1 ),
inference(resolution,[],[f583,f160]) ).
fof(f1024,definition,
( spl3_3
<=> create_slb = sK1 ),
introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).
fof(f1026,plain,
( create_slb = sK1
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f1024]) ).
fof(f1028,definition,
( spl3_4
<=> ! [X0] : triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) = findmin_cpq_eff(triple(sK0,sK1,X0)) ),
introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition]) ).
fof(f1029,plain,
( ! [X0] : triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) = findmin_cpq_eff(triple(sK0,sK1,X0))
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f1028]) ).
fof(f1030,plain,
( spl3_3
| spl3_4 ),
inference(avatar_split_clause,[],[f1014,f1028,f1024]) ).
fof(f1062,plain,
( ~ ok(findmin_cpq_eff(triple(sK0,create_slb,bad)))
| ~ spl3_3 ),
inference(superposition,[],[f160,f1026]) ).
fof(f1067,plain,
( ~ ok(triple(sK0,create_slb,bad))
| ~ spl3_3 ),
inference(forward_demodulation,[],[f1062,f119]) ).
fof(f1070,plain,
( $false
| ~ spl3_3 ),
inference(forward_subsumption_resolution,[],[f1067,f147]) ).
fof(f1071,plain,
~ spl3_3,
inference(avatar_contradiction_clause,[],[f1070]) ).
fof(f1168,plain,
( ! [X0] : ok(findmin_cpq_eff(triple(sK0,sK1,X0)))
| ~ spl3_4 ),
inference(superposition,[],[f147,f1029]) ).
fof(f1277,plain,
( $false
| ~ spl3_4 ),
inference(backward_subsumption_resolution,[],[f160,f1168]) ).
fof(f1285,plain,
~ spl3_4,
inference(avatar_contradiction_clause,[],[f1277]) ).
cnf(s3,plain,
( spl3_3
| spl3_4 ),
inference(sat_conversion,[],[f1030]) ).
cnf(s7,plain,
~ spl3_3,
inference(sat_conversion,[],[f1071]) ).
cnf(s25,plain,
~ spl3_4,
inference(sat_conversion,[],[f1285]) ).
cnf(s27,plain,
$false,
inference(rat,[],[s3,s25,s7]) ).
fof(f1286,plain,
$false,
inference(avatar_sat_refutation,[],[s27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV379+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n005.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 10:45:02 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.29 % (710983)Will run a generic schedule for satisfiability detection.
% 0.20/0.29 % (710989)% WARNING: option uhcvi not known.
% 0.20/0.29 % (710989)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1519755192:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.29 % (710988)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1652962731_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.29 % (710990)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3688168518:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.29 % (710991)dis+10_1_sil=32000:sp=arity:random_seed=801591209:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.29 % (710992)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3741556509:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.29 % (710993)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=60442321:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.29 % (710994)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2631905283:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.29 % TRYING [1]
% 0.20/0.29 % TRYING [2]
% 0.20/0.29 % TRYING [3]
% 0.20/0.29 % (710989) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-710983-710989"...
% 0.20/0.29 % (710989)...printing done.
% 0.20/0.29 % (710989)Refutation found. Thanks to Tanya!
% 0.20/0.29 % SZS status Theorem for theBenchmark
% 0.20/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.30 % (710989)------------------------------
% 0.20/0.30 % (710989)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (710989)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (710989)CaDiCaL version: 2.1.3
% 0.20/0.30 % (710989)Termination reason: Refutation
% 0.20/0.30 % (710989)Time elapsed: 0.035 s
% 0.20/0.30 % (710989)Peak memory usage: 13 MB
% 0.20/0.30 % (710989)Instructions burned: 107 (million)
% 0.20/0.30 % (710983)Success in time 0.064 s
% 0.20/0.30 % Vampire exiting
%------------------------------------------------------------------------------