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