%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN077-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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:06:42 PM UTC 2026
% Result : Unsatisfiable 0.08s 0.26s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 26 ( 5 unt; 0 def)
% Number of atoms : 71 ( 5 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 88 ( 43 ~; 45 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 36 ( 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ big_f(X0,f(X1))
| X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
fof(f2,axiom,
! [X0,X1] :
( X0 != X1
| big_f(X0,f(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
fof(f3,negated_conjecture,
! [X0,X1] :
( big_f(g(X0,X1),X1)
| ~ big_f(X0,X1)
| ~ big_f(X0,a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
fof(f4,negated_conjecture,
! [X2,X0,X1] :
( ~ big_f(X2,g(X0,X1))
| ~ big_f(X0,X1)
| ~ big_f(X0,a)
| ~ big_f(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
fof(f5,negated_conjecture,
! [X0] :
( big_f(X0,h(X0))
| big_f(X0,a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
fof(f6,negated_conjecture,
! [X0,X1] :
( big_f(i(X1,X0),X0)
| ~ big_f(X0,h(X1))
| big_f(X1,a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
fof(f7,negated_conjecture,
! [X0,X1] :
( big_f(i(X0,X1),h(X0))
| big_f(X0,a)
| ~ big_f(X1,h(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
fof(f8,plain,
! [X1] : big_f(X1,f(X1)),
inference(equality_resolution,[],[f2]) ).
fof(f10,plain,
! [X2,X0,X1] :
( ~ big_f(i(X2,g(X0,X1)),X1)
| ~ big_f(X0,a)
| ~ big_f(X0,X1)
| ~ big_f(g(X0,X1),h(X2))
| big_f(X2,a) ),
inference(resolution,[],[f4,f6]) ).
fof(f12,plain,
! [X0,X1] :
( ~ big_f(X0,f(X1))
| g(X0,f(X1)) = X1
| ~ big_f(X0,a) ),
inference(resolution,[],[f1,f3]) ).
fof(f14,plain,
! [X0] :
( ~ big_f(X0,a)
| g(X0,f(X0)) = X0 ),
inference(resolution,[],[f12,f8]) ).
fof(f22,plain,
! [X0,X1] :
( ~ big_f(X0,a)
| ~ big_f(X0,h(X1))
| ~ big_f(g(X0,h(X1)),h(X1))
| big_f(X1,a)
| big_f(X1,a)
| ~ big_f(g(X0,h(X1)),h(X1)) ),
inference(resolution,[],[f10,f7]) ).
fof(f23,plain,
! [X0,X1] :
( ~ big_f(X0,a)
| ~ big_f(X0,h(X1))
| ~ big_f(g(X0,h(X1)),h(X1))
| big_f(X1,a) ),
inference(duplicate_literal_removal,[],[f22]) ).
fof(f24,plain,
! [X0,X1] :
( ~ big_f(X0,h(X1))
| ~ big_f(X0,a)
| big_f(X1,a) ),
inference(forward_subsumption_resolution,[],[f23,f3]) ).
fof(f27,plain,
! [X0,X1] :
( ~ big_f(i(X0,X1),a)
| big_f(X0,a)
| big_f(X0,a)
| ~ big_f(X1,h(X0)) ),
inference(resolution,[],[f24,f7]) ).
fof(f29,plain,
! [X0,X1] :
( ~ big_f(i(X0,X1),a)
| big_f(X0,a)
| ~ big_f(X1,h(X0)) ),
inference(duplicate_literal_removal,[],[f27]) ).
fof(f32,plain,
! [X0] :
( big_f(X0,a)
| ~ big_f(a,h(X0))
| ~ big_f(a,h(X0))
| big_f(X0,a) ),
inference(resolution,[],[f29,f6]) ).
fof(f33,plain,
! [X0] :
( ~ big_f(a,h(X0))
| big_f(X0,a) ),
inference(duplicate_literal_removal,[],[f32]) ).
fof(f34,plain,
( big_f(a,a)
| big_f(a,a) ),
inference(resolution,[],[f33,f5]) ).
fof(f35,plain,
big_f(a,a),
inference(duplicate_literal_removal,[],[f34]) ).
fof(f36,plain,
a = g(a,f(a)),
inference(resolution,[],[f35,f14]) ).
fof(f45,plain,
! [X0] :
( ~ big_f(X0,a)
| ~ big_f(a,f(a))
| ~ big_f(a,a)
| ~ big_f(X0,f(a)) ),
inference(superposition,[],[f4,f36]) ).
fof(f49,plain,
! [X0] :
( ~ big_f(X0,a)
| ~ big_f(a,a)
| ~ big_f(X0,f(a)) ),
inference(forward_subsumption_resolution,[],[f45,f8]) ).
fof(f51,plain,
! [X0] :
( ~ big_f(X0,f(a))
| ~ big_f(X0,a) ),
inference(forward_subsumption_resolution,[],[f49,f35]) ).
fof(f63,plain,
~ big_f(a,a),
inference(resolution,[],[f51,f8]) ).
fof(f66,plain,
$false,
inference(forward_subsumption_resolution,[],[f63,f35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN077-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.17 % Computer : n008.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Mon Sep 28 15:31:09 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 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.08/0.26 % (2343170)Will run a generic schedule for satisfiability detection.
% 0.08/0.26 % (2343175)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3796254634_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.26 % TRYING [1]
% 0.08/0.26 % TRYING [2]
% 0.08/0.26 % TRYING [3]
% 0.08/0.26 % TRYING [4]
% 0.08/0.26 % TRYING [5]
% 0.08/0.26 % TRYING [6]
% 0.08/0.26 % (2343176)% WARNING: option uhcvi not known.
% 0.08/0.26 % TRYING [7]
% 0.08/0.26 % (2343176)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2116457361:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.26 % (2343179)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3223055654:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.26 % (2343177)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1494933617:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.26 % (2343178)dis+10_1_sil=32000:sp=arity:random_seed=1145596949:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.26 % (2343181)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3982691111:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.26 % (2343180)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=449065734:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.26 % TRYING [8]
% 0.08/0.26 % (2343179) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2343170-2343179"...
% 0.08/0.26 % (2343178) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2343170-2343178"...
% 0.08/0.26 % (2343179)...printing done.
% 0.08/0.26 % (2343178)...printing done.
% 0.08/0.26 % (2343176) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2343170-2343176"...
% 0.08/0.26 % (2343176)...printing done.
% 0.08/0.26 % (2343178)Refutation found. Thanks to Tanya!
% 0.08/0.26 % SZS status Unsatisfiable for theBenchmark
% 0.08/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.26 % (2343178)------------------------------
% 0.08/0.26 % (2343178)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.26 % (2343178)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.26 % (2343178)CaDiCaL version: 2.1.3
% 0.08/0.26 % (2343178)Termination reason: Refutation
% 0.08/0.26 % (2343178)Time elapsed: 0.003 s
% 0.08/0.26 % (2343178)Peak memory usage: 11 MB
% 0.08/0.26 % (2343178)Instructions burned: 3 (million)
% 0.08/0.26 % (2343170)Success in time 0.043 s
% 0.08/0.26 % Vampire exiting
%------------------------------------------------------------------------------