%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM836+2 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n002.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.11s 0.45s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 7 unt; 0 def)
% Number of atoms : 45 ( 23 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 45 ( 23 ~; 15 |; 4 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 45 ( 37 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ~ greater(vd203,vd204)
| ~ less(vd203,vd204) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','dis(ex(cond(conseq(131), 0), 1))') ).
fof(f2,negated_conjecture,
~ ( ~ greater(vd203,vd204)
| ~ less(vd203,vd204) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f4,axiom,
! [X0,X1] :
( less(X1,X0)
<=> ? [X2] : X0 = vplus(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 12), 1)') ).
fof(f5,axiom,
! [X0,X1] :
( greater(X1,X0)
<=> ? [X2] : X1 = vplus(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 11), 1)') ).
fof(f8,axiom,
! [X0,X1] :
( ~ ? [X2] : X0 = vplus(X1,X2)
| ~ ? [X3] : X1 = vplus(X0,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(88), 0), 2)') ).
fof(f13,plain,
! [X0,X1] :
( less(X1,X0)
=> ? [X2] : X0 = vplus(X1,X2) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f14,plain,
( greater(vd203,vd204)
& less(vd203,vd204) ),
inference(ennf_transformation,[],[f2]) ).
fof(f15,plain,
! [X0,X1] :
( ? [X2] : X0 = vplus(X1,X2)
| ~ less(X1,X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f17,plain,
! [X0,X1] :
( ! [X2] : vplus(X1,X2) != X0
| ! [X3] : vplus(X0,X3) != X1 ),
inference(ennf_transformation,[],[f8]) ).
fof(f20,plain,
! [X0,X1] :
( vplus(X1,sK0(X0,X1)) = X0
| ~ less(X1,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f15]) ).
fof(f21,plain,
! [X0,X1] :
( ( greater(X1,X0)
| ! [X2] : vplus(X0,X2) != X1 )
& ( ? [X2] : X1 = vplus(X0,X2)
| ~ greater(X1,X0) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f22,plain,
! [X0,X1] :
( ( greater(X1,X0)
| ! [X2] : vplus(X0,X2) != X1 )
& ( ? [X3] : vplus(X0,X3) = X1
| ~ greater(X1,X0) ) ),
inference(rectify,[],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( ( greater(X1,X0)
| ! [X2] : vplus(X0,X2) != X1 )
& ( vplus(X0,sK1(X0,X1)) = X1
| ~ greater(X1,X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1))],[f22]) ).
fof(f25,plain,
less(vd203,vd204),
inference(cnf_transformation,[],[f14]) ).
fof(f26,plain,
greater(vd203,vd204),
inference(cnf_transformation,[],[f14]) ).
fof(f28,plain,
! [X0,X1] :
( ~ less(X1,X0)
| vplus(X1,sK0(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f20]) ).
fof(f29,plain,
! [X0,X1] :
( ~ greater(X1,X0)
| vplus(X0,sK1(X0,X1)) = X1 ),
inference(cnf_transformation,[],[f23]) ).
fof(f33,plain,
! [X2,X3,X0,X1] :
( vplus(X1,X2) != X0
| vplus(X0,X3) != X1 ),
inference(cnf_transformation,[],[f17]) ).
fof(f42,plain,
! [X2,X3,X1] : vplus(vplus(X1,X2),X3) != X1,
inference(equality_resolution,[],[f33]) ).
fof(f51,plain,
vd204 = vplus(vd203,sK0(vd204,vd203)),
inference(resolution,[],[f28,f25]) ).
fof(f55,plain,
! [X0] : vd203 != vplus(vd204,X0),
inference(superposition,[],[f42,f51]) ).
fof(f70,plain,
vd203 = vplus(vd204,sK1(vd204,vd203)),
inference(resolution,[],[f29,f26]) ).
fof(f73,plain,
$false,
inference(forward_subsumption_resolution,[],[f70,f55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM836+2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n002.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 21:31:37 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 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.11/0.45 % (3905581)Will run a generic schedule for satisfiability detection.
% 0.11/0.45 % (3905588)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2008110816:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.45 % (3905588) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3905581-3905588"...
% 0.11/0.45 % (3905588)...printing done.
% 0.11/0.45 % (3905588)Refutation found. Thanks to Tanya!
% 0.11/0.45 % SZS status Theorem for theBenchmark
% 0.11/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45 % (3905588)------------------------------
% 0.11/0.45 % (3905588)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45 % (3905588)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45 % (3905588)CaDiCaL version: 2.1.3
% 0.11/0.45 % (3905588)Termination reason: Refutation
% 0.11/0.45 % (3905588)Time elapsed: 0.001 s
% 0.11/0.45 % (3905588)Peak memory usage: 11 MB
% 0.11/0.45 % (3905588)Instructions burned: 2 (million)
% 0.11/0.45 % (3905581)Success in time 0.028 s
% 0.28/0.45 % Vampire exiting
%------------------------------------------------------------------------------