%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM845+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 : n005.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:53 PM UTC 2026
% Result : Theorem 0.16s 0.47s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 30 unt; 0 def)
% Number of atoms : 42 ( 41 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 17 ( 11 ~; 0 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 37 ( 36 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0] :
( vmul(vsucc(vd411),X0) = vplus(vmul(vd411,X0),X0)
=> vmul(vsucc(vd411),vsucc(X0)) = vplus(vmul(vd411,vsucc(X0)),vsucc(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(ind(267), imp(267))') ).
fof(f2,negated_conjecture,
~ ! [X0] :
( vmul(vsucc(vd411),X0) = vplus(vmul(vd411,X0),X0)
=> vmul(vsucc(vd411),vsucc(X0)) = vplus(vmul(vd411,vsucc(X0)),vsucc(X0)) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f12,axiom,
! [X0,X1] :
( vmul(X0,vsucc(X1)) = vplus(vmul(X0,X1),X0)
& vmul(X0,v1) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(conseq(axiom(3)), 32), and(holds(definiens(249), 399, 0), holds(definiens(249), 398, 0)))') ).
fof(f13,axiom,
! [X0,X1] : vplus(X1,X0) = vplus(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(61, 0), 0)') ).
fof(f14,axiom,
! [X0] : vplus(v1,X0) = vsucc(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(43, 0), 0)') ).
fof(f15,axiom,
! [X0,X1,X2] : vplus(vplus(X0,X1),X2) = vplus(X0,vplus(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(33, 0), 0)') ).
fof(f16,axiom,
! [X0,X1] :
( vplus(X0,vsucc(X1)) = vsucc(vplus(X0,X1))
& vplus(X0,v1) = vsucc(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))') ).
fof(f17,plain,
? [X0] :
( vmul(vsucc(vd411),vsucc(X0)) != vplus(vmul(vd411,vsucc(X0)),vsucc(X0))
& vmul(vsucc(vd411),X0) = vplus(vmul(vd411,X0),X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f26,plain,
( vmul(vsucc(vd411),vsucc(sK0)) != vplus(vmul(vd411,vsucc(sK0)),vsucc(sK0))
& vmul(vsucc(vd411),sK0) = vplus(vmul(vd411,sK0),sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f17]) ).
fof(f27,plain,
vmul(vsucc(vd411),sK0) = vplus(vmul(vd411,sK0),sK0),
inference(cnf_transformation,[],[f26]) ).
fof(f28,plain,
vmul(vsucc(vd411),vsucc(sK0)) != vplus(vmul(vd411,vsucc(sK0)),vsucc(sK0)),
inference(cnf_transformation,[],[f26]) ).
fof(f39,plain,
! [X0,X1] : vmul(X0,vsucc(X1)) = vplus(vmul(X0,X1),X0),
inference(cnf_transformation,[],[f12]) ).
fof(f40,plain,
! [X0,X1] : vplus(X1,X0) = vplus(X0,X1),
inference(cnf_transformation,[],[f13]) ).
fof(f41,plain,
! [X0] : vsucc(X0) = vplus(v1,X0),
inference(cnf_transformation,[],[f14]) ).
fof(f42,plain,
! [X2,X0,X1] : vplus(vplus(X0,X1),X2) = vplus(X0,vplus(X1,X2)),
inference(cnf_transformation,[],[f15]) ).
fof(f43,plain,
! [X0] : vsucc(X0) = vplus(X0,v1),
inference(cnf_transformation,[],[f16]) ).
fof(f44,plain,
! [X0,X1] : vplus(X0,vsucc(X1)) = vsucc(vplus(X0,X1)),
inference(cnf_transformation,[],[f16]) ).
fof(f45,plain,
vmul(vplus(v1,vd411),vplus(v1,sK0)) != vplus(vmul(vd411,vplus(v1,sK0)),vplus(v1,sK0)),
inference(definition_unfolding,[],[f28,f41,f41,f41,f41]) ).
fof(f46,plain,
vplus(vmul(vd411,sK0),sK0) = vmul(vplus(v1,vd411),sK0),
inference(definition_unfolding,[],[f27,f41]) ).
fof(f56,plain,
! [X0,X1] : vplus(vmul(X0,X1),X0) = vmul(X0,vplus(v1,X1)),
inference(definition_unfolding,[],[f39,f41]) ).
fof(f57,plain,
! [X0,X1] : vplus(X0,vplus(v1,X1)) = vplus(v1,vplus(X0,X1)),
inference(definition_unfolding,[],[f44,f41,f41]) ).
fof(f58,plain,
! [X0] : vplus(v1,X0) = vplus(X0,v1),
inference(definition_unfolding,[],[f43,f41]) ).
fof(f59,plain,
! [X0,X1] : vmul(X0,vplus(v1,X1)) = vplus(X0,vmul(X0,X1)),
inference(forward_demodulation,[],[f56,f40]) ).
fof(f64,plain,
vplus(vmul(vd411,sK0),sK0) = vmul(vplus(vd411,v1),sK0),
inference(forward_demodulation,[],[f46,f58]) ).
fof(f65,plain,
vmul(vplus(v1,vd411),vplus(v1,sK0)) != vplus(v1,vplus(vmul(vd411,vplus(v1,sK0)),sK0)),
inference(forward_demodulation,[],[f45,f57]) ).
fof(f70,plain,
vmul(vplus(vd411,v1),sK0) = vplus(sK0,vmul(vd411,sK0)),
inference(forward_demodulation,[],[f64,f40]) ).
fof(f71,plain,
vmul(vplus(v1,vd411),vplus(v1,sK0)) != vplus(v1,vplus(sK0,vmul(vd411,vplus(v1,sK0)))),
inference(forward_demodulation,[],[f65,f40]) ).
fof(f75,plain,
vmul(vplus(v1,vd411),vplus(v1,sK0)) != vplus(v1,vplus(sK0,vplus(vd411,vmul(vd411,sK0)))),
inference(forward_demodulation,[],[f71,f59]) ).
fof(f79,plain,
vplus(v1,vplus(sK0,vplus(vd411,vmul(vd411,sK0)))) != vmul(vplus(vd411,v1),vplus(v1,sK0)),
inference(forward_demodulation,[],[f75,f58]) ).
fof(f90,plain,
! [X0] : vplus(sK0,vplus(vmul(vd411,sK0),X0)) = vplus(vmul(vplus(vd411,v1),sK0),X0),
inference(superposition,[],[f42,f70]) ).
fof(f106,plain,
! [X0] : vplus(sK0,vplus(vmul(vd411,sK0),X0)) = vplus(X0,vmul(vplus(vd411,v1),sK0)),
inference(superposition,[],[f40,f90]) ).
fof(f158,plain,
! [X0] : vplus(X0,vmul(vplus(vd411,v1),sK0)) = vplus(sK0,vplus(X0,vmul(vd411,sK0))),
inference(superposition,[],[f106,f40]) ).
fof(f192,plain,
! [X2,X0,X1] : vplus(X0,vplus(X1,vmul(vplus(X0,X1),X2))) = vmul(vplus(X0,X1),vplus(v1,X2)),
inference(superposition,[],[f42,f59]) ).
fof(f209,plain,
vmul(vplus(vd411,v1),vplus(v1,sK0)) != vplus(v1,vplus(vd411,vmul(vplus(vd411,v1),sK0))),
inference(superposition,[],[f79,f158]) ).
fof(f213,plain,
vmul(vplus(vd411,v1),vplus(v1,sK0)) != vplus(vd411,vplus(v1,vmul(vplus(vd411,v1),sK0))),
inference(forward_demodulation,[],[f209,f57]) ).
fof(f220,plain,
$false,
inference(forward_subsumption_resolution,[],[f213,f192]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM845+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.12/0.38 % Computer : n005.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 21:30:16 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/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.16/0.47 % (191416)Will run a generic schedule for satisfiability detection.
% 0.16/0.47 % (191424)dis+10_1_sil=32000:sp=arity:random_seed=2770008434:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.47 % (191422)% WARNING: option uhcvi not known.
% 0.16/0.47 % (191425)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3677003097:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.47 % (191421)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=800136584_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.47 % (191423)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1543385707:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.47 % (191422)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=113102230:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.47 % (191427)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=119342376:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.47 % (191426)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=790458815:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.47 % (191422) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-191416-191422"...
% 0.16/0.47 % (191426) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-191416-191426"...
% 0.16/0.47 % TRYING [1]
% 0.16/0.47 % TRYING [2]
% 0.16/0.47 % (191426)...printing done.
% 0.16/0.47 % (191422)...printing done.
% 0.16/0.47 % (191426)Refutation found. Thanks to Tanya!
% 0.16/0.47 % SZS status Theorem for theBenchmark
% 0.16/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.47 % (191426)------------------------------
% 0.16/0.47 % (191426)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.47 % (191426)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.47 % (191426)CaDiCaL version: 2.1.3
% 0.16/0.47 % (191426)Termination reason: Refutation
% 0.16/0.47 % (191426)Time elapsed: 0.007 s
% 0.16/0.47 % (191426)Peak memory usage: 11 MB
% 0.16/0.47 % (191426)Instructions burned: 11 (million)
% 0.16/0.47 % (191416)Success in time 0.047 s
% 0.16/0.47 % Vampire exiting
%------------------------------------------------------------------------------