%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM427+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n007.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:24:16 PM UTC 2026
% Result : Theorem 0.10s 0.45s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 5 unt; 0 def)
% Number of atoms : 31 ( 10 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 30 ( 14 ~; 10 |; 5 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 9 ( 7 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( aInteger0(X0)
=> aInteger0(smndt0(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntNeg) ).
fof(f23,axiom,
( aInteger0(xn)
& sdtasdt0(xq,xn) = sdtpldt0(xa,smndt0(xb)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__747) ).
fof(f24,axiom,
sdtasdt0(xq,smndt0(xn)) = sdtpldt0(xb,smndt0(xa)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__767) ).
fof(f25,conjecture,
( ? [X0] :
( aInteger0(X0)
& sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xa)) )
| aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))
| sdteqdtlpzmzozddtrp0(xb,xa,xq) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f26,negated_conjecture,
~ ( ? [X0] :
( aInteger0(X0)
& sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xa)) )
| aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))
| sdteqdtlpzmzozddtrp0(xb,xa,xq) ),
inference(negated_conjecture,[status(cth)],[f25]) ).
fof(f28,plain,
! [X0] :
( aInteger0(smndt0(X0))
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f55,plain,
( ! [X0] :
( ~ aInteger0(X0)
| sdtasdt0(xq,X0) != sdtpldt0(xb,smndt0(xa)) )
& ~ aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))
& ~ sdteqdtlpzmzozddtrp0(xb,xa,xq) ),
inference(ennf_transformation,[],[f26]) ).
fof(f58,plain,
! [X0] :
( aInteger0(smndt0(X0))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f95,plain,
aInteger0(xn),
inference(cnf_transformation,[],[f23]) ).
fof(f96,plain,
sdtasdt0(xq,smndt0(xn)) = sdtpldt0(xb,smndt0(xa)),
inference(cnf_transformation,[],[f24]) ).
fof(f97,plain,
! [X0] :
( ~ aInteger0(X0)
| sdtasdt0(xq,X0) != sdtpldt0(xb,smndt0(xa)) ),
inference(cnf_transformation,[],[f55]) ).
fof(f119,plain,
! [X0] :
( ~ aInteger0(X0)
| sdtpldt0(xb,smndt0(xa)) != sdtasdt0(xq,smndt0(X0)) ),
inference(resolution,[],[f58,f97]) ).
fof(f120,plain,
! [X0] :
( ~ aInteger0(X0)
| sdtasdt0(xq,smndt0(xn)) != sdtasdt0(xq,smndt0(X0)) ),
inference(forward_demodulation,[],[f119,f96]) ).
fof(f127,plain,
sdtasdt0(xq,smndt0(xn)) != sdtasdt0(xq,smndt0(xn)),
inference(resolution,[],[f120,f95]) ).
fof(f129,plain,
$false,
inference(trivial_inequality_removal,[],[f127]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM427+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39 % Computer : n007.cluster.edu
% 0.10/0.39 % Model : x86_64 x86_64
% 0.10/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39 % Memory : 8046.5625MB
% 0.10/0.39 % OS : Linux 6.8.0-71-generic
% 0.10/0.39 % CPULimit : 300
% 0.10/0.39 % WCLimit : 300
% 0.10/0.39 % DateTime : Sun Sep 27 19:49:55 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42 Running first-order model finding
% 0.10/0.42 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.10/0.45 % (1738711)Will run a generic schedule for satisfiability detection.
% 0.10/0.45 % (1738721)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=507449328:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.45 % (1738721) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1738711-1738721"...
% 0.10/0.45 % (1738721)...printing done.
% 0.10/0.45 % (1738721)Refutation found. Thanks to Tanya!
% 0.10/0.45 % SZS status Theorem for theBenchmark
% 0.10/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.45 % (1738721)------------------------------
% 0.10/0.45 % (1738721)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.45 % (1738721)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.45 % (1738721)CaDiCaL version: 2.1.3
% 0.10/0.45 % (1738721)Termination reason: Refutation
% 0.10/0.45 % (1738721)Time elapsed: 0.002 s
% 0.10/0.45 % (1738721)Peak memory usage: 12 MB
% 0.10/0.45 % (1738721)Instructions burned: 4 (million)
% 0.10/0.46 % (1738711)Success in time 0.022 s
% 0.10/0.46 % Vampire exiting
%------------------------------------------------------------------------------