%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN075+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 : n015.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:41 PM UTC 2026
% Result : Theorem 0.21s 0.28s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% Syntax : Number of formulae : 44 ( 9 unt; 1 def)
% Number of atoms : 103 ( 66 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 104 ( 45 ~; 50 |; 1 &)
% ( 7 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 65 ( 0 sgn 57 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0,X1] :
! [X2,X3] :
( big_f(X2,X3)
<=> ( X2 = X0
& X3 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel52_1) ).
fof(f2,conjecture,
? [X0] :
! [X1] :
( ? [X2] :
! [X3] :
( big_f(X3,X1)
<=> X3 = X2 )
<=> X1 = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel52) ).
fof(f3,negated_conjecture,
~ ? [X0] :
! [X1] :
( ? [X2] :
! [X3] :
( big_f(X3,X1)
<=> X3 = X2 )
<=> X1 = X0 ),
inference(negated_conjecture,[status(cth)],[f2]) ).
fof(f4,plain,
! [X0] :
? [X1] :
( ? [X2] :
! [X3] :
( big_f(X3,X1)
<=> X3 = X2 )
<~> X1 = X0 ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
! [X2,X3] :
( ~ big_f(X2,X3)
| sK1 = X3 ),
inference(cnf_transformation,[],[f1]) ).
fof(f6,plain,
! [X2,X3] :
( ~ big_f(X2,X3)
| sK0 = X2 ),
inference(cnf_transformation,[],[f1]) ).
fof(f7,plain,
! [X2,X3] :
( sK1 != X3
| sK0 != X2
| big_f(X2,X3) ),
inference(cnf_transformation,[],[f1]) ).
fof(f8,plain,
! [X2,X0] :
( big_f(sK4(X0,X2),sK2(X0))
| sK4(X0,X2) = X2
| sK2(X0) != X0 ),
inference(cnf_transformation,[],[f4]) ).
fof(f9,plain,
! [X2,X0] :
( ~ big_f(sK4(X0,X2),sK2(X0))
| sK4(X0,X2) != X2
| sK2(X0) != X0 ),
inference(cnf_transformation,[],[f4]) ).
fof(f10,plain,
! [X3,X0] :
( sK2(X0) = X0
| sK3(X0) != X3
| big_f(X3,sK2(X0)) ),
inference(cnf_transformation,[],[f4]) ).
fof(f12,plain,
! [X2] :
( sK0 != X2
| big_f(X2,sK1) ),
inference(equality_resolution,[],[f7]) ).
fof(f13,plain,
big_f(sK0,sK1),
inference(equality_resolution,[],[f12]) ).
fof(f14,plain,
! [X0] :
( big_f(sK3(X0),sK2(X0))
| sK2(X0) = X0 ),
inference(equality_resolution,[],[f10]) ).
fof(f20,plain,
! [X0] :
( sK1 = sK2(X0)
| sK2(X0) = X0 ),
inference(resolution,[],[f5,f14]) ).
fof(f29,plain,
! [X0] :
( sK2(X0) = X0
| sK1 != X0 ),
inference(equality_factoring,[],[f20]) ).
fof(f35,plain,
! [X0] :
( sK0 = sK3(X0)
| sK2(X0) = X0 ),
inference(resolution,[],[f6,f14]) ).
fof(f36,plain,
! [X0,X1] :
( sK0 = sK4(X0,X1)
| sK4(X0,X1) = X1
| sK2(X0) != X0 ),
inference(resolution,[],[f6,f8]) ).
fof(f40,plain,
! [X0,X1] :
( ~ big_f(sK4(X0,X1),X0)
| sK4(X0,X1) != X1
| X0 != X0
| sK1 != X0 ),
inference(superposition,[],[f9,f29]) ).
fof(f41,plain,
! [X0,X1] :
( ~ big_f(sK4(X0,X1),X0)
| sK4(X0,X1) != X1
| sK1 != X0 ),
inference(trivial_inequality_removal,[],[f40]) ).
fof(f43,plain,
! [X0,X1] :
( ~ big_f(sK4(X0,X1),X0)
| sK4(X0,X1) != X1 ),
inference(forward_subsumption_resolution,[],[f41,f5]) ).
fof(f44,plain,
! [X0] :
( big_f(sK0,sK2(X0))
| sK2(X0) = X0
| sK2(X0) = X0 ),
inference(superposition,[],[f14,f35]) ).
fof(f45,plain,
! [X0] :
( big_f(sK0,sK2(X0))
| sK2(X0) = X0 ),
inference(duplicate_literal_removal,[],[f44]) ).
fof(f66,plain,
! [X0,X1] :
( big_f(sK0,sK2(X0))
| sK0 = X1
| sK2(X0) != X0
| sK4(X0,X1) = X1
| sK2(X0) != X0 ),
inference(superposition,[],[f8,f36]) ).
fof(f68,plain,
! [X0,X1] :
( sK4(X0,X1) = X1
| sK0 != X1
| sK2(X0) != X0 ),
inference(equality_factoring,[],[f36]) ).
fof(f72,plain,
! [X0,X1] :
( big_f(sK0,sK2(X0))
| sK0 = X1
| sK2(X0) != X0
| sK4(X0,X1) = X1 ),
inference(duplicate_literal_removal,[],[f66]) ).
fof(f75,plain,
! [X0,X1] :
( big_f(sK0,sK2(X0))
| sK2(X0) != X0
| sK4(X0,X1) = X1 ),
inference(forward_subsumption_resolution,[],[f72,f68]) ).
fof(f76,plain,
! [X0,X1] :
( big_f(sK0,sK2(X0))
| sK4(X0,X1) = X1 ),
inference(forward_subsumption_resolution,[],[f75,f45]) ).
fof(f85,plain,
! [X0,X1] :
( sK4(X0,X1) = X1
| sK1 = sK2(X0) ),
inference(resolution,[],[f76,f5]) ).
fof(f95,plain,
! [X0,X1] :
( ~ big_f(X0,X1)
| X0 != X0
| sK1 = sK2(X1) ),
inference(superposition,[],[f43,f85]) ).
fof(f101,plain,
! [X0,X1] :
( ~ big_f(X0,X1)
| sK1 = sK2(X1) ),
inference(trivial_inequality_removal,[],[f95]) ).
fof(f105,plain,
! [X0,X1] :
( ~ big_f(X0,X1)
| X0 != X0
| sK0 != X0
| sK2(X1) != X1 ),
inference(superposition,[],[f43,f68]) ).
fof(f106,plain,
! [X0,X1] :
( ~ big_f(X0,X1)
| sK0 != X0
| sK2(X1) != X1 ),
inference(trivial_inequality_removal,[],[f105]) ).
fof(f110,plain,
! [X0,X1] :
( ~ big_f(X0,X1)
| sK2(X1) != X1 ),
inference(forward_subsumption_resolution,[],[f106,f6]) ).
fof(f116,plain,
sK1 = sK2(sK1),
inference(resolution,[],[f101,f13]) ).
fof(f122,definition,
( spl5_2
<=> sK1 = sK2(sK1) ),
introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition]) ).
fof(f124,plain,
( sK1 = sK2(sK1)
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f122]) ).
fof(f126,plain,
spl5_2,
inference(avatar_split_clause,[],[f116,f122]) ).
fof(f169,plain,
sK1 != sK2(sK1),
inference(resolution,[],[f110,f13]) ).
fof(f172,plain,
( $false
| ~ spl5_2 ),
inference(forward_subsumption_resolution,[],[f169,f124]) ).
fof(f173,plain,
~ spl5_2,
inference(avatar_contradiction_clause,[],[f172]) ).
cnf(s2,plain,
spl5_2,
inference(sat_conversion,[],[f126]) ).
cnf(s3,plain,
~ spl5_2,
inference(sat_conversion,[],[f173]) ).
cnf(s5,plain,
$false,
inference(rat,[],[s2,s3]) ).
fof(f175,plain,
$false,
inference(avatar_sat_refutation,[],[s5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN075+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 % Computer : n015.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Mon Sep 28 15:35:17 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 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.21/0.28 % (2716580)Will run a generic schedule for satisfiability detection.
% 0.21/0.28 % (2716589)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2830616870:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.28 % (2716589) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2716580-2716589"...
% 0.21/0.28 % (2716589)...printing done.
% 0.21/0.28 % (2716586)% WARNING: option uhcvi not known.
% 0.21/0.28 % (2716589)Refutation found. Thanks to Tanya!
% 0.21/0.28 % SZS status Theorem for theBenchmark
% 0.21/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.28 % (2716589)------------------------------
% 0.21/0.28 % (2716589)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (2716589)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (2716589)CaDiCaL version: 2.1.3
% 0.21/0.28 % (2716589)Termination reason: Refutation
% 0.21/0.28 % (2716589)Time elapsed: 0.003 s
% 0.21/0.28 % (2716589)Peak memory usage: 12 MB
% 0.21/0.28 % (2716589)Instructions burned: 6 (million)
% 0.21/0.28 % (2716580)Success in time 0.036 s
% 0.21/0.28 % Vampire exiting
%------------------------------------------------------------------------------