%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM836+1 : 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 : n020.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.19s 0.49s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 10 unt; 1 def)
% Number of atoms : 60 ( 25 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 59 ( 31 ~; 20 |; 4 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn 36 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ~ greater(vd203,vd204)
| ~ less(vd203,vd204) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(88), 0), 2)') ).
fof(f22,plain,
! [X0,X1] :
( less(X1,X0)
=> ? [X2] : X0 = vplus(X1,X2) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f23,plain,
( greater(vd203,vd204)
& less(vd203,vd204) ),
inference(ennf_transformation,[],[f2]) ).
fof(f24,plain,
! [X0,X1] :
( ? [X2] : X0 = vplus(X1,X2)
| ~ less(X1,X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f26,plain,
! [X0,X1] :
( ! [X2] : vplus(X1,X2) != X0
| ! [X3] : vplus(X0,X3) != X1 ),
inference(ennf_transformation,[],[f8]) ).
fof(f32,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))],[f24]) ).
fof(f33,plain,
! [X0,X1] :
( ( greater(X1,X0)
| ! [X2] : vplus(X0,X2) != X1 )
& ( ? [X2] : X1 = vplus(X0,X2)
| ~ greater(X1,X0) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f34,plain,
! [X0,X1] :
( ( greater(X1,X0)
| ! [X2] : vplus(X0,X2) != X1 )
& ( ? [X3] : vplus(X0,X3) = X1
| ~ greater(X1,X0) ) ),
inference(rectify,[],[f33]) ).
fof(f35,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))],[f34]) ).
fof(f37,plain,
less(vd203,vd204),
inference(cnf_transformation,[],[f23]) ).
fof(f38,plain,
greater(vd203,vd204),
inference(cnf_transformation,[],[f23]) ).
fof(f40,plain,
! [X0,X1] :
( ~ less(X1,X0)
| vplus(X1,sK0(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f32]) ).
fof(f41,plain,
! [X0,X1] :
( ~ greater(X1,X0)
| vplus(X0,sK1(X0,X1)) = X1 ),
inference(cnf_transformation,[],[f35]) ).
fof(f45,plain,
! [X2,X3,X0,X1] :
( vplus(X1,X2) != X0
| vplus(X0,X3) != X1 ),
inference(cnf_transformation,[],[f26]) ).
fof(f69,definition,
( spl4_1
<=> greater(vd203,vd204) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
fof(f70,plain,
( greater(vd203,vd204)
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f69]) ).
fof(f77,plain,
spl4_1,
inference(avatar_split_clause,[],[f38,f69]) ).
fof(f127,plain,
vd204 = vplus(vd203,sK0(vd204,vd203)),
inference(resolution,[],[f40,f37]) ).
fof(f134,plain,
( vd203 = vplus(vd204,sK1(vd204,vd203))
| ~ spl4_1 ),
inference(resolution,[],[f41,f70]) ).
fof(f143,plain,
! [X0,X1] :
( vd204 != X0
| vd203 != vplus(X0,X1) ),
inference(superposition,[],[f45,f127]) ).
fof(f323,plain,
! [X0] : vd203 != vplus(vd204,X0),
inference(equality_resolution,[],[f143]) ).
fof(f345,plain,
( vd203 != vd203
| ~ spl4_1 ),
inference(superposition,[],[f323,f134]) ).
fof(f349,plain,
( $false
| ~ spl4_1 ),
inference(trivial_inequality_removal,[],[f345]) ).
fof(f350,plain,
~ spl4_1,
inference(avatar_contradiction_clause,[],[f349]) ).
cnf(s2,plain,
spl4_1,
inference(sat_conversion,[],[f77]) ).
cnf(s3,plain,
~ spl4_1,
inference(sat_conversion,[],[f350]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s2,s3]) ).
fof(f353,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM836+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.40 % Computer : n020.cluster.edu
% 0.13/0.40 % Model : x86_64 x86_64
% 0.13/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40 % Memory : 8046.5625MB
% 0.13/0.40 % OS : Linux 6.8.0-71-generic
% 0.13/0.40 % CPULimit : 300
% 0.13/0.40 % WCLimit : 300
% 0.13/0.40 % DateTime : Sun Sep 27 21:29:49 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.44 Running first-order model finding
% 0.13/0.44 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.19/0.49 % (3770812)Will run a generic schedule for satisfiability detection.
% 0.19/0.49 % (3770822)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2211915527:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.49 % (3770818)% WARNING: option uhcvi not known.
% 0.19/0.49 % (3770822) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3770812-3770822"...
% 0.19/0.49 % (3770820)dis+10_1_sil=32000:sp=arity:random_seed=1878413552:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.49 % (3770822)...printing done.
% 0.19/0.49 % (3770822)Refutation found. Thanks to Tanya!
% 0.19/0.49 % SZS status Theorem for theBenchmark
% 0.19/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.49 % (3770822)------------------------------
% 0.19/0.49 % (3770822)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.49 % (3770822)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.49 % (3770822)CaDiCaL version: 2.1.3
% 0.19/0.49 % (3770822)Termination reason: Refutation
% 0.19/0.49 % (3770822)Time elapsed: 0.009 s
% 0.19/0.49 % (3770822)Peak memory usage: 12 MB
% 0.19/0.49 % (3770822)Instructions burned: 14 (million)
% 0.19/0.49 % (3770812)Success in time 0.033 s
% 0.19/0.49 % Vampire exiting
%------------------------------------------------------------------------------