%------------------------------------------------------------------------------
% File : Vampire---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 THM
% Computer : n004.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:09:07 PM UTC 2026
% Result : Theorem 3.59s 1.18s
% Output : Refutation 4.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 11
% Syntax : Number of formulae : 77 ( 12 unt; 0 def)
% Number of atoms : 224 ( 77 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 223 ( 76 ~; 112 |; 21 &)
% ( 1 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-3 aty)
% Number of variables : 152 ( 146 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',totality) ).
fof(f4,axiom,
! [X0,X1] :
( strictly_less_than(X0,X1)
<=> ( less_than(X0,X1)
& ~ less_than(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',stricly_smaller_definition) ).
fof(f24,axiom,
! [X0,X1] : check_cpq(triple(X0,create_slb,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',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/theBenchmark.p',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/theBenchmark.p',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/theBenchmark.p',ax49) ).
fof(f39,axiom,
! [X0,X1,X2,X3] :
( X1 != create_slb
=> findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax51) ).
fof(f40,axiom,
! [X0] : removemin_cpq_eff(X0) = remove_cpq(findmin_cpq_eff(X0),findmin_cpq_res(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax52) ).
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(f48,plain,
! [X0,X1,X2] :
( X1 != create_slb
=> findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0) ),
inference(rectify,[],[f39]) ).
fof(f49,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,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(f51,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(f54,plain,
! [X0,X1] :
( ( less_than(X0,X1)
& ~ less_than(X1,X0) )
=> strictly_less_than(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f55,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(f56,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,[],[f55]) ).
fof(f57,plain,
! [X0,X1,X2] :
( ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2)))
| check_cpq(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f43]) ).
fof(f58,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(f59,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,[],[f58]) ).
fof(f66,plain,
! [X0,X1,X2] :
( findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0)
| create_slb = X1 ),
inference(ennf_transformation,[],[f48]) ).
fof(f69,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,[],[f49]) ).
fof(f70,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,[],[f69]) ).
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))
| ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) ),
inference(ennf_transformation,[],[f50]) ).
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))
| ~ strictly_less_than(findmin_pqp_res(X0),lookup_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)) ),
inference(ennf_transformation,[],[f51]) ).
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(f80,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(ennf_transformation,[],[f54]) ).
fof(f81,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(flattening,[],[f80]) ).
fof(f82,plain,
( ~ check_cpq(triple(sK0,sK1,sK2))
& check_cpq(removemin_cpq_eff(triple(sK0,sK1,sK2)))
& ok(removemin_cpq_eff(triple(sK0,sK1,sK2))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f59]) ).
fof(f86,plain,
! [X2,X3,X0,X1] :
( ~ ok(remove_cpq(triple(X0,X1,X2),X3))
| ~ check_cpq(remove_cpq(triple(X0,X1,X2),X3))
| check_cpq(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f56]) ).
fof(f87,plain,
! [X2,X0,X1] :
( ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2)))
| check_cpq(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f57]) ).
fof(f88,plain,
ok(removemin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f82]) ).
fof(f89,plain,
check_cpq(removemin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f82]) ).
fof(f90,plain,
~ check_cpq(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f82]) ).
fof(f93,plain,
! [X0,X1] : check_cpq(triple(X0,create_slb,X1)),
inference(cnf_transformation,[],[f24]) ).
fof(f98,plain,
! [X0] : removemin_cpq_eff(X0) = remove_cpq(findmin_cpq_eff(X0),findmin_cpq_res(X0)),
inference(cnf_transformation,[],[f40]) ).
fof(f101,plain,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f107,plain,
! [X2,X0,X1] :
( findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2))
| create_slb = X1 ),
inference(cnf_transformation,[],[f66]) ).
fof(f111,plain,
! [X2,X0,X1] :
( 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(cnf_transformation,[],[f70]) ).
fof(f112,plain,
! [X2,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))
| ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) ),
inference(cnf_transformation,[],[f72]) ).
fof(f113,plain,
! [X2,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)) ),
inference(cnf_transformation,[],[f74]) ).
fof(f120,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(cnf_transformation,[],[f81]) ).
fof(f121,plain,
check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),findmin_cpq_res(triple(sK0,sK1,sK2)))),
inference(definition_unfolding,[],[f89,f98]) ).
fof(f122,plain,
ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),findmin_cpq_res(triple(sK0,sK1,sK2)))),
inference(definition_unfolding,[],[f88,f98]) ).
fof(f126,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| less_than(X1,X0) ),
inference(forward_subsumption_resolution,[],[f120,f101]) ).
fof(f130,plain,
( ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),findmin_pqp_res(sK0)))
| create_slb = sK1 ),
inference(superposition,[],[f122,f107]) ).
fof(f131,plain,
( check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),findmin_pqp_res(sK0)))
| create_slb = sK1 ),
inference(superposition,[],[f121,f107]) ).
fof(f187,plain,
! [X2,X3,X0,X1] :
( ~ ok(remove_cpq(findmin_cpq_eff(triple(X0,X1,X2)),X3))
| ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(X0,X1,X2)),X3))
| check_cpq(findmin_cpq_eff(triple(X0,X1,X2)))
| create_slb = X1
| contains_slb(X1,findmin_pqp_res(X0)) ),
inference(superposition,[],[f86,f113]) ).
fof(f201,plain,
! [X2,X3,X0,X1] :
( ~ ok(remove_cpq(findmin_cpq_eff(triple(X0,X1,X2)),X3))
| ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(X0,X1,X2)),X3))
| check_cpq(findmin_cpq_eff(triple(X0,X1,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(superposition,[],[f86,f111]) ).
fof(f230,plain,
! [X2,X0,X1] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| create_slb = X1
| ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) ),
inference(forward_subsumption_resolution,[],[f112,f113]) ).
fof(f251,plain,
! [X2,X3,X0,X1] :
( findmin_cpq_eff(triple(X0,X1,X2)) = findmin_cpq_eff(triple(X0,X1,X3))
| create_slb = X1
| ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
| create_slb = X1
| ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) ),
inference(superposition,[],[f230,f230]) ).
fof(f273,plain,
! [X2,X3,X0,X1] :
( findmin_cpq_eff(triple(X0,X1,X2)) = findmin_cpq_eff(triple(X0,X1,X3))
| create_slb = X1
| ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) ),
inference(duplicate_literal_removal,[],[f251]) ).
fof(f776,plain,
! [X0] :
( check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,X0)),findmin_pqp_res(sK0)))
| create_slb = sK1
| create_slb = sK1
| ~ strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0))) ),
inference(superposition,[],[f131,f273]) ).
fof(f777,plain,
! [X0] :
( ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,X0)),findmin_pqp_res(sK0)))
| create_slb = sK1
| create_slb = sK1
| ~ strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0))) ),
inference(superposition,[],[f130,f273]) ).
fof(f809,plain,
! [X0] :
( ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,X0)),findmin_pqp_res(sK0)))
| create_slb = sK1
| ~ strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0))) ),
inference(duplicate_literal_removal,[],[f777]) ).
fof(f810,plain,
! [X0] :
( check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,X0)),findmin_pqp_res(sK0)))
| create_slb = sK1
| ~ strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0))) ),
inference(duplicate_literal_removal,[],[f776]) ).
fof(f842,plain,
( ok(remove_cpq(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad),findmin_pqp_res(sK0)))
| create_slb = sK1
| ~ strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0)))
| create_slb = sK1
| ~ strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0))) ),
inference(superposition,[],[f809,f230]) ).
fof(f845,plain,
( ok(remove_cpq(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad),findmin_pqp_res(sK0)))
| create_slb = sK1
| ~ strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0))) ),
inference(duplicate_literal_removal,[],[f842]) ).
fof(f868,plain,
( check_cpq(remove_cpq(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad),findmin_pqp_res(sK0)))
| create_slb = sK1
| ~ strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0)))
| create_slb = sK1
| ~ strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0))) ),
inference(superposition,[],[f810,f230]) ).
fof(f871,plain,
( check_cpq(remove_cpq(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad),findmin_pqp_res(sK0)))
| create_slb = sK1
| ~ strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0))) ),
inference(duplicate_literal_removal,[],[f868]) ).
fof(f958,plain,
( create_slb = sK1
| ~ strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0)))
| ~ check_cpq(remove_cpq(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad),findmin_pqp_res(sK0)))
| check_cpq(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad)) ),
inference(resolution,[],[f845,f86]) ).
fof(f1435,plain,
( check_cpq(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad))
| ~ strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0)))
| create_slb = sK1 ),
inference(forward_subsumption_resolution,[],[f958,f871]) ).
fof(f1454,plain,
! [X0] :
( check_cpq(findmin_cpq_eff(triple(sK0,sK1,X0)))
| ~ strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0)))
| create_slb = sK1
| create_slb = sK1
| ~ strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0))) ),
inference(superposition,[],[f1435,f230]) ).
fof(f1459,plain,
! [X0] :
( ~ strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0)))
| check_cpq(findmin_cpq_eff(triple(sK0,sK1,X0)))
| create_slb = sK1 ),
inference(duplicate_literal_removal,[],[f1454]) ).
fof(f1519,plain,
! [X0] :
( less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0))
| create_slb = sK1
| check_cpq(findmin_cpq_eff(triple(sK0,sK1,X0))) ),
inference(resolution,[],[f1459,f126]) ).
fof(f2184,plain,
! [X2,X3,X0,X1] :
( ~ ok(remove_cpq(findmin_cpq_eff(triple(X0,X1,X2)),X3))
| ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(X0,X1,X2)),X3))
| check_cpq(findmin_cpq_eff(triple(X0,X1,X2)))
| create_slb = X1
| ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0)) ),
inference(forward_subsumption_resolution,[],[f201,f187]) ).
fof(f2188,plain,
( ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),findmin_pqp_res(sK0)))
| check_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)))
| create_slb = sK1
| ~ less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0))
| create_slb = sK1 ),
inference(resolution,[],[f2184,f130]) ).
fof(f2219,plain,
( ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),findmin_pqp_res(sK0)))
| check_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)))
| create_slb = sK1
| ~ less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0)) ),
inference(duplicate_literal_removal,[],[f2188]) ).
fof(f2220,plain,
( ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),findmin_pqp_res(sK0)))
| check_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)))
| create_slb = sK1 ),
inference(forward_subsumption_resolution,[],[f2219,f1519]) ).
fof(f2222,plain,
( check_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)))
| create_slb = sK1 ),
inference(forward_subsumption_resolution,[],[f2220,f131]) ).
fof(f2224,plain,
( create_slb = sK1
| check_cpq(triple(sK0,sK1,sK2)) ),
inference(resolution,[],[f2222,f87]) ).
fof(f2233,plain,
create_slb = sK1,
inference(forward_subsumption_resolution,[],[f2224,f90]) ).
fof(f2350,plain,
! [X0,X1] : check_cpq(triple(X0,sK1,X1)),
inference(superposition,[],[f93,f2233]) ).
fof(f2362,plain,
$false,
inference(resolution,[],[f2350,f90]) ).
%------------------------------------------------------------------------------
%----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 THM
% 0.09/0.20 % Computer : n004.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Mon Sep 28 10:50:22 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.24 Running first-order theorem proving
% 0.09/0.24 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.59/1.18 % (279283)Detected formulas, will run a generic FOF schedule.
% 3.59/1.18 % (279289)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=1199997272:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.59/1.18 % (279294)dis-21_1_sil=8000:lcm=predicate:random_seed=683176639:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.59/1.18 % (279291)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1738950103:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.59/1.18 % (279293)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=113073117:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.59/1.18 % (279290)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=496422720:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.59/1.18 % (279288)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1848062267:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.59/1.18 % (279292)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2603054003:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.59/1.18 % (279291)Refutation not found, incomplete strategy
% 3.59/1.18 % (279291)------------------------------
% 3.59/1.18 % (279291)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.59/1.18 % (279291)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.59/1.18 % (279291)CaDiCaL version: 2.1.3
% 3.59/1.18 % (279291)Termination reason: Refutation not found, incomplete strategy
% 3.59/1.18 % (279291)Time elapsed: 0.002 s
% 3.59/1.18 % (279291)Peak memory usage: 88 MB
% 3.59/1.18 % (279291)Instructions burned: 1 (million)
% 3.59/1.18 % (279294)Refutation not found, incomplete strategy
% 3.59/1.18 % (279294)------------------------------
% 3.59/1.18 % (279294)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.59/1.18 % (279294)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.59/1.18 % (279294)CaDiCaL version: 2.1.3
% 3.59/1.18 % (279294)Termination reason: Refutation not found, incomplete strategy
% 3.59/1.18 % (279294)Time elapsed: 0.003 s
% 3.59/1.18 % (279294)Peak memory usage: 88 MB
% 3.59/1.18 % (279294)Instructions burned: 3 (million)
% 3.59/1.18 % (279292)First to succeed.
% 3.59/1.18 % (279292)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-279283"
% 3.59/1.18 % (279293)Instruction limit reached!
% 3.59/1.18 % (279293)------------------------------
% 3.59/1.18 % (279293)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.59/1.18 % (279293)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.59/1.18 % (279293)CaDiCaL version: 2.1.3
% 3.59/1.18 % (279293)Termination reason: Instruction limit
% 3.59/1.18 % (279293)Termination phase: Saturation
% 3.59/1.18 % (279293)Time elapsed: 0.082 s
% 3.59/1.18 % (279293)Peak memory usage: 89 MB
% 3.59/1.18 % (279293)Instructions burned: 140 (million)
% 3.59/1.18 % (279291)------------------------------
% 3.59/1.18 % (279291)------------------------------
% 3.59/1.18 % (279294)------------------------------
% 3.59/1.18 % (279294)------------------------------
% 3.59/1.18 % (279302)lrs+10_1_sil=8000:sp=occurrence:random_seed=2821422777:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.59/1.18 % (279292)Refutation found. Thanks to Tanya!
% 3.59/1.18 % SZS status Theorem for theBenchmark
% 3.59/1.18 % SZS output start Proof for theBenchmark
% See solution above
% 4.02/1.27 % (279292)------------------------------
% 4.02/1.27 % (279292)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.02/1.27 % (279292)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.02/1.27 % (279292)CaDiCaL version: 2.1.3
% 4.02/1.27 % (279292)Termination reason: Refutation
% 4.02/1.27 % (279292)Time elapsed: 0.067 s
% 4.02/1.27 % (279292)Peak memory usage: 89 MB
% 4.02/1.27 % (279292)Instructions burned: 115 (million)
% 4.02/1.27 % (279292)------------------------------
% 4.02/1.27 % (279292)------------------------------
% 4.02/1.27 % (279283)Success in time 0.492 s
% 4.02/1.27 % Vampire exiting
%------------------------------------------------------------------------------