%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN315+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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:07:16 PM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 38 ( 5 unt; 5 def)
% Number of atoms : 97 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 101 ( 42 ~; 36 |; 10 &)
% ( 10 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 7 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 23 ( 0 sgn 18 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
? [X0] :
! [X1] :
( ( big_f(X0)
<=> p )
=> ( big_f(X1)
<=> p ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_2_1) ).
fof(f2,negated_conjecture,
~ ? [X0] :
! [X1] :
( ( big_f(X0)
<=> p )
=> ( big_f(X1)
<=> p ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
! [X0] :
? [X1] :
( ( big_f(X1)
<~> p )
& ( big_f(X0)
<=> p ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
! [X0] :
? [X1] :
( ( ~ p
| ~ big_f(X1) )
& ( p
| big_f(X1) )
& ( big_f(X0)
| ~ p )
& ( p
| ~ big_f(X0) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f5,plain,
! [X0] :
? [X1] :
( ( ~ p
| ~ big_f(X1) )
& ( p
| big_f(X1) )
& ( big_f(X0)
| ~ p )
& ( p
| ~ big_f(X0) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
! [X0] :
( ( ~ p
| ~ big_f(sK0(X0)) )
& ( p
| big_f(sK0(X0)) )
& ( big_f(X0)
| ~ p )
& ( p
| ~ big_f(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f5]) ).
fof(f7,plain,
! [X0] :
( p
| ~ big_f(X0) ),
inference(cnf_transformation,[],[f6]) ).
fof(f8,plain,
! [X0] :
( big_f(X0)
| ~ p ),
inference(cnf_transformation,[],[f6]) ).
fof(f9,plain,
! [X0] :
( p
| big_f(sK0(X0)) ),
inference(cnf_transformation,[],[f6]) ).
fof(f10,plain,
! [X0] :
( ~ p
| ~ big_f(sK0(X0)) ),
inference(cnf_transformation,[],[f6]) ).
fof(f12,definition,
( spl1_1
<=> ! [X0] : ~ big_f(X0) ),
introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).
fof(f13,plain,
( ! [X0] : ~ big_f(X0)
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f12]) ).
fof(f15,definition,
( spl1_2
<=> p ),
introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).
fof(f18,plain,
( spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f7,f15,f12]) ).
fof(f20,definition,
( spl1_3
<=> ! [X0] : big_f(X0) ),
introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).
fof(f21,plain,
( ! [X0] : big_f(X0)
| ~ spl1_3 ),
inference(avatar_component_clause,[],[f20]) ).
fof(f22,plain,
( ~ spl1_2
| spl1_3 ),
inference(avatar_split_clause,[],[f8,f20,f15]) ).
fof(f24,definition,
( spl1_4
<=> ! [X0] : big_f(sK0(X0)) ),
introduced(definition,[new_symbols(definition,[spl1_4])],[avatar_definition]) ).
fof(f25,plain,
( ! [X0] : big_f(sK0(X0))
| ~ spl1_4 ),
inference(avatar_component_clause,[],[f24]) ).
fof(f26,plain,
( spl1_4
| spl1_2 ),
inference(avatar_split_clause,[],[f9,f15,f24]) ).
fof(f28,definition,
( spl1_5
<=> ! [X0] : ~ big_f(sK0(X0)) ),
introduced(definition,[new_symbols(definition,[spl1_5])],[avatar_definition]) ).
fof(f29,plain,
( ! [X0] : ~ big_f(sK0(X0))
| ~ spl1_5 ),
inference(avatar_component_clause,[],[f28]) ).
fof(f30,plain,
( spl1_5
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f10,f15,f28]) ).
fof(f31,plain,
( $false
| ~ spl1_3
| ~ spl1_5 ),
inference(forward_subsumption_resolution,[],[f29,f21]) ).
fof(f32,plain,
( ~ spl1_3
| ~ spl1_5 ),
inference(avatar_contradiction_clause,[],[f31]) ).
fof(f35,plain,
( $false
| ~ spl1_1
| ~ spl1_4 ),
inference(forward_subsumption_resolution,[],[f25,f13]) ).
fof(f36,plain,
( ~ spl1_1
| ~ spl1_4 ),
inference(avatar_contradiction_clause,[],[f35]) ).
cnf(s1,plain,
( spl1_1
| spl1_2 ),
inference(sat_conversion,[],[f18]) ).
cnf(s2,plain,
( ~ spl1_2
| spl1_3 ),
inference(sat_conversion,[],[f22]) ).
cnf(s3,plain,
( spl1_2
| spl1_4 ),
inference(sat_conversion,[],[f26]) ).
cnf(s4,plain,
( ~ spl1_2
| spl1_5 ),
inference(sat_conversion,[],[f30]) ).
cnf(s5,plain,
( ~ spl1_3
| ~ spl1_5 ),
inference(sat_conversion,[],[f32]) ).
cnf(s7,plain,
( ~ spl1_1
| ~ spl1_4 ),
inference(sat_conversion,[],[f36]) ).
cnf(s8,plain,
~ spl1_2,
inference(rat,[],[s5,s2,s4]) ).
cnf(s9,plain,
spl1_4,
inference(rat,[],[s3,s8]) ).
cnf(s10,plain,
spl1_1,
inference(rat,[],[s1,s8]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s7,s9,s10]) ).
fof(f37,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN315+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.20 % Computer : n010.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Mon Sep 28 15:42:32 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.23 Running first-order model finding
% 0.10/0.23 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.20/0.27 % (2026697)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (2026707)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3527289518:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.27 % (2026707) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2026697-2026707"...
% 0.20/0.27 % (2026703)% WARNING: option uhcvi not known.
% 0.20/0.27 % (2026707)...printing done.
% 0.20/0.27 % (2026707)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.27 % (2026707)------------------------------
% 0.20/0.27 % (2026707)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (2026707)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (2026707)CaDiCaL version: 2.1.3
% 0.20/0.27 % (2026707)Termination reason: Refutation
% 0.20/0.27 % (2026707)Time elapsed: 0.001 s
% 0.20/0.27 % (2026707)Peak memory usage: 12 MB
% 0.20/0.27 % (2026707)Instructions burned: 1 (million)
% 0.20/0.27 % (2026697)Success in time 0.03 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------