%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN332-1 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n014.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:07:21 PM UTC 2026
% Result : Unsatisfiable 0.09s 0.24s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 3 unt; 0 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 75 ( 32 ~; 43 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 60 ( 60 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
! [X0,X1] :
( f(X0,X1)
| f(X0,z(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).
fof(f2,negated_conjecture,
! [X0,X1] :
( f(X0,X1)
| f(X1,z(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).
fof(f3,negated_conjecture,
! [X0,X1] :
( ~ f(X0,X1)
| ~ f(X1,X0)
| ~ f(X0,z(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).
fof(f4,negated_conjecture,
! [X0,X1] :
( f(X0,z(X0,X1))
| ~ f(z(X0,X1),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).
fof(f5,negated_conjecture,
! [X0,X1] :
( ~ f(X0,z(X0,X1))
| f(z(X0,X1),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).
fof(f7,negated_conjecture,
! [X0,X1] :
( ~ f(X0,z(X0,X1))
| f(X1,z(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause7) ).
fof(f8,negated_conjecture,
! [X0,X1] :
( ~ f(X0,X1)
| f(X1,X0)
| ~ f(z(X1,X0),z(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).
fof(f13,negated_conjecture,
! [X0,X1] :
( f(X0,X1)
| f(X1,X0)
| ~ f(z(X0,X1),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause13) ).
fof(f15,plain,
! [X0,X1] :
( ~ f(X0,z(X0,X1))
| ~ f(X0,X1) ),
inference(consistent_polarity_flipping,[],[f1]) ).
fof(f16,plain,
! [X0,X1] :
( ~ f(X1,z(X1,X0))
| ~ f(X0,X1) ),
inference(consistent_polarity_flipping,[],[f2]) ).
fof(f17,plain,
! [X0,X1] :
( f(X0,z(X0,X1))
| f(X1,X0)
| f(X0,X1) ),
inference(consistent_polarity_flipping,[],[f3]) ).
fof(f18,plain,
! [X0,X1] :
( ~ f(X0,z(X0,X1))
| f(z(X0,X1),X0) ),
inference(consistent_polarity_flipping,[],[f4]) ).
fof(f19,plain,
! [X0,X1] :
( ~ f(z(X0,X1),X0)
| f(X0,z(X0,X1)) ),
inference(consistent_polarity_flipping,[],[f5]) ).
fof(f21,plain,
! [X0,X1] :
( ~ f(X1,z(X0,X1))
| f(X0,z(X0,X1)) ),
inference(consistent_polarity_flipping,[],[f7]) ).
fof(f22,plain,
! [X0,X1] :
( f(z(X1,X0),z(X1,X0))
| ~ f(X1,X0)
| f(X0,X1) ),
inference(consistent_polarity_flipping,[],[f8]) ).
fof(f27,plain,
! [X0,X1] :
( ~ f(X1,X0)
| ~ f(X0,X1)
| f(z(X0,X1),X1) ),
inference(consistent_polarity_flipping,[],[f13]) ).
fof(f30,plain,
! [X0,X1] :
( f(z(X1,X0),X1)
| f(X1,X0)
| f(X0,X1) ),
inference(resolution,[],[f17,f18]) ).
fof(f58,plain,
! [X0,X1] :
( ~ f(X0,X1)
| f(X1,X0)
| ~ f(z(X0,X1),z(X0,X1))
| f(z(z(X0,X1),z(X0,X1)),z(X0,X1)) ),
inference(resolution,[],[f22,f27]) ).
fof(f59,plain,
! [X0,X1] :
( f(z(z(X0,X1),z(X0,X1)),z(X0,X1))
| f(X1,X0)
| ~ f(X0,X1) ),
inference(forward_subsumption_resolution,[],[f58,f22]) ).
fof(f74,plain,
! [X0,X1] :
( f(X0,X1)
| f(X1,X0)
| ~ f(X0,z(X0,X1))
| f(z(X0,z(X0,X1)),z(X0,X1)) ),
inference(resolution,[],[f30,f27]) ).
fof(f77,plain,
! [X0,X1] :
( f(X1,X0)
| ~ f(X0,z(X0,X1))
| f(z(X0,z(X0,X1)),z(X0,X1)) ),
inference(forward_subsumption_resolution,[],[f74,f15]) ).
fof(f78,plain,
! [X0,X1] :
( f(z(X0,z(X0,X1)),z(X0,X1))
| ~ f(X0,z(X0,X1)) ),
inference(forward_subsumption_resolution,[],[f77,f16]) ).
fof(f82,plain,
! [X0,X1] :
( f(z(X1,X0),z(z(X1,X0),z(X1,X0)))
| ~ f(X1,X0)
| f(X0,X1) ),
inference(resolution,[],[f59,f19]) ).
fof(f107,plain,
! [X0,X1] :
( ~ f(X0,X1)
| f(X1,X0)
| ~ f(z(X0,X1),z(X0,X1)) ),
inference(resolution,[],[f82,f15]) ).
fof(f111,plain,
! [X0,X1] :
( ~ f(X0,X1)
| f(X1,X0) ),
inference(forward_subsumption_resolution,[],[f107,f22]) ).
fof(f118,plain,
! [X0,X1] :
( f(z(X0,X1),z(X0,z(X0,X1)))
| ~ f(X0,z(X0,X1)) ),
inference(resolution,[],[f111,f78]) ).
fof(f190,plain,
! [X0,X1] :
( ~ f(X0,z(X0,X1))
| f(X0,z(X0,z(X0,X1))) ),
inference(resolution,[],[f118,f21]) ).
fof(f196,plain,
! [X0,X1] : ~ f(X0,z(X0,X1)),
inference(forward_subsumption_resolution,[],[f190,f15]) ).
fof(f200,plain,
! [X0,X1] :
( f(X1,X0)
| f(X0,X1) ),
inference(backward_subsumption_resolution,[],[f17,f196]) ).
fof(f207,plain,
! [X0,X1] : f(X0,X1),
inference(forward_subsumption_resolution,[],[f200,f111]) ).
fof(f215,plain,
$false,
inference(backward_subsumption_resolution,[],[f196,f207]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN332-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.16 % Computer : n014.cluster.edu
% 0.09/0.16 % Model : x86_64 x86_64
% 0.09/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.16 % Memory : 8046.5625MB
% 0.09/0.16 % OS : Linux 6.8.0-71-generic
% 0.09/0.16 % CPULimit : 300
% 0.09/0.16 % WCLimit : 300
% 0.09/0.16 % DateTime : Mon Sep 28 15:42:30 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.19 Running first-order model finding
% 0.09/0.19 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.24 % (1872313)Will run a generic schedule for satisfiability detection.
% 0.09/0.24 % (1872319)% WARNING: option uhcvi not known.
% 0.09/0.24 % (1872319)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3755407202:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.24 % (1872319) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1872313-1872319"...
% 0.09/0.24 % (1872319)...printing done.
% 0.09/0.24 % (1872319)Refutation found. Thanks to Tanya!
% 0.09/0.24 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.24 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.24 % (1872319)------------------------------
% 0.09/0.24 % (1872319)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.24 % (1872319)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.24 % (1872319)CaDiCaL version: 2.1.3
% 0.09/0.24 % (1872319)Termination reason: Refutation
% 0.09/0.24 % (1872319)Time elapsed: 0.003 s
% 0.09/0.24 % (1872319)Peak memory usage: 11 MB
% 0.09/0.24 % (1872319)Instructions burned: 7 (million)
% 0.09/0.24 % (1872313)Success in time 0.039 s
% 0.09/0.24 % Vampire exiting
%------------------------------------------------------------------------------