%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV404+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 : n001.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:10 PM UTC 2026
% Result : Theorem 12.75s 2.09s
% Output : Refutation 12.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 17
% Syntax : Number of formulae : 102 ( 23 unt; 6 def)
% Number of atoms : 255 ( 60 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 249 ( 96 ~; 116 |; 19 &)
% ( 7 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 13 ( 11 usr; 7 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 5 con; 0-3 aty)
% Number of variables : 150 ( 3 sgn 144 !; 6 ?)
% 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(f24,axiom,
! [X0,X1] : check_cpq(triple(X0,create_slb,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax36) ).
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(f40,axiom,
! [X0] : removemin_cpq_eff(X0) = remove_cpq(findmin_cpq_eff(X0),findmin_cpq_res(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax52) ).
fof(f41,axiom,
! [X0] : removemin_cpq_res(X0) = findmin_cpq_res(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax53) ).
fof(f42,axiom,
! [X0,X1,X2,X3] :
( ( check_cpq(remove_cpq(triple(X0,X1,X2),X3))
& ok(remove_cpq(triple(X0,X1,X2),X3)) )
=> check_cpq(triple(X0,X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l40_l27) ).
fof(f43,axiom,
! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l40_l34) ).
fof(f44,conjecture,
! [X0,X1,X2] :
( ( check_cpq(removemin_cpq_eff(triple(X0,X1,X2)))
& ok(removemin_cpq_eff(triple(X0,X1,X2))) )
=> check_cpq(triple(X0,X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l40_co) ).
fof(f45,negated_conjecture,
~ ! [X0,X1,X2] :
( ( check_cpq(removemin_cpq_eff(triple(X0,X1,X2)))
& ok(removemin_cpq_eff(triple(X0,X1,X2))) )
=> check_cpq(triple(X0,X1,X2)) ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f46,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(f47,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(f48,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(f50,plain,
! [X0,X1] :
( ( less_than(X0,X1)
& ~ less_than(X1,X0) )
=> strictly_less_than(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f53,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(ennf_transformation,[],[f50]) ).
fof(f54,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(flattening,[],[f53]) ).
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)) ),
inference(ennf_transformation,[],[f46]) ).
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)) ),
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)),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,[],[f47]) ).
fof(f76,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,[],[f75]) ).
fof(f77,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,[],[f48]) ).
fof(f78,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,[],[f77]) ).
fof(f80,plain,
! [X0,X1,X2,X3] :
( check_cpq(triple(X0,X1,X2))
| ~ check_cpq(remove_cpq(triple(X0,X1,X2),X3))
| ~ ok(remove_cpq(triple(X0,X1,X2),X3)) ),
inference(ennf_transformation,[],[f42]) ).
fof(f81,plain,
! [X0,X1,X2,X3] :
( check_cpq(triple(X0,X1,X2))
| ~ check_cpq(remove_cpq(triple(X0,X1,X2),X3))
| ~ ok(remove_cpq(triple(X0,X1,X2),X3)) ),
inference(flattening,[],[f80]) ).
fof(f82,plain,
! [X0,X1,X2] :
( ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2)))
| check_cpq(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f43]) ).
fof(f83,plain,
? [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
& check_cpq(removemin_cpq_eff(triple(X0,X1,X2)))
& ok(removemin_cpq_eff(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f45]) ).
fof(f84,plain,
? [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
& check_cpq(removemin_cpq_eff(triple(X0,X1,X2)))
& ok(removemin_cpq_eff(triple(X0,X1,X2))) ),
inference(flattening,[],[f83]) ).
fof(f86,plain,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f88,plain,
! [X0,X1] :
( less_than(X1,X0)
| ~ less_than(X0,X1)
| strictly_less_than(X0,X1) ),
inference(cnf_transformation,[],[f54]) ).
fof(f113,plain,
! [X0,X1] : check_cpq(triple(X0,create_slb,X1)),
inference(cnf_transformation,[],[f24]) ).
fof(f126,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,[],[f74]) ).
fof(f127,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,[],[f76]) ).
fof(f128,plain,
! [X2,X0,X1] :
( ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),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)),X2) ),
inference(cnf_transformation,[],[f78]) ).
fof(f131,plain,
! [X0] : removemin_cpq_eff(X0) = remove_cpq(findmin_cpq_eff(X0),findmin_cpq_res(X0)),
inference(cnf_transformation,[],[f40]) ).
fof(f132,plain,
! [X0] : findmin_cpq_res(X0) = removemin_cpq_res(X0),
inference(cnf_transformation,[],[f41]) ).
fof(f133,plain,
! [X2,X3,X0,X1] :
( check_cpq(triple(X0,X1,X2))
| ~ check_cpq(remove_cpq(triple(X0,X1,X2),X3))
| ~ ok(remove_cpq(triple(X0,X1,X2),X3)) ),
inference(cnf_transformation,[],[f81]) ).
fof(f134,plain,
! [X2,X0,X1] :
( ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2)))
| check_cpq(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f82]) ).
fof(f135,plain,
ok(removemin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f84]) ).
fof(f136,plain,
check_cpq(removemin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f84]) ).
fof(f137,plain,
~ check_cpq(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f84]) ).
fof(f138,plain,
! [X0] : removemin_cpq_eff(X0) = remove_cpq(findmin_cpq_eff(X0),removemin_cpq_res(X0)),
inference(definition_unfolding,[],[f131,f132]) ).
fof(f142,plain,
check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),removemin_cpq_res(triple(sK0,sK1,sK2)))),
inference(definition_unfolding,[],[f136,f138]) ).
fof(f143,plain,
ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),removemin_cpq_res(triple(sK0,sK1,sK2)))),
inference(definition_unfolding,[],[f135,f138]) ).
fof(f148,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| less_than(X1,X0) ),
inference(forward_subsumption_resolution,[],[f88,f86]) ).
fof(f160,definition,
( spl3_1
<=> create_slb = sK1 ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
fof(f161,plain,
( create_slb != sK1
| spl3_1 ),
inference(avatar_component_clause,[],[f160]) ).
fof(f162,plain,
( create_slb = sK1
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f160]) ).
fof(f180,plain,
( ~ check_cpq(triple(sK0,create_slb,sK2))
| ~ spl3_1 ),
inference(superposition,[],[f137,f162]) ).
fof(f181,plain,
( $false
| ~ spl3_1 ),
inference(forward_subsumption_resolution,[],[f180,f113]) ).
fof(f182,plain,
~ spl3_1,
inference(avatar_contradiction_clause,[],[f181]) ).
fof(f262,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,[],[f127,f126]) ).
fof(f267,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,[],[f262,f148]) ).
fof(f408,plain,
! [X2,X3,X0,X1] :
( 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))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X3)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X3) ),
inference(resolution,[],[f267,f128]) ).
fof(f416,plain,
! [X2,X3,X0,X1] :
( 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))
| findmin_cpq_eff(triple(X0,X1,X3)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X3) ),
inference(duplicate_literal_removal,[],[f408]) ).
fof(f418,plain,
! [X2,X3,X0,X1] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| findmin_cpq_eff(triple(X0,X1,X3)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X3)
| create_slb = X1 ),
inference(forward_subsumption_resolution,[],[f416,f126]) ).
fof(f1712,definition,
( spl3_10
<=> check_cpq(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad)) ),
introduced(definition,[new_symbols(definition,[spl3_10])],[avatar_definition]) ).
fof(f1713,plain,
( check_cpq(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad))
| ~ spl3_10 ),
inference(avatar_component_clause,[],[f1712]) ).
fof(f1714,plain,
( ~ check_cpq(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad))
| spl3_10 ),
inference(avatar_component_clause,[],[f1712]) ).
fof(f1806,definition,
( spl3_13
<=> ! [X1] : findmin_cpq_eff(triple(sK0,sK1,X1)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),X1) ),
introduced(definition,[new_symbols(definition,[spl3_13])],[avatar_definition]) ).
fof(f1807,plain,
( ! [X1] : findmin_cpq_eff(triple(sK0,sK1,X1)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),X1)
| ~ spl3_13 ),
inference(avatar_component_clause,[],[f1806]) ).
fof(f1891,plain,
( ! [X0] :
( ~ ok(remove_cpq(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad),X0))
| ~ check_cpq(remove_cpq(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad),X0)) )
| spl3_10 ),
inference(resolution,[],[f1714,f133]) ).
fof(f2587,plain,
( ! [X2,X0,X1] :
( ~ ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,X0)),X1))
| ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,X0)),X1))
| findmin_cpq_eff(triple(sK0,sK1,X2)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),X2)
| create_slb = sK1 )
| spl3_10 ),
inference(superposition,[],[f1891,f418]) ).
fof(f2593,plain,
( ! [X2,X0,X1] :
( ~ ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,X0)),X1))
| ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,X0)),X1))
| findmin_cpq_eff(triple(sK0,sK1,X2)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),X2) )
| spl3_1
| spl3_10 ),
inference(forward_subsumption_resolution,[],[f2587,f161]) ).
fof(f3897,definition,
( spl3_20
<=> ! [X0,X1] :
( ~ ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,X0)),X1))
| ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,X0)),X1)) ) ),
introduced(definition,[new_symbols(definition,[spl3_20])],[avatar_definition]) ).
fof(f3898,plain,
( ! [X0,X1] :
( ~ ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,X0)),X1))
| ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,X0)),X1)) )
| ~ spl3_20 ),
inference(avatar_component_clause,[],[f3897]) ).
fof(f3899,plain,
( spl3_13
| spl3_20
| spl3_1
| spl3_10 ),
inference(avatar_split_clause,[],[f2593,f1712,f160,f3897,f1806]) ).
fof(f3927,plain,
( ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),removemin_cpq_res(triple(sK0,sK1,sK2))))
| ~ spl3_20 ),
inference(resolution,[],[f3898,f143]) ).
fof(f3937,plain,
( $false
| ~ spl3_20 ),
inference(forward_subsumption_resolution,[],[f3927,f142]) ).
fof(f3938,plain,
~ spl3_20,
inference(avatar_contradiction_clause,[],[f3937]) ).
fof(f4527,plain,
( ! [X0,X1] :
( check_cpq(findmin_cpq_eff(triple(sK0,sK1,X0)))
| ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,X0)),X1))
| ~ ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,X0)),X1)) )
| ~ spl3_13 ),
inference(superposition,[],[f133,f1807]) ).
fof(f6470,definition,
( spl3_22
<=> check_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2))) ),
introduced(definition,[new_symbols(definition,[spl3_22])],[avatar_definition]) ).
fof(f6471,plain,
( check_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)))
| ~ spl3_22 ),
inference(avatar_component_clause,[],[f6470]) ).
fof(f6472,plain,
( ~ check_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)))
| spl3_22 ),
inference(avatar_component_clause,[],[f6470]) ).
fof(f11066,plain,
( ! [X0] :
( ~ ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),X0))
| ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),X0)) )
| ~ spl3_13
| spl3_22 ),
inference(resolution,[],[f4527,f6472]) ).
fof(f11145,plain,
( ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),removemin_cpq_res(triple(sK0,sK1,sK2))))
| ~ spl3_13
| spl3_22 ),
inference(resolution,[],[f11066,f143]) ).
fof(f11157,plain,
( $false
| ~ spl3_13
| spl3_22 ),
inference(forward_subsumption_resolution,[],[f11145,f142]) ).
fof(f11158,plain,
( ~ spl3_13
| spl3_22 ),
inference(avatar_contradiction_clause,[],[f11157]) ).
fof(f11561,plain,
( check_cpq(triple(sK0,sK1,sK2))
| ~ spl3_22 ),
inference(resolution,[],[f6471,f134]) ).
fof(f11570,plain,
( $false
| ~ spl3_22 ),
inference(forward_subsumption_resolution,[],[f11561,f137]) ).
fof(f11571,plain,
~ spl3_22,
inference(avatar_contradiction_clause,[],[f11570]) ).
fof(f11605,plain,
( ! [X0,X1] :
( check_cpq(findmin_cpq_eff(triple(sK0,sK1,X0)))
| findmin_cpq_eff(triple(sK0,sK1,X1)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),X1)
| create_slb = sK1 )
| ~ spl3_10 ),
inference(superposition,[],[f1713,f418]) ).
fof(f11613,plain,
( ! [X0,X1] :
( check_cpq(findmin_cpq_eff(triple(sK0,sK1,X0)))
| findmin_cpq_eff(triple(sK0,sK1,X1)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),X1) )
| spl3_1
| ~ spl3_10 ),
inference(forward_subsumption_resolution,[],[f11605,f161]) ).
fof(f11858,definition,
( spl3_28
<=> ! [X0] : check_cpq(findmin_cpq_eff(triple(sK0,sK1,X0))) ),
introduced(definition,[new_symbols(definition,[spl3_28])],[avatar_definition]) ).
fof(f11859,plain,
( ! [X0] : check_cpq(findmin_cpq_eff(triple(sK0,sK1,X0)))
| ~ spl3_28 ),
inference(avatar_component_clause,[],[f11858]) ).
fof(f11860,plain,
( spl3_13
| spl3_28
| spl3_1
| ~ spl3_10 ),
inference(avatar_split_clause,[],[f11613,f1712,f160,f11858,f1806]) ).
fof(f11912,plain,
( $false
| spl3_22
| ~ spl3_28 ),
inference(resolution,[],[f11859,f6472]) ).
fof(f11929,plain,
( spl3_22
| ~ spl3_28 ),
inference(avatar_contradiction_clause,[],[f11912]) ).
cnf(s3,plain,
~ spl3_1,
inference(sat_conversion,[],[f182]) ).
cnf(s19,plain,
( spl3_1
| spl3_10
| spl3_13
| spl3_20 ),
inference(sat_conversion,[],[f3899]) ).
cnf(s21,plain,
~ spl3_20,
inference(sat_conversion,[],[f3938]) ).
cnf(s32,plain,
( ~ spl3_13
| spl3_22 ),
inference(sat_conversion,[],[f11158]) ).
cnf(s36,plain,
~ spl3_22,
inference(sat_conversion,[],[f11571]) ).
cnf(s37,plain,
( spl3_1
| ~ spl3_10
| spl3_13
| spl3_28 ),
inference(sat_conversion,[],[f11860]) ).
cnf(s38,plain,
( spl3_22
| ~ spl3_28 ),
inference(sat_conversion,[],[f11929]) ).
cnf(s39,plain,
~ spl3_28,
inference(rat,[],[s38,s36]) ).
cnf(s40,plain,
~ spl3_13,
inference(rat,[],[s32,s36]) ).
cnf(s41,plain,
( spl3_1
| spl3_10 ),
inference(rat,[],[s19,s21,s40]) ).
cnf(s44,plain,
~ spl3_10,
inference(rat,[],[s37,s39,s40,s3]) ).
cnf(s45,plain,
$false,
inference(rat,[],[s41,s44,s3]) ).
fof(f11930,plain,
$false,
inference(avatar_sat_refutation,[],[s45]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV404+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n001.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:56:18 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 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
% 12.75/2.08 % (281423)Will run a generic schedule for satisfiability detection.
% 12.75/2.08 % (281432)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2436997512:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 12.75/2.08 % (281429)% WARNING: option uhcvi not known.
% 12.75/2.08 % (281428)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2064318767_2999 on theBenchmark for (2999ds/0Mi)
% 12.75/2.08 % (281429)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4212413186:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 12.75/2.08 % (281430)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1600476253:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 12.75/2.08 % (281431)dis+10_1_sil=32000:sp=arity:random_seed=1732996499:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 12.75/2.08 % (281433)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1655808491:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 12.75/2.08 % (281434)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3770906679:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 12.75/2.08 % TRYING [1]
% 12.75/2.08 % TRYING [2]
% 12.75/2.08 % TRYING [3]
% 12.75/2.08 % (281432)Instruction limit reached!
% 12.75/2.08 % (281432)------------------------------
% 12.75/2.08 % (281432)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 12.75/2.08 % (281432)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.75/2.08 % (281432)CaDiCaL version: 2.1.3
% 12.75/2.08 % (281432)Termination reason: Instruction limit
% 12.75/2.08 % (281432)Termination phase: Saturation
% 12.75/2.08 % (281432)Time elapsed: 0.028 s
% 12.75/2.08 % (281432)Peak memory usage: 12 MB
% 12.75/2.08 % (281432)Instructions burned: 117 (million)
% 12.75/2.08 % TRYING [4]
% 12.75/2.08 % (281442)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2802090449:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 12.75/2.08 % TRYING [1]
% 12.75/2.08 % TRYING [2]
% 12.75/2.08 % TRYING [3]
% 12.75/2.08 % TRYING [4]
% 12.75/2.08 % (281431)Instruction limit reached!
% 12.75/2.08 % (281431)------------------------------
% 12.75/2.08 % (281431)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 12.75/2.08 % (281431)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.75/2.08 % (281431)CaDiCaL version: 2.1.3
% 12.75/2.08 % (281431)Termination reason: Instruction limit
% 12.75/2.08 % (281431)Termination phase: Saturation
% 12.75/2.08 % (281431)Time elapsed: 0.062 s
% 12.75/2.08 % (281431)Peak memory usage: 12 MB
% 12.75/2.08 % (281431)Instructions burned: 104 (million)
% 12.75/2.08 % (281433)Instruction limit reached!
% 12.75/2.08 % (281433)------------------------------
% 12.75/2.08 % (281433)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 12.75/2.08 % (281433)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.75/2.08 % (281433)CaDiCaL version: 2.1.3
% 12.75/2.08 % (281433)Termination reason: Instruction limit
% 12.75/2.08 % (281433)Termination phase: Saturation
% 12.75/2.08 % (281433)Time elapsed: 0.076 s
% 12.75/2.08 % (281433)Peak memory usage: 12 MB
% 12.75/2.08 % (281433)Instructions burned: 131 (million)
% 12.75/2.08 % (281444)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=344809272:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 12.75/2.08 % (281434)Instruction limit reached!
% 12.75/2.08 % (281434)------------------------------
% 12.75/2.08 % (281434)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 12.75/2.08 % (281434)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.75/2.08 % (281434)CaDiCaL version: 2.1.3
% 12.75/2.08 % (281434)Termination reason: Instruction limit
% 12.75/2.08 % (281434)Termination phase: Saturation
% 12.75/2.08 % (281434)Time elapsed: 0.081 s
% 12.75/2.08 % (281434)Peak memory usage: 13 MB
% 12.75/2.08 % (281434)Instructions burned: 159 (million)
% 12.75/2.08 % (281445)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=4115935772:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 12.75/2.08 % (281447)ott-21_1_sil=16000:fs=off:random_seed=2409207042:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 12.75/2.08 % TRYING [5]
% 12.75/2.08 % TRYING [5]
% 12.75/2.08 % (281444)Instruction limit reached!
% 12.75/2.08 % (281444)------------------------------
% 12.75/2.08 % (281444)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 12.75/2.08 % (281444)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.75/2.08 % (281444)CaDiCaL version: 2.1.3
% 12.75/2.08 % (281444)Termination reason: Instruction limit
% 12.75/2.08 % (281444)Termination phase: Saturation
% 12.75/2.08 % (281444)Time elapsed: 0.076 s
% 12.75/2.08 % (281444)Peak memory usage: 13 MB
% 12.75/2.08 % (281444)Instructions burned: 133 (million)
% 12.75/2.08 % (281442)Instruction limit reached!
% 12.75/2.08 % (281442)------------------------------
% 12.75/2.08 % (281442)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 12.75/2.08 % (281442)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.75/2.08 % (281442)CaDiCaL version: 2.1.3
% 12.75/2.08 % (281442)Termination reason: Instruction limit
% 12.75/2.08 % (281442)Termination phase: Finite model building constraint generation
% 12.75/2.08 % (281442)Time elapsed: 0.148 s
% 12.75/2.08 % (281442)Peak memory usage: 34 MB
% 12.75/2.08 % (281442)Instructions burned: 717 (million)
% 12.75/2.08 % (281450)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1169495967:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 12.75/2.08 % (281452)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3679761887:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 12.75/2.08 % TRYING [1]
% 12.75/2.08 % TRYING [2]
% 12.75/2.08 % TRYING [3]
% 12.75/2.08 % (281447)Instruction limit reached!
% 12.75/2.08 % (281447)------------------------------
% 12.75/2.08 % (281447)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 12.75/2.08 % (281447)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.75/2.08 % (281447)CaDiCaL version: 2.1.3
% 12.75/2.08 % (281447)Termination reason: Instruction limit
% 12.75/2.08 % (281447)Termination phase: Saturation
% 12.75/2.08 % (281447)Time elapsed: 0.100 s
% 12.75/2.08 % (281447)Peak memory usage: 12 MB
% 12.75/2.08 % (281447)Instructions burned: 182 (million)
% 12.75/2.08 % (281454)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2242651584:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 12.75/2.08 % TRYING [4]
% 12.75/2.08 % TRYING [5]
% 12.75/2.08 % TRYING [6]
% 12.75/2.08 % (281452)Instruction limit reached!
% 12.75/2.08 % (281452)------------------------------
% 12.75/2.08 % (281452)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 12.75/2.08 % (281452)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.75/2.08 % (281452)CaDiCaL version: 2.1.3
% 12.75/2.08 % (281452)Termination reason: Instruction limit
% 12.75/2.08 % (281452)Termination phase: Finite model building constraint generation
% 12.75/2.08 % (281452)Time elapsed: 0.170 s
% 12.75/2.08 % (281452)Peak memory usage: 28 MB
% 12.75/2.08 % (281452)Instructions burned: 865 (million)
% 12.75/2.08 % (281456)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=4120851288:i=889:ins=1_2996 on theBenchmark for (2996ds/889Mi)
% 12.75/2.08 % (281445)Instruction limit reached!
% 12.75/2.08 % (281445)------------------------------
% 12.75/2.08 % (281445)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 12.75/2.08 % (281445)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.75/2.08 % (281445)CaDiCaL version: 2.1.3
% 12.75/2.08 % (281445)Termination reason: Instruction limit
% 12.75/2.08 % (281445)Termination phase: Saturation
% 12.75/2.08 % (281445)Time elapsed: 0.335 s
% 12.75/2.08 % (281445)Peak memory usage: 16 MB
% 12.75/2.08 % (281445)Instructions burned: 684 (million)
% 12.75/2.08 % (281458)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=1991346282:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2995 on theBenchmark for (2995ds/692Mi)
% 12.75/2.08 % (281450)Instruction limit reached!
% 12.75/2.08 % (281450)------------------------------
% 12.75/2.08 % (281450)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 12.75/2.08 % (281450)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.75/2.08 % (281450)CaDiCaL version: 2.1.3
% 12.75/2.08 % (281450)Termination reason: Instruction limit
% 12.75/2.08 % (281450)Termination phase: Saturation
% 12.75/2.08 % (281450)Time elapsed: 0.301 s
% 12.75/2.08 % (281450)Peak memory usage: 13 MB
% 12.75/2.08 % (281450)Instructions burned: 479 (million)
% 12.75/2.08 % (281460)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1765774612:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 12.75/2.08 % (281456)Instruction limit reached!
% 12.75/2.08 % (281456)------------------------------
% 12.75/2.08 % (281456)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 12.75/2.08 % (281456)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.75/2.08 % (281456)CaDiCaL version: 2.1.3
% 12.75/2.08 % (281456)Termination reason: Instruction limit
% 12.75/2.08 % (281456)Termination phase: Finite model building constraint generation
% 12.75/2.08 % (281456)Time elapsed: 0.236 s
% 12.75/2.08 % (281456)Peak memory usage: 106 MB
% 12.75/2.08 % (281456)Instructions burned: 894 (million)
% 12.75/2.08 % (281462)fmb+10_1_sil=64000:random_seed=694824296:i=22061:nm=2:gsp=on_2993 on theBenchmark for (2993ds/22061Mi)
% 12.75/2.08 % TRYING [1]
% 12.75/2.08 % TRYING [2]
% 12.75/2.08 % TRYING [3]
% 12.75/2.08 % TRYING [4]
% 12.75/2.08 % TRYING [5]
% 12.75/2.08 % (281458)Instruction limit reached!
% 12.75/2.08 % (281458)------------------------------
% 12.75/2.08 % (281458)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 12.75/2.08 % (281458)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.75/2.08 % (281458)CaDiCaL version: 2.1.3
% 12.75/2.08 % (281458)Termination reason: Instruction limit
% 12.75/2.08 % (281458)Termination phase: Saturation
% 12.75/2.08 % (281458)Time elapsed: 0.390 s
% 12.75/2.08 % (281458)Peak memory usage: 17 MB
% 12.75/2.08 % (281458)Instructions burned: 692 (million)
% 12.75/2.08 % (281464)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=3995123588:i=9515:nm=5_2991 on theBenchmark for (2991ds/9515Mi)
% 12.75/2.08 % TRYING [20]
% 12.75/2.08 % (281454)Instruction limit reached!
% 12.75/2.08 % (281454)------------------------------
% 12.75/2.08 % (281454)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 12.75/2.08 % (281454)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.75/2.08 % (281454)CaDiCaL version: 2.1.3
% 12.75/2.08 % (281454)Termination reason: Instruction limit
% 12.75/2.08 % (281454)Termination phase: Saturation
% 12.75/2.08 % (281454)Time elapsed: 0.674 s
% 12.75/2.08 % (281454)Peak memory usage: 19 MB
% 12.75/2.08 % (281454)Instructions burned: 1179 (million)
% 12.75/2.08 % (281466)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=3811613682:fmbsr=1.7:i=920_2990 on theBenchmark for (2990ds/920Mi)
% 12.75/2.08 % TRYING [8]
% 12.75/2.08 % (281460)Instruction limit reached!
% 12.75/2.08 % (281460)------------------------------
% 12.75/2.08 % (281460)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 12.75/2.08 % (281460)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.75/2.09 % (281460)CaDiCaL version: 2.1.3
% 12.75/2.09 % (281460)Termination reason: Instruction limit
% 12.75/2.09 % (281460)Termination phase: Saturation
% 12.75/2.09 % (281460)Time elapsed: 0.526 s
% 12.75/2.09 % (281460)Peak memory usage: 17 MB
% 12.75/2.09 % (281460)Instructions burned: 879 (million)
% 12.75/2.09 % (281468)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=3853446162:i=5131_2989 on theBenchmark for (2989ds/5131Mi)
% 12.75/2.09 % TRYING [6]
% 12.75/2.09 % (281466)Instruction limit reached!
% 12.75/2.09 % (281466)------------------------------
% 12.75/2.09 % (281466)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 12.75/2.09 % (281466)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.75/2.09 % (281466)CaDiCaL version: 2.1.3
% 12.75/2.09 % (281466)Termination reason: Instruction limit
% 12.75/2.09 % (281466)Termination phase: Finite model building constraint generation
% 12.75/2.09 % (281466)Time elapsed: 0.310 s
% 12.75/2.09 % (281466)Peak memory usage: 65 MB
% 12.75/2.09 % (281466)Instructions burned: 920 (million)
% 12.75/2.09 % (281470)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=3433704042:i=1472:ins=7:fdi=8:gsp=on_2987 on theBenchmark for (2987ds/1472Mi)
% 12.75/2.09 % TRYING [7]
% 12.75/2.09 % (281468) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-281423-281468"...
% 12.75/2.09 % (281468)...printing done.
% 12.75/2.09 % (281468)Refutation found. Thanks to Tanya!
% 12.75/2.09 % SZS status Theorem for theBenchmark
% 12.75/2.09 % SZS output start Proof for theBenchmark
% See solution above
% 12.75/2.09 % (281468)------------------------------
% 12.75/2.09 % (281468)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 12.75/2.09 % (281468)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.75/2.09 % (281468)CaDiCaL version: 2.1.3
% 12.75/2.09 % (281468)Termination reason: Refutation
% 12.75/2.09 % (281468)Time elapsed: 0.749 s
% 12.75/2.09 % (281468)Peak memory usage: 18 MB
% 12.75/2.09 % (281468)Instructions burned: 1480 (million)
% 12.75/2.09 % (281423)Success in time 1.854 s
% 12.75/2.09 % Vampire exiting
%------------------------------------------------------------------------------