%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM837+2 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n009.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 12:25:51 PM UTC 2026
% Result : Theorem 0.21s 0.50s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 10 unt; 0 def)
% Number of atoms : 28 ( 15 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 24 ( 12 ~; 8 |; 3 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 22 ( 17 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
? [X0] : vd269 = vplus(vd268,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qe(171)') ).
fof(f2,negated_conjecture,
~ ? [X0] : vd269 = vplus(vd268,X0),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f4,axiom,
less(vd268,vd269),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(conjunct1(170), 270, 0)') ).
fof(f15,axiom,
! [X0,X1] :
( less(X1,X0)
<=> ? [X2] : X0 = vplus(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 12), 1)') ).
fof(f24,plain,
! [X0] : vd269 != vplus(vd268,X0),
inference(ennf_transformation,[],[f2]) ).
fof(f37,plain,
! [X0,X1] :
( ( less(X1,X0)
| ! [X2] : vplus(X1,X2) != X0 )
& ( ? [X2] : X0 = vplus(X1,X2)
| ~ less(X1,X0) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f38,plain,
! [X0,X1] :
( ( less(X1,X0)
| ! [X2] : vplus(X1,X2) != X0 )
& ( ? [X3] : vplus(X1,X3) = X0
| ~ less(X1,X0) ) ),
inference(rectify,[],[f37]) ).
fof(f39,plain,
! [X0,X1] :
( ( less(X1,X0)
| ! [X2] : vplus(X1,X2) != X0 )
& ( vplus(X1,sK0(X0,X1)) = X0
| ~ less(X1,X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1))],[f38]) ).
fof(f44,plain,
! [X0] : vd269 != vplus(vd268,X0),
inference(cnf_transformation,[],[f24]) ).
fof(f46,plain,
less(vd268,vd269),
inference(cnf_transformation,[],[f4]) ).
fof(f61,plain,
! [X0,X1] :
( vplus(X1,sK0(X0,X1)) = X0
| ~ less(X1,X0) ),
inference(cnf_transformation,[],[f39]) ).
fof(f84,plain,
~ less(vd268,vd269),
inference(consistent_polarity_flipping,[],[f46]) ).
fof(f96,plain,
! [X0,X1] :
( less(X1,X0)
| vplus(X1,sK0(X0,X1)) = X0 ),
inference(consistent_polarity_flipping,[],[f61]) ).
fof(f153,plain,
vd269 = vplus(vd268,sK0(vd269,vd268)),
inference(resolution,[],[f96,f84]) ).
fof(f174,plain,
vd269 != vd269,
inference(superposition,[],[f44,f153]) ).
fof(f184,plain,
$false,
inference(trivial_inequality_removal,[],[f174]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM837+2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.16/0.42 % Computer : n009.cluster.edu
% 0.16/0.42 % Model : x86_64 x86_64
% 0.16/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42 % Memory : 8046.5625MB
% 0.16/0.42 % OS : Linux 6.8.0-71-generic
% 0.16/0.42 % CPULimit : 300
% 0.16/0.42 % WCLimit : 300
% 0.16/0.42 % DateTime : Sun Sep 27 21:29:00 UTC 2026
% 0.16/0.42 % CPUTime :
% 0.16/0.42 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.16/0.46 Running first-order model finding
% 0.16/0.46 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.21/0.50 % (2413361)Will run a generic schedule for satisfiability detection.
% 0.21/0.50 % (2413372)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3301211129:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.50 % (2413372) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2413361-2413372"...
% 0.21/0.50 % (2413372)...printing done.
% 0.21/0.50 % (2413372)Refutation found. Thanks to Tanya!
% 0.21/0.50 % SZS status Theorem for theBenchmark
% 0.21/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.50 % (2413372)------------------------------
% 0.21/0.50 % (2413372)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.50 % (2413372)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.50 % (2413372)CaDiCaL version: 2.1.3
% 0.21/0.50 % (2413372)Termination reason: Refutation
% 0.21/0.50 % (2413372)Time elapsed: 0.003 s
% 0.21/0.50 % (2413372)Peak memory usage: 12 MB
% 0.21/0.50 % (2413372)Instructions burned: 3 (million)
% 0.21/0.50 % (2413361)Success in time 0.026 s
% 0.21/0.50 % Vampire exiting
%------------------------------------------------------------------------------