%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN353-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 : n001.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:26 PM UTC 2026
% Result : Unsatisfiable 0.09s 0.26s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 42
% Number of leaves : 13
% Syntax : Number of formulae : 64 ( 7 unt; 0 def)
% Number of atoms : 170 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 159 ( 53 ~; 106 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-3 aty)
% Number of variables : 129 ( 129 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
! [X2,X0,X1] :
( ~ f(a,a,z(X0,X1,X2))
| ~ f(X0,X1,X2)
| f(X1,X2,X0)
| f(X2,X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).
fof(f2,negated_conjecture,
! [X2,X0,X1] :
( ~ f(X2,X1,z(X1,X2,X0))
| f(X1,X2,X0)
| ~ f(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).
fof(f3,negated_conjecture,
! [X2,X0,X1] :
( ~ f(X2,X1,z(X1,X2,X0))
| f(X2,X0,X1)
| ~ f(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).
fof(f4,negated_conjecture,
! [X2,X0,X1] :
( f(X2,X1,z(X1,X2,X0))
| f(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).
fof(f5,negated_conjecture,
! [X2,X0,X1] :
( f(X1,X0,z(X0,X1,X2))
| ~ f(X1,X2,X0)
| ~ f(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).
fof(f6,negated_conjecture,
! [X2,X0,X1] :
( ~ f(X2,z(X2,X0,X1),X0)
| f(X2,X0,X1)
| ~ f(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause6) ).
fof(f7,negated_conjecture,
! [X2,X0,X1] :
( ~ f(X2,z(X2,X0,X1),X0)
| f(X1,X2,X0)
| ~ f(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause7) ).
fof(f8,negated_conjecture,
! [X2,X0,X1] :
( f(X2,z(X2,X0,X1),X0)
| f(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).
fof(f10,negated_conjecture,
! [X2,X0,X1] :
( ~ f(z(X1,X2,X0),X2,X1)
| f(X1,X2,X0)
| f(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause10) ).
fof(f11,negated_conjecture,
! [X2,X0,X1] :
( ~ f(z(X2,X0,X1),X0,X2)
| f(X2,X0,X1)
| f(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause11) ).
fof(f12,negated_conjecture,
! [X2,X0,X1] :
( f(z(X1,X2,X0),X2,X1)
| ~ f(X2,X0,X1)
| ~ f(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause12) ).
fof(f13,negated_conjecture,
! [X2,X0,X1] :
( f(z(X0,X1,X2),X1,X0)
| ~ f(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause13) ).
fof(f17,negated_conjecture,
! [X2,X0,X1] :
( ~ f(z(X0,X1,X2),z(X0,X1,X2),z(X0,X1,X2))
| ~ f(X1,X2,X0)
| ~ f(X2,X0,X1)
| ~ f(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause17) ).
fof(f31,plain,
! [X0] :
( ~ f(a,a,X0)
| f(a,X0,a)
| f(X0,a,a)
| f(X0,a,a) ),
inference(resolution,[],[f1,f4]) ).
fof(f32,plain,
! [X0] :
( ~ f(a,a,X0)
| f(a,X0,a)
| f(X0,a,a) ),
inference(duplicate_literal_removal,[],[f31]) ).
fof(f38,plain,
! [X0] :
( f(z(a,a,X0),a,a)
| f(a,z(a,a,X0),a)
| f(X0,a,a) ),
inference(resolution,[],[f32,f4]) ).
fof(f41,plain,
! [X0] :
( f(a,z(a,a,X0),a)
| f(X0,a,a)
| f(a,a,X0)
| f(X0,a,a) ),
inference(resolution,[],[f38,f10]) ).
fof(f42,plain,
! [X0] :
( f(a,z(a,a,X0),a)
| f(X0,a,a)
| f(a,a,X0) ),
inference(duplicate_literal_removal,[],[f41]) ).
fof(f44,plain,
! [X0] :
( f(X0,a,a)
| f(a,a,X0)
| f(a,a,X0)
| ~ f(a,X0,a) ),
inference(resolution,[],[f42,f6]) ).
fof(f45,plain,
! [X0] :
( ~ f(a,X0,a)
| f(a,a,X0)
| f(X0,a,a) ),
inference(duplicate_literal_removal,[],[f44]) ).
fof(f49,plain,
! [X0] :
( f(z(a,a,X0),a,a)
| f(a,a,z(a,a,X0))
| f(a,X0,a) ),
inference(resolution,[],[f45,f8]) ).
fof(f51,plain,
! [X0] :
( f(a,a,z(a,a,X0))
| f(a,X0,a)
| f(a,a,X0)
| f(a,X0,a) ),
inference(resolution,[],[f49,f11]) ).
fof(f53,plain,
! [X0] :
( f(a,a,z(a,a,X0))
| f(a,X0,a)
| f(a,a,X0) ),
inference(duplicate_literal_removal,[],[f51]) ).
fof(f57,plain,
! [X0] :
( f(a,X0,a)
| f(a,a,X0)
| f(a,a,X0)
| ~ f(X0,a,a) ),
inference(resolution,[],[f53,f2]) ).
fof(f58,plain,
! [X0] :
( ~ f(X0,a,a)
| f(a,a,X0)
| f(a,X0,a) ),
inference(duplicate_literal_removal,[],[f57]) ).
fof(f62,plain,
! [X0] :
( f(a,a,z(a,a,X0))
| f(a,z(a,a,X0),a)
| ~ f(a,X0,a)
| ~ f(X0,a,a) ),
inference(resolution,[],[f58,f12]) ).
fof(f68,plain,
! [X0] :
( f(a,a,z(a,a,X0))
| f(a,z(a,a,X0),a)
| ~ f(a,X0,a) ),
inference(forward_subsumption_resolution,[],[f62,f4]) ).
fof(f69,plain,
! [X0] :
( f(a,z(a,a,X0),a)
| f(a,a,z(a,a,X0)) ),
inference(forward_subsumption_resolution,[],[f68,f8]) ).
fof(f70,plain,
! [X0] :
( f(a,a,z(a,a,X0))
| f(a,a,z(a,a,X0))
| f(z(a,a,X0),a,a) ),
inference(resolution,[],[f69,f45]) ).
fof(f72,plain,
! [X0] :
( f(a,a,z(a,a,X0))
| f(a,a,X0)
| ~ f(a,X0,a) ),
inference(resolution,[],[f69,f6]) ).
fof(f73,plain,
! [X0] :
( f(a,a,z(a,a,X0))
| f(z(a,a,X0),a,a) ),
inference(duplicate_literal_removal,[],[f70]) ).
fof(f74,plain,
! [X0] :
( f(a,a,z(a,a,X0))
| ~ f(a,X0,a) ),
inference(forward_subsumption_resolution,[],[f72,f5]) ).
fof(f76,plain,
! [X0] :
( ~ f(a,X0,a)
| f(a,z(a,a,X0),a)
| f(z(a,a,X0),a,a) ),
inference(resolution,[],[f74,f32]) ).
fof(f78,plain,
! [X0] :
( ~ f(a,X0,a)
| f(a,a,X0)
| ~ f(X0,a,a) ),
inference(resolution,[],[f74,f2]) ).
fof(f79,plain,
! [X0] :
( ~ f(X0,a,a)
| f(a,a,X0) ),
inference(forward_subsumption_resolution,[],[f78,f58]) ).
fof(f80,plain,
! [X0] :
( f(a,z(a,a,X0),a)
| f(z(a,a,X0),a,a) ),
inference(forward_subsumption_resolution,[],[f76,f8]) ).
fof(f88,plain,
! [X0] : f(a,a,z(a,a,X0)),
inference(forward_subsumption_resolution,[],[f73,f79]) ).
fof(f91,plain,
! [X0] :
( ~ f(X0,a,a)
| f(a,X0,a) ),
inference(resolution,[],[f88,f3]) ).
fof(f99,plain,
! [X0] : f(a,z(a,a,X0),a),
inference(forward_subsumption_resolution,[],[f80,f91]) ).
fof(f101,plain,
! [X0] :
( ~ f(a,X0,a)
| f(X0,a,a) ),
inference(resolution,[],[f99,f7]) ).
fof(f106,plain,
! [X0] :
( f(z(a,a,X0),a,a)
| f(X0,a,a)
| f(a,a,X0) ),
inference(resolution,[],[f101,f42]) ).
fof(f109,plain,
! [X0] :
( f(X0,a,a)
| f(a,a,X0) ),
inference(forward_subsumption_resolution,[],[f106,f10]) ).
fof(f110,plain,
! [X0] : f(a,a,X0),
inference(forward_subsumption_resolution,[],[f109,f79]) ).
fof(f118,plain,
! [X2,X0,X1] :
( ~ f(X0,X1,X2)
| f(X1,X2,X0)
| f(X2,X0,X1) ),
inference(backward_subsumption_resolution,[],[f1,f110]) ).
fof(f134,plain,
! [X2,X0,X1] :
( f(z(X0,X1,X2),X1,X0)
| f(X1,X0,z(X0,X1,X2))
| f(X1,X2,X0) ),
inference(resolution,[],[f118,f8]) ).
fof(f135,plain,
! [X2,X0,X1] :
( f(X0,X1,z(X1,X0,X2))
| f(X1,z(X1,X0,X2),X0)
| ~ f(X0,X2,X1)
| ~ f(X2,X1,X0) ),
inference(resolution,[],[f118,f12]) ).
fof(f159,plain,
! [X2,X0,X1] :
( f(X0,X1,z(X1,X0,X2))
| f(X1,z(X1,X0,X2),X0)
| ~ f(X0,X2,X1) ),
inference(forward_subsumption_resolution,[],[f135,f4]) ).
fof(f162,plain,
! [X2,X0,X1] :
( f(X0,X1,z(X1,X0,X2))
| f(X1,z(X1,X0,X2),X0) ),
inference(forward_subsumption_resolution,[],[f159,f8]) ).
fof(f179,plain,
! [X2,X0,X1] :
( f(X1,X0,z(X0,X1,X2))
| f(X0,X1,X2)
| ~ f(X1,X2,X0) ),
inference(resolution,[],[f162,f6]) ).
fof(f183,plain,
! [X2,X0,X1] :
( f(X1,X0,z(X0,X1,X2))
| ~ f(X1,X2,X0) ),
inference(forward_subsumption_resolution,[],[f179,f5]) ).
fof(f201,plain,
! [X2,X0,X1] :
( f(X0,X1,z(X1,X0,X2))
| f(X0,X2,X1)
| f(X1,X0,X2)
| f(X0,X2,X1) ),
inference(resolution,[],[f134,f11]) ).
fof(f205,plain,
! [X2,X0,X1] :
( f(X0,X1,z(X1,X0,X2))
| f(X0,X2,X1)
| f(X1,X0,X2) ),
inference(duplicate_literal_removal,[],[f201]) ).
fof(f207,plain,
! [X2,X0,X1] :
( ~ f(X0,X1,X2)
| f(X2,X0,X1)
| ~ f(X1,X2,X0) ),
inference(resolution,[],[f183,f2]) ).
fof(f210,plain,
! [X2,X0,X1] :
( ~ f(X1,X2,X0)
| f(X2,X0,X1) ),
inference(forward_subsumption_resolution,[],[f207,f118]) ).
fof(f232,plain,
! [X2,X0,X1] :
( f(X0,X1,z(X1,X0,X2))
| f(X1,X0,X2) ),
inference(forward_subsumption_resolution,[],[f205,f183]) ).
fof(f281,plain,
! [X2,X0,X1] :
( f(X0,X1,X2)
| f(X0,z(X0,X1,X2),X1)
| f(z(X0,X1,X2),X1,X0) ),
inference(resolution,[],[f232,f118]) ).
fof(f283,plain,
! [X2,X0,X1] :
( f(X0,X1,X2)
| f(z(X0,X1,X2),X1,X0) ),
inference(forward_subsumption_resolution,[],[f281,f210]) ).
fof(f284,plain,
! [X2,X0,X1] : f(z(X0,X1,X2),X1,X0),
inference(forward_subsumption_resolution,[],[f283,f13]) ).
fof(f285,plain,
! [X2,X0,X1] :
( f(X2,X0,X1)
| f(X0,X1,X2) ),
inference(backward_subsumption_resolution,[],[f11,f284]) ).
fof(f289,plain,
! [X2,X0,X1] : f(X0,X1,X2),
inference(forward_subsumption_resolution,[],[f285,f210]) ).
fof(f299,plain,
! [X2,X0,X1] :
( ~ f(z(X0,X1,X2),z(X0,X1,X2),z(X0,X1,X2))
| ~ f(X1,X2,X0)
| ~ f(X2,X0,X1) ),
inference(backward_subsumption_resolution,[],[f17,f289]) ).
fof(f304,plain,
! [X2,X0,X1] :
( ~ f(X1,X2,X0)
| ~ f(X2,X0,X1) ),
inference(forward_subsumption_resolution,[],[f299,f289]) ).
fof(f305,plain,
! [X2,X0,X1] : ~ f(X2,X0,X1),
inference(forward_subsumption_resolution,[],[f304,f289]) ).
fof(f306,plain,
$false,
inference(forward_subsumption_resolution,[],[f305,f289]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN353-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.19 % Computer : n001.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 15:53:34 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 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.26 % (450328)Will run a generic schedule for satisfiability detection.
% 0.09/0.26 % (450334)% WARNING: option uhcvi not known.
% 0.09/0.26 % (450334)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3418542809:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.26 % (450334) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-450328-450334"...
% 0.09/0.26 % (450334)...printing done.
% 0.09/0.26 % (450334)Refutation found. Thanks to Tanya!
% 0.09/0.26 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.26 % (450334)------------------------------
% 0.09/0.26 % (450334)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.26 % (450334)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.26 % (450334)CaDiCaL version: 2.1.3
% 0.09/0.26 % (450334)Termination reason: Refutation
% 0.09/0.26 % (450334)Time elapsed: 0.004 s
% 0.09/0.26 % (450334)Peak memory usage: 11 MB
% 0.09/0.26 % (450334)Instructions burned: 10 (million)
% 0.09/0.26 % (450328)Success in time 0.035 s
% 0.09/0.26 % Vampire exiting
%------------------------------------------------------------------------------