%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN980+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n010.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:23:00 PM UTC 2026
% Result : Theorem 0.10s 0.25s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 40 ( 6 unt; 4 def)
% Number of atoms : 94 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 99 ( 45 ~; 32 |; 6 &)
% ( 4 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 28 ( 0 sgn 21 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0] :
( ! [X1] :
( ( r(X0)
=> r(X1) )
=> p(f(X1),X1) )
=> ? [X2,X1] :
( p(X2,X1)
& ( q(f(X0),X0)
=> q(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ! [X0] :
( ! [X1] :
( ( r(X0)
=> r(X1) )
=> p(f(X1),X1) )
=> ? [X2,X1] :
( p(X2,X1)
& ( q(f(X0),X0)
=> q(X2,X1) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ! [X0] :
( ! [X1] :
( ( r(X0)
=> r(X1) )
=> p(f(X1),X1) )
=> ? [X2,X3] :
( p(X2,X3)
& ( q(f(X0),X0)
=> q(X2,X3) ) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
? [X0] :
( ! [X2,X3] :
( ~ p(X2,X3)
| ( ~ q(X2,X3)
& q(f(X0),X0) ) )
& ! [X1] :
( p(f(X1),X1)
| ( ~ r(X1)
& r(X0) ) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
! [X2,X3] :
( q(f(sK0),sK0)
| ~ p(X2,X3) ),
inference(cnf_transformation,[],[f4]) ).
fof(f6,plain,
! [X2,X3] :
( ~ q(X2,X3)
| ~ p(X2,X3) ),
inference(cnf_transformation,[],[f4]) ).
fof(f7,plain,
! [X1] :
( r(sK0)
| p(f(X1),X1) ),
inference(cnf_transformation,[],[f4]) ).
fof(f8,plain,
! [X1] :
( ~ r(X1)
| p(f(X1),X1) ),
inference(cnf_transformation,[],[f4]) ).
fof(f10,definition,
( spl1_1
<=> ! [X2,X3] : ~ p(X2,X3) ),
introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).
fof(f11,plain,
( ! [X2,X3] : ~ p(X2,X3)
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f10]) ).
fof(f13,definition,
( spl1_2
<=> q(f(sK0),sK0) ),
introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).
fof(f15,plain,
( q(f(sK0),sK0)
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f13]) ).
fof(f16,plain,
( spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f5,f13,f10]) ).
fof(f18,definition,
( spl1_3
<=> ! [X1] : p(f(X1),X1) ),
introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).
fof(f19,plain,
( ! [X1] : p(f(X1),X1)
| ~ spl1_3 ),
inference(avatar_component_clause,[],[f18]) ).
fof(f21,definition,
( spl1_4
<=> r(sK0) ),
introduced(definition,[new_symbols(definition,[spl1_4])],[avatar_definition]) ).
fof(f23,plain,
( r(sK0)
| ~ spl1_4 ),
inference(avatar_component_clause,[],[f21]) ).
fof(f24,plain,
( spl1_3
| spl1_4 ),
inference(avatar_split_clause,[],[f7,f21,f18]) ).
fof(f25,plain,
( ~ p(f(sK0),sK0)
| ~ spl1_2 ),
inference(resolution,[],[f6,f15]) ).
fof(f26,plain,
( $false
| ~ spl1_2
| ~ spl1_3 ),
inference(forward_subsumption_resolution,[],[f25,f19]) ).
fof(f27,plain,
( ~ spl1_2
| ~ spl1_3 ),
inference(avatar_contradiction_clause,[],[f26]) ).
fof(f28,plain,
( $false
| ~ spl1_1
| ~ spl1_3 ),
inference(resolution,[],[f11,f19]) ).
fof(f29,plain,
( ~ spl1_1
| ~ spl1_3 ),
inference(avatar_contradiction_clause,[],[f28]) ).
fof(f31,plain,
( p(f(sK0),sK0)
| ~ spl1_4 ),
inference(resolution,[],[f8,f23]) ).
fof(f32,plain,
( $false
| ~ spl1_2
| ~ spl1_4 ),
inference(forward_subsumption_resolution,[],[f31,f25]) ).
fof(f33,plain,
( ~ spl1_2
| ~ spl1_4 ),
inference(avatar_contradiction_clause,[],[f32]) ).
fof(f34,plain,
( $false
| ~ spl1_1
| ~ spl1_4 ),
inference(forward_subsumption_resolution,[],[f31,f11]) ).
fof(f35,plain,
( ~ spl1_1
| ~ spl1_4 ),
inference(avatar_contradiction_clause,[],[f34]) ).
cnf(s1,plain,
( spl1_1
| spl1_2 ),
inference(sat_conversion,[],[f16]) ).
cnf(s2,plain,
( spl1_3
| spl1_4 ),
inference(sat_conversion,[],[f24]) ).
cnf(s3,plain,
( ~ spl1_2
| ~ spl1_3 ),
inference(sat_conversion,[],[f27]) ).
cnf(s4,plain,
( ~ spl1_1
| ~ spl1_3 ),
inference(sat_conversion,[],[f29]) ).
cnf(s5,plain,
( ~ spl1_2
| ~ spl1_4 ),
inference(sat_conversion,[],[f33]) ).
cnf(s6,plain,
( ~ spl1_1
| ~ spl1_4 ),
inference(sat_conversion,[],[f35]) ).
cnf(s7,plain,
~ spl1_2,
inference(rat,[],[s2,s3,s5]) ).
cnf(s8,plain,
spl1_1,
inference(rat,[],[s1,s7]) ).
cnf(s9,plain,
~ spl1_4,
inference(rat,[],[s6,s8]) ).
cnf(s10,plain,
~ spl1_3,
inference(rat,[],[s4,s8]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s2,s9,s10]) ).
fof(f36,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN980+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.17 % Computer : n010.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Mon Sep 28 17:18:32 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.21 Running first-order model finding
% 0.10/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.10/0.25 % (2083543)Will run a generic schedule for satisfiability detection.
% 0.10/0.25 % (2083552)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=820486361:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.25 % (2083552) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2083543-2083552"...
% 0.10/0.25 % (2083552)...printing done.
% 0.10/0.25 % (2083552)Refutation found. Thanks to Tanya!
% 0.10/0.25 % SZS status Theorem for theBenchmark
% 0.10/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.25 % (2083552)------------------------------
% 0.10/0.25 % (2083552)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.25 % (2083552)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.25 % (2083552)CaDiCaL version: 2.1.3
% 0.10/0.25 % (2083552)Termination reason: Refutation
% 0.10/0.25 % (2083552)Time elapsed: 0.001 s
% 0.10/0.25 % (2083552)Peak memory usage: 12 MB
% 0.10/0.25 % (2083552)Instructions burned: 1 (million)
% 0.10/0.25 % (2083543)Success in time 0.034 s
% 0.10/0.25 % Vampire exiting
%------------------------------------------------------------------------------