%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN986+1.003 : TPTP v9.3.1. Released v4.0.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 02:23:01 PM UTC 2026
% Result : Theorem 0.09s 0.25s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 4 unt; 0 def)
% Number of atoms : 71 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 89 ( 45 ~; 36 |; 6 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Maximal term depth : 16 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 72 ( 64 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : r(X0,zero,succ(X0)),
file('/export/starexec/sandbox/benchmark/Axioms/SYN002+0.ax',hyp1) ).
fof(f2,axiom,
! [X0,X1,X2,X3] :
( r(X0,X1,X2)
=> ( r(X2,X1,X3)
=> r(X0,succ(X1),X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN002+0.ax',hyp2) ).
fof(f3,conjecture,
? [X0,X1,X2,X3] :
( r(zero,zero,X0)
& r(zero,X0,X1)
& r(zero,X1,X2)
& r(zero,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ck) ).
fof(f4,negated_conjecture,
~ ? [X0,X1,X2,X3] :
( r(zero,zero,X0)
& r(zero,X0,X1)
& r(zero,X1,X2)
& r(zero,X2,X3) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
fof(f5,plain,
! [X0,X1,X2,X3] :
( r(X0,succ(X1),X3)
| ~ r(X2,X1,X3)
| ~ r(X0,X1,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f6,plain,
! [X0,X1,X2,X3] :
( r(X0,succ(X1),X3)
| ~ r(X2,X1,X3)
| ~ r(X0,X1,X2) ),
inference(flattening,[],[f5]) ).
fof(f7,plain,
! [X0,X1,X2,X3] :
( ~ r(zero,zero,X0)
| ~ r(zero,X0,X1)
| ~ r(zero,X1,X2)
| ~ r(zero,X2,X3) ),
inference(ennf_transformation,[],[f4]) ).
fof(f8,plain,
! [X0] : r(X0,zero,succ(X0)),
inference(cnf_transformation,[],[f1]) ).
fof(f9,plain,
! [X2,X3,X0,X1] :
( ~ r(X2,X1,X3)
| r(X0,succ(X1),X3)
| ~ r(X0,X1,X2) ),
inference(cnf_transformation,[],[f6]) ).
fof(f10,plain,
! [X2,X3,X0,X1] :
( ~ r(zero,zero,X0)
| ~ r(zero,X0,X1)
| ~ r(zero,X1,X2)
| ~ r(zero,X2,X3) ),
inference(cnf_transformation,[],[f7]) ).
fof(f11,plain,
! [X2,X0,X1] :
( ~ r(zero,succ(zero),X0)
| ~ r(zero,X0,X1)
| ~ r(zero,X1,X2) ),
inference(resolution,[],[f8,f10]) ).
fof(f12,plain,
! [X0,X1] :
( r(X0,succ(zero),succ(X1))
| ~ r(X0,zero,X1) ),
inference(resolution,[],[f9,f8]) ).
fof(f13,plain,
! [X2,X0,X1] :
( ~ r(zero,succ(X0),X1)
| ~ r(zero,zero,X0)
| ~ r(zero,X1,X2) ),
inference(resolution,[],[f12,f11]) ).
fof(f14,plain,
! [X2,X0,X1] :
( ~ r(X2,succ(zero),X0)
| r(X2,succ(succ(zero)),succ(X1))
| ~ r(X0,zero,X1) ),
inference(resolution,[],[f12,f9]) ).
fof(f24,plain,
! [X2,X0,X1] :
( ~ r(succ(X2),zero,X1)
| r(X0,succ(succ(zero)),succ(X1))
| ~ r(X0,zero,X2) ),
inference(resolution,[],[f14,f12]) ).
fof(f25,plain,
! [X0,X1] :
( r(X0,succ(succ(zero)),succ(succ(succ(X1))))
| ~ r(X0,zero,X1) ),
inference(resolution,[],[f24,f8]) ).
fof(f26,plain,
! [X0,X1] :
( ~ r(zero,zero,X0)
| ~ r(zero,zero,succ(zero))
| ~ r(zero,succ(succ(succ(X0))),X1) ),
inference(resolution,[],[f25,f13]) ).
fof(f27,plain,
! [X2,X0,X1] :
( ~ r(X2,succ(succ(zero)),X0)
| r(X2,succ(succ(succ(zero))),succ(succ(succ(X1))))
| ~ r(X0,zero,X1) ),
inference(resolution,[],[f25,f9]) ).
fof(f28,plain,
! [X0,X1] :
( ~ r(zero,succ(succ(succ(X0))),X1)
| ~ r(zero,zero,X0) ),
inference(forward_subsumption_resolution,[],[f26,f8]) ).
fof(f29,plain,
! [X2,X0,X1] :
( ~ r(succ(succ(succ(X2))),zero,X1)
| r(X0,succ(succ(succ(zero))),succ(succ(succ(X1))))
| ~ r(X0,zero,X2) ),
inference(resolution,[],[f27,f25]) ).
fof(f30,plain,
! [X0,X1] :
( r(X0,succ(succ(succ(zero))),succ(succ(succ(succ(succ(succ(succ(X1))))))))
| ~ r(X0,zero,X1) ),
inference(resolution,[],[f29,f8]) ).
fof(f33,plain,
! [X2,X0,X1] :
( ~ r(X2,succ(succ(succ(zero))),X0)
| r(X2,succ(succ(succ(succ(zero)))),succ(succ(succ(succ(succ(succ(succ(X1))))))))
| ~ r(X0,zero,X1) ),
inference(resolution,[],[f30,f9]) ).
fof(f42,plain,
! [X2,X0,X1] :
( ~ r(succ(succ(succ(succ(succ(succ(succ(X2))))))),zero,X1)
| r(X0,succ(succ(succ(succ(zero)))),succ(succ(succ(succ(succ(succ(succ(X1))))))))
| ~ r(X0,zero,X2) ),
inference(resolution,[],[f33,f30]) ).
fof(f43,plain,
! [X0,X1] :
( r(X0,succ(succ(succ(succ(zero)))),succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(X1))))))))))))))))
| ~ r(X0,zero,X1) ),
inference(resolution,[],[f42,f8]) ).
fof(f44,plain,
! [X0] :
( ~ r(zero,zero,X0)
| ~ r(zero,zero,succ(zero)) ),
inference(resolution,[],[f43,f28]) ).
fof(f55,plain,
! [X0] : ~ r(zero,zero,X0),
inference(forward_subsumption_resolution,[],[f44,f8]) ).
fof(f56,plain,
$false,
inference(resolution,[],[f55,f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN986+1.003 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.17 % Computer : n002.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Mon Sep 28 17:22:22 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/0.21 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.09/0.25 % (528313)Will run a generic schedule for satisfiability detection.
% 0.09/0.25 % (528321)dis+10_1_sil=32000:sp=arity:random_seed=85996642:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.25 % (528321) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-528313-528321"...
% 0.09/0.25 % (528321)...printing done.
% 0.09/0.25 % (528319)% WARNING: option uhcvi not known.
% 0.09/0.25 % (528321)Refutation found. Thanks to Tanya!
% 0.09/0.25 % SZS status Theorem for theBenchmark
% 0.09/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.25 % (528321)------------------------------
% 0.09/0.25 % (528321)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.25 % (528321)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.25 % (528321)CaDiCaL version: 2.1.3
% 0.09/0.25 % (528321)Termination reason: Refutation
% 0.09/0.25 % (528321)Time elapsed: 0.001 s
% 0.09/0.25 % (528321)Peak memory usage: 11 MB
% 0.09/0.25 % (528321)Instructions burned: 2 (million)
% 0.09/0.25 % (528313)Success in time 0.031 s
% 0.09/0.25 % Vampire exiting
%------------------------------------------------------------------------------