%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV142+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n012.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:20:19 PM UTC 2026
% Result : Theorem 0.08s 0.17s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 58 ( 22 unt; 3 def)
% Number of atoms : 205 ( 14 equ)
% Maximal formula atoms : 27 ( 3 avg)
% Number of connectives : 208 ( 61 ~; 57 |; 57 &)
% ( 4 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(f5,axiom,
! [X0,X1,X2] :
( ( leq(X0,X1)
& leq(X1,X2) )
=> leq(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).
fof(f8,axiom,
! [X0,X1] :
( gt(X1,X0)
=> leq(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).
fof(f9,axiom,
! [X0,X1] :
( ( leq(X0,X1)
& X0 != X1 )
=> gt(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt2) ).
fof(f13,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> gt(succ(X1),X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_succ_gt_equiv) ).
fof(f29,axiom,
! [X0] : plus(X0,n1) = succ(X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_1_r) ).
fof(f53,conjecture,
( ( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) )
=> leq(s_best7,n3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_array_0012) ).
fof(f54,negated_conjecture,
~ ( ( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) )
=> leq(s_best7,n3) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f64,axiom,
gt(n1,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_1_0) ).
fof(f84,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_1) ).
fof(f98,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(ennf_transformation,[],[f5]) ).
fof(f99,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(flattening,[],[f98]) ).
fof(f100,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ gt(X1,X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f101,plain,
! [X0,X1] :
( gt(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f9]) ).
fof(f102,plain,
! [X0,X1] :
( gt(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(flattening,[],[f101]) ).
fof(f136,plain,
( ~ leq(s_best7,n3)
& leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( leq(n0,s_best7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_sworst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_worst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_best7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_sworst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_worst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_best7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_sworst7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_worst7)
| ~ gt(loopcounter,n0) )
& ( leq(s_best7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_sworst7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_worst7,n3)
| ~ gt(loopcounter,n0) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f137,plain,
( ~ leq(s_best7,n3)
& leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( leq(n0,s_best7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_sworst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_worst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_best7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_sworst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_worst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_best7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_sworst7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_worst7)
| ~ gt(loopcounter,n0) )
& ( leq(s_best7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_sworst7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_worst7,n3)
| ~ gt(loopcounter,n0) ) ),
inference(flattening,[],[f136]) ).
fof(f158,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ~ gt(succ(X1),X0) )
& ( gt(succ(X1),X0)
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f192,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f194,plain,
! [X2,X0,X1] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f99]) ).
fof(f195,plain,
! [X0,X1] :
( ~ gt(X1,X0)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f100]) ).
fof(f196,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| gt(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f102]) ).
fof(f201,plain,
! [X0,X1] :
( gt(succ(X1),X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f158]) ).
fof(f270,plain,
! [X0] : succ(X0) = plus(X0,n1),
inference(cnf_transformation,[],[f29]) ).
fof(f302,plain,
( leq(s_best7,n3)
| ~ gt(loopcounter,n0) ),
inference(cnf_transformation,[],[f137]) ).
fof(f312,plain,
leq(n1,loopcounter),
inference(cnf_transformation,[],[f137]) ).
fof(f314,plain,
~ leq(s_best7,n3),
inference(cnf_transformation,[],[f137]) ).
fof(f324,plain,
gt(n1,n0),
inference(cnf_transformation,[],[f64]) ).
fof(f344,plain,
n1 = succ(n0),
inference(cnf_transformation,[],[f84]) ).
fof(f352,plain,
! [X0,X1] :
( gt(plus(X1,n1),X0)
| ~ leq(X0,X1) ),
inference(definition_unfolding,[],[f201,f270]) ).
fof(f370,plain,
n1 = plus(n0,n1),
inference(definition_unfolding,[],[f344,f270]) ).
fof(f377,definition,
( spl31_1
<=> gt(loopcounter,n0) ),
introduced(definition,[new_symbols(definition,[spl31_1])],[avatar_definition]) ).
fof(f379,plain,
( ~ gt(loopcounter,n0)
| spl31_1 ),
inference(avatar_component_clause,[],[f377]) ).
fof(f391,definition,
( spl31_4
<=> leq(s_best7,n3) ),
introduced(definition,[new_symbols(definition,[spl31_4])],[avatar_definition]) ).
fof(f394,plain,
( ~ spl31_1
| spl31_4 ),
inference(avatar_split_clause,[],[f302,f391,f377]) ).
fof(f421,plain,
~ spl31_4,
inference(avatar_split_clause,[],[f314,f391]) ).
fof(f426,plain,
leq(n0,n1),
inference(resolution,[],[f195,f324]) ).
fof(f536,plain,
! [X0] : ~ leq(plus(X0,n1),X0),
inference(resolution,[],[f352,f192]) ).
fof(f545,plain,
~ leq(n1,n0),
inference(superposition,[],[f536,f370]) ).
fof(f569,definition,
( spl31_9
<=> n0 = loopcounter ),
introduced(definition,[new_symbols(definition,[spl31_9])],[avatar_definition]) ).
fof(f570,plain,
( n0 != loopcounter
| spl31_9 ),
inference(avatar_component_clause,[],[f569]) ).
fof(f571,plain,
( n0 = loopcounter
| ~ spl31_9 ),
inference(avatar_component_clause,[],[f569]) ).
fof(f579,plain,
( leq(n1,n0)
| ~ spl31_9 ),
inference(superposition,[],[f312,f571]) ).
fof(f580,plain,
( $false
| ~ spl31_9 ),
inference(forward_subsumption_resolution,[],[f579,f545]) ).
fof(f581,plain,
~ spl31_9,
inference(avatar_contradiction_clause,[],[f580]) ).
fof(f639,plain,
! [X0] :
( ~ leq(X0,n1)
| leq(X0,loopcounter) ),
inference(resolution,[],[f194,f312]) ).
fof(f826,plain,
leq(n0,loopcounter),
inference(resolution,[],[f639,f426]) ).
fof(f842,plain,
( gt(loopcounter,n0)
| n0 = loopcounter ),
inference(resolution,[],[f826,f196]) ).
fof(f844,plain,
( n0 = loopcounter
| spl31_1 ),
inference(forward_subsumption_resolution,[],[f842,f379]) ).
fof(f846,plain,
( $false
| spl31_1
| spl31_9 ),
inference(forward_subsumption_resolution,[],[f844,f570]) ).
fof(f847,plain,
( spl31_1
| spl31_9 ),
inference(avatar_contradiction_clause,[],[f846]) ).
cnf(s3,plain,
( ~ spl31_1
| spl31_4 ),
inference(sat_conversion,[],[f394]) ).
cnf(s14,plain,
~ spl31_4,
inference(sat_conversion,[],[f421]) ).
cnf(s17,plain,
~ spl31_9,
inference(sat_conversion,[],[f581]) ).
cnf(s25,plain,
( spl31_1
| spl31_9 ),
inference(sat_conversion,[],[f847]) ).
cnf(s28,plain,
spl31_1,
inference(rat,[],[s25,s17]) ).
cnf(s32,plain,
$false,
inference(rat,[],[s3,s14,s28]) ).
fof(f850,plain,
$false,
inference(avatar_sat_refutation,[],[s32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWV142+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.00/0.10 % Computer : n012.cluster.edu
% 0.00/0.10 % Model : x86_64 x86_64
% 0.00/0.10 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10 % Memory : 8046.5625MB
% 0.00/0.10 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Mon Sep 28 09:59:49 UTC 2026
% 0.00/0.11 % CPUTime :
% 0.00/0.11 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.12 Running first-order model finding
% 0.08/0.12 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.17 % (3276287)Will run a generic schedule for satisfiability detection.
% 0.08/0.17 % (3276293)% WARNING: option uhcvi not known.
% 0.08/0.17 % (3276293)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2807305997:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.17 % (3276295)dis+10_1_sil=32000:sp=arity:random_seed=2768768742:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.17 % (3276296)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2693636048:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.17 % (3276297)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4280703909:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.17 % (3276294)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2654052083:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.17 % (3276292)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4159487482_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.17 % (3276298)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2835513388:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.17 % (3276295) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3276287-3276295"...
% 0.08/0.17 % (3276296) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3276287-3276296"...
% 0.08/0.17 % (3276296)...printing done.
% 0.08/0.17 % (3276295)...printing done.
% 0.08/0.17 % (3276295)Refutation found. Thanks to Tanya!
% 0.08/0.17 % SZS status Theorem for theBenchmark
% 0.08/0.17 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.17 % (3276295)------------------------------
% 0.08/0.17 % (3276295)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.17 % (3276295)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.17 % (3276295)CaDiCaL version: 2.1.3
% 0.08/0.17 % (3276295)Termination reason: Refutation
% 0.08/0.17 % (3276295)Time elapsed: 0.008 s
% 0.08/0.17 % (3276295)Peak memory usage: 12 MB
% 0.08/0.17 % (3276295)Instructions burned: 23 (million)
% 0.08/0.17 % (3276287)Success in time 0.039 s
% 0.08/0.17 % Vampire exiting
%------------------------------------------------------------------------------