%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN070+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 : n007.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:40 PM UTC 2026
% Result : Theorem 0.15s 0.34s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 34 ( 5 unt; 0 def)
% Number of atoms : 123 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 146 ( 57 ~; 60 |; 22 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 53 ( 47 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ( big_f(X0)
& ( ( big_f(X1)
& big_h(X1,X0) )
=> big_g(X1) ) )
=> big_g(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel46_1) ).
fof(f2,axiom,
( ? [X0] :
( big_f(X0)
& ~ big_g(X0) )
=> ? [X1] :
( big_f(X1)
& ~ big_g(X1)
& ! [X2] :
( ( big_f(X2)
& ~ big_g(X2) )
=> big_j(X1,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel46_2) ).
fof(f3,axiom,
! [X0,X1] :
( ( big_f(X0)
& big_f(X1)
& big_h(X0,X1) )
=> ~ big_j(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel46_3) ).
fof(f4,conjecture,
! [X0] :
( big_f(X0)
=> big_g(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel46) ).
fof(f5,negated_conjecture,
~ ! [X0] :
( big_f(X0)
=> big_g(X0) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f6,plain,
! [X0,X1] :
( big_g(X0)
| ~ big_f(X0)
| ( ~ big_g(X1)
& big_f(X1)
& big_h(X1,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f7,plain,
! [X0,X1] :
( big_g(X0)
| ~ big_f(X0)
| ( ~ big_g(X1)
& big_f(X1)
& big_h(X1,X0) ) ),
inference(flattening,[],[f6]) ).
fof(f8,plain,
( ? [X1] :
( big_f(X1)
& ~ big_g(X1)
& ! [X2] :
( big_j(X1,X2)
| ~ big_f(X2)
| big_g(X2) ) )
| ! [X0] :
( ~ big_f(X0)
| big_g(X0) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f9,plain,
( ? [X1] :
( big_f(X1)
& ~ big_g(X1)
& ! [X2] :
( big_j(X1,X2)
| ~ big_f(X2)
| big_g(X2) ) )
| ! [X0] :
( ~ big_f(X0)
| big_g(X0) ) ),
inference(flattening,[],[f8]) ).
fof(f10,plain,
! [X0,X1] :
( ~ big_j(X1,X0)
| ~ big_f(X0)
| ~ big_f(X1)
| ~ big_h(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f11,plain,
! [X0,X1] :
( ~ big_j(X1,X0)
| ~ big_f(X0)
| ~ big_f(X1)
| ~ big_h(X0,X1) ),
inference(flattening,[],[f10]) ).
fof(f12,plain,
? [X0] :
( ~ big_g(X0)
& big_f(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f13,plain,
( ? [X0] :
( big_f(X0)
& ~ big_g(X0)
& ! [X1] :
( big_j(X0,X1)
| ~ big_f(X1)
| big_g(X1) ) )
| ! [X2] :
( ~ big_f(X2)
| big_g(X2) ) ),
inference(rectify,[],[f9]) ).
fof(f14,plain,
( ( big_f(sK0)
& ~ big_g(sK0)
& ! [X1] :
( big_j(sK0,X1)
| ~ big_f(X1)
| big_g(X1) ) )
| ! [X2] :
( ~ big_f(X2)
| big_g(X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f13]) ).
fof(f15,plain,
( ~ big_g(sK1)
& big_f(sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f12]) ).
fof(f16,plain,
! [X0,X1] :
( big_g(X0)
| ~ big_f(X0)
| big_h(X1,X0) ),
inference(cnf_transformation,[],[f7]) ).
fof(f17,plain,
! [X0,X1] :
( big_g(X0)
| ~ big_f(X0)
| big_f(X1) ),
inference(cnf_transformation,[],[f7]) ).
fof(f18,plain,
! [X0,X1] :
( big_g(X0)
| ~ big_f(X0)
| ~ big_g(X1) ),
inference(cnf_transformation,[],[f7]) ).
fof(f19,plain,
! [X2,X1] :
( big_j(sK0,X1)
| ~ big_f(X1)
| big_g(X1)
| ~ big_f(X2)
| big_g(X2) ),
inference(cnf_transformation,[],[f14]) ).
fof(f20,plain,
! [X2] :
( ~ big_g(sK0)
| ~ big_f(X2)
| big_g(X2) ),
inference(cnf_transformation,[],[f14]) ).
fof(f21,plain,
! [X2] :
( big_f(sK0)
| ~ big_f(X2)
| big_g(X2) ),
inference(cnf_transformation,[],[f14]) ).
fof(f22,plain,
! [X0,X1] :
( ~ big_j(X1,X0)
| ~ big_f(X0)
| ~ big_f(X1)
| ~ big_h(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f23,plain,
big_f(sK1),
inference(cnf_transformation,[],[f15]) ).
fof(f24,plain,
~ big_g(sK1),
inference(cnf_transformation,[],[f15]) ).
fof(f25,plain,
! [X0,X1] :
( ~ big_g(X0)
| big_f(X0)
| big_g(X1) ),
inference(consistent_polarity_flipping,[],[f18]) ).
fof(f26,plain,
! [X0,X1] :
( ~ big_g(X0)
| big_f(X0)
| ~ big_f(X1) ),
inference(consistent_polarity_flipping,[],[f17]) ).
fof(f27,plain,
! [X0,X1] :
( ~ big_g(X0)
| big_f(X0)
| ~ big_h(X1,X0) ),
inference(consistent_polarity_flipping,[],[f16]) ).
fof(f28,plain,
! [X2] :
( ~ big_f(sK0)
| big_f(X2)
| ~ big_g(X2) ),
inference(consistent_polarity_flipping,[],[f21]) ).
fof(f29,plain,
! [X2] :
( big_g(sK0)
| big_f(X2)
| ~ big_g(X2) ),
inference(consistent_polarity_flipping,[],[f20]) ).
fof(f30,plain,
! [X2,X1] :
( big_j(sK0,X1)
| big_f(X1)
| ~ big_g(X1)
| big_f(X2)
| ~ big_g(X2) ),
inference(consistent_polarity_flipping,[],[f19]) ).
fof(f31,plain,
! [X0,X1] :
( ~ big_j(X0,X1)
| big_f(X1)
| big_f(X0)
| big_h(X1,X0) ),
inference(consistent_polarity_flipping,[],[f22]) ).
fof(f32,plain,
big_g(sK1),
inference(consistent_polarity_flipping,[],[f24]) ).
fof(f33,plain,
~ big_f(sK1),
inference(consistent_polarity_flipping,[],[f23]) ).
fof(f49,plain,
$false,
inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f25,f26,f27,f28,f29,f30,f31,f32,f33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN070+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.15/0.26 % Computer : n007.cluster.edu
% 0.15/0.26 % Model : x86_64 x86_64
% 0.15/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.26 % Memory : 8046.5625MB
% 0.15/0.26 % OS : Linux 6.8.0-71-generic
% 0.15/0.26 % CPULimit : 300
% 0.15/0.26 % WCLimit : 300
% 0.15/0.26 % DateTime : Mon Sep 28 15:26:55 UTC 2026
% 0.15/0.26 % CPUTime :
% 0.15/0.26 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.15/0.30 Running first-order model finding
% 0.15/0.30 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.15/0.34 % (2493885)Will run a generic schedule for satisfiability detection.
% 0.15/0.34 % (2493890)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1604478360_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.34 % Detected minimum model sizes of [1]
% 0.15/0.34 % Detected maximum model sizes of [2]
% 0.15/0.34 % TRYING [1]
% 0.15/0.34 % TRYING [2]
% 0.15/0.34 % (2493890) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2493885-2493890"...
% 0.15/0.34 % (2493890)...printing done.
% 0.15/0.34 % (2493891)% WARNING: option uhcvi not known.
% 0.15/0.34 % (2493890)Refutation found. Thanks to Tanya!
% 0.15/0.34 % SZS status Theorem for theBenchmark
% 0.15/0.34 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.34 % (2493890)------------------------------
% 0.15/0.34 % (2493890)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.34 % (2493890)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.34 % (2493890)CaDiCaL version: 2.1.3
% 0.15/0.34 % (2493890)Termination reason: Refutation
% 0.15/0.34 % (2493890)Time elapsed: 0.001 s
% 0.15/0.34 % (2493890)Peak memory usage: 11 MB
% 0.15/0.34 % (2493890)Instructions burned: 2 (million)
% 0.15/0.34 % (2493885)Success in time 0.033 s
% 0.15/0.34 % Vampire exiting
%------------------------------------------------------------------------------