%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN334-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 : n017.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.19s 0.26s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 5 unt; 0 def)
% Number of atoms : 52 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 44 ( 17 ~; 27 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 48 ( 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
! [X0,X1] :
( ~ g(X1,z(X0,X1))
| f(X0,z(X0,X1))
| ~ f(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).
fof(f2,negated_conjecture,
! [X0,X1] :
( ~ f(X0,z(X0,X1))
| ~ f(X0,X1)
| g(X1,z(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).
fof(f3,negated_conjecture,
! [X0,X1] :
( ~ f(z(X0,X1),z(X0,X1))
| g(z(X0,X1),z(X0,X1))
| ~ f(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).
fof(f4,negated_conjecture,
! [X0,X1] :
( f(z(X0,X1),z(X0,X1))
| f(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).
fof(f5,negated_conjecture,
! [X0,X1] :
( ~ g(z(X0,X1),z(X0,X1))
| f(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).
fof(f6,negated_conjecture,
! [X0,X1] :
( g(z(X0,X1),z(X0,X1))
| g(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause6) ).
fof(f7,negated_conjecture,
! [X0,X1] :
( ~ g(z(X0,X1),z(X0,X1))
| ~ g(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause7) ).
fof(f8,plain,
! [X0,X1] :
( g(X0,X1)
| f(X0,X1) ),
inference(resolution,[],[f6,f5]) ).
fof(f10,plain,
! [X0,X1] :
( ~ g(X0,X1)
| f(z(X0,X1),z(X0,X1)) ),
inference(resolution,[],[f8,f7]) ).
fof(f12,plain,
! [X0,X1] :
( ~ f(X0,X1)
| f(X0,z(X0,X1))
| f(X1,z(X0,X1)) ),
inference(resolution,[],[f1,f8]) ).
fof(f15,plain,
! [X0,X1] :
( f(z(X0,X1),z(z(X0,X1),z(X0,X1)))
| f(z(X0,X1),z(z(X0,X1),z(X0,X1)))
| f(X0,X1) ),
inference(resolution,[],[f12,f4]) ).
fof(f16,plain,
! [X0,X1] :
( f(z(X0,X1),z(z(X0,X1),z(X0,X1)))
| f(X0,X1) ),
inference(duplicate_literal_removal,[],[f15]) ).
fof(f18,plain,
! [X0,X1] :
( f(X0,X1)
| ~ f(z(X0,X1),z(X0,X1))
| g(z(X0,X1),z(z(X0,X1),z(X0,X1))) ),
inference(resolution,[],[f16,f2]) ).
fof(f20,plain,
! [X0,X1] :
( g(z(X0,X1),z(z(X0,X1),z(X0,X1)))
| f(X0,X1) ),
inference(forward_subsumption_resolution,[],[f18,f4]) ).
fof(f26,plain,
! [X0,X1] :
( f(z(z(X0,X1),z(z(X0,X1),z(X0,X1))),z(z(X0,X1),z(z(X0,X1),z(X0,X1))))
| f(X0,X1) ),
inference(resolution,[],[f20,f10]) ).
fof(f29,plain,
! [X0,X1] :
( f(X0,X1)
| g(z(z(X0,X1),z(z(X0,X1),z(X0,X1))),z(z(X0,X1),z(z(X0,X1),z(X0,X1))))
| ~ f(z(X0,X1),z(z(X0,X1),z(X0,X1))) ),
inference(resolution,[],[f26,f3]) ).
fof(f33,plain,
! [X0,X1] :
( g(z(z(X0,X1),z(z(X0,X1),z(X0,X1))),z(z(X0,X1),z(z(X0,X1),z(X0,X1))))
| f(X0,X1) ),
inference(forward_subsumption_resolution,[],[f29,f16]) ).
fof(f38,plain,
! [X0,X1] :
( f(X0,X1)
| ~ g(z(X0,X1),z(z(X0,X1),z(X0,X1))) ),
inference(resolution,[],[f33,f7]) ).
fof(f42,plain,
! [X0,X1] : f(X0,X1),
inference(forward_subsumption_resolution,[],[f38,f20]) ).
fof(f47,plain,
! [X0,X1] :
( ~ f(X0,X1)
| g(X1,z(X0,X1)) ),
inference(resolution,[],[f42,f2]) ).
fof(f50,plain,
! [X0,X1] :
( g(z(X0,X1),z(X0,X1))
| ~ f(X0,X1) ),
inference(resolution,[],[f42,f3]) ).
fof(f51,plain,
! [X0,X1] : g(z(X0,X1),z(X0,X1)),
inference(forward_subsumption_resolution,[],[f50,f42]) ).
fof(f52,plain,
! [X0,X1] : g(X1,z(X0,X1)),
inference(forward_subsumption_resolution,[],[f47,f42]) ).
fof(f63,plain,
! [X0,X1] : ~ g(X0,X1),
inference(resolution,[],[f51,f7]) ).
fof(f78,plain,
$false,
inference(resolution,[],[f63,f52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN334-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n017.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 15:40:51 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/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.19/0.26 % (3659528)Will run a generic schedule for satisfiability detection.
% 0.19/0.26 % (3659534)% WARNING: option uhcvi not known.
% 0.19/0.26 % (3659536)dis+10_1_sil=32000:sp=arity:random_seed=3585306801:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.26 % (3659537)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=990374760:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.26 % (3659533)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2744721134_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.26 % (3659534)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4034817360:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.26 % (3659538)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3126733371:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.26 % TRYING [1]
% 0.19/0.26 % (3659536) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3659528-3659536"...
% 0.19/0.26 % (3659538) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3659528-3659538"...
% 0.19/0.26 % TRYING [2]
% 0.19/0.26 % (3659537) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3659528-3659537"...
% 0.19/0.26 % (3659534) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3659528-3659534"...
% 0.19/0.26 % TRYING [3]
% 0.19/0.26 % (3659538)...printing done.
% 0.19/0.26 % (3659536)...printing done.
% 0.19/0.26 % (3659538)Refutation found. Thanks to Tanya!
% 0.19/0.26 % SZS status Unsatisfiable for theBenchmark
% 0.19/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.26 % (3659538)------------------------------
% 0.19/0.26 % (3659538)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.26 % (3659538)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.26 % (3659538)CaDiCaL version: 2.1.3
% 0.19/0.26 % (3659538)Termination reason: Refutation
% 0.19/0.26 % (3659538)Time elapsed: 0.001 s
% 0.19/0.26 % (3659538)Peak memory usage: 11 MB
% 0.19/0.26 % (3659538)Instructions burned: 3 (million)
% 0.19/0.26 % (3659528)Success in time 0.044 s
% 0.19/0.26 % Vampire exiting
%------------------------------------------------------------------------------