%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN080+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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:06:42 PM UTC 2026
% Result : Theorem 0.08s 0.24s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 8 unt; 0 def)
% Number of atoms : 8 ( 7 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 11 ( 9 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : f(X0) = g(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel58_1) ).
fof(f2,conjecture,
! [X0,X1] : f(f(X0)) = f(g(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel58) ).
fof(f3,negated_conjecture,
~ ! [X0,X1] : f(f(X0)) = f(g(X1)),
inference(negated_conjecture,[status(cth)],[f2]) ).
fof(f4,plain,
? [X0,X1] : f(f(X0)) != f(g(X1)),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
! [X0,X1] : f(X0) = g(X1),
inference(cnf_transformation,[],[f1]) ).
fof(f6,plain,
f(f(sK0)) != f(g(sK1)),
inference(cnf_transformation,[],[f4]) ).
fof(f9,plain,
! [X0] : f(f(sK0)) != g(X0),
inference(superposition,[],[f6,f5]) ).
fof(f11,plain,
$false,
inference(forward_subsumption_resolution,[],[f9,f5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN080+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.16 % Computer : n002.cluster.edu
% 0.08/0.16 % Model : x86_64 x86_64
% 0.08/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.16 % Memory : 8046.5625MB
% 0.08/0.16 % OS : Linux 6.8.0-71-generic
% 0.08/0.16 % CPULimit : 300
% 0.08/0.16 % WCLimit : 300
% 0.08/0.16 % DateTime : Mon Sep 28 15:35:22 UTC 2026
% 0.08/0.16 % CPUTime :
% 0.08/0.16 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 Running first-order model finding
% 0.08/0.20 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.24 % (453841)Will run a generic schedule for satisfiability detection.
% 0.08/0.24 % (453850)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2442164534:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.24 % (453850) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-453841-453850"...
% 0.08/0.24 % (453850)...printing done.
% 0.08/0.24 % (453850)Refutation found. Thanks to Tanya!
% 0.08/0.24 % SZS status Theorem for theBenchmark
% 0.08/0.24 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.24 % (453850)------------------------------
% 0.08/0.24 % (453850)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.24 % (453850)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.24 % (453850)CaDiCaL version: 2.1.3
% 0.08/0.24 % (453850)Termination reason: Refutation
% 0.08/0.24 % (453850)Time elapsed: 0.001 s
% 0.08/0.24 % (453850)Peak memory usage: 11 MB
% 0.08/0.24 % (453841)Success in time 0.031 s
% 0.08/0.24 % Vampire exiting
%------------------------------------------------------------------------------