%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN345+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 : n026.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:24 PM UTC 2026
% Result : Theorem 0.21s 0.26s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 21 ( 3 unt; 0 def)
% Number of atoms : 115 ( 0 equ)
% Maximal formula atoms : 14 ( 5 avg)
% Number of connectives : 138 ( 44 ~; 48 |; 24 &)
% ( 2 <=>; 18 =>; 0 <=; 2 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 49 ( 36 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0,X1] :
? [X2,X3] :
! [X4] :
( ( ( big_f(X0,X1,X2)
=> big_f(X3,X2,X4) )
=> ( big_f(X0,X0,X1)
=> big_f(X0,X1,X1) ) )
=> ( ( ( big_f(X1,X2,X3)
=> big_f(X2,X4,X4) )
=> ( big_f(X0,X1,X1)
=> big_f(X0,X0,X1) ) )
=> ( big_f(X2,X3,X4)
=> ( big_f(X1,X1,X2)
& ( big_f(X0,X0,X1)
<=> big_f(X0,X1,X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_16_4) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
? [X2,X3] :
! [X4] :
( ( ( big_f(X0,X1,X2)
=> big_f(X3,X2,X4) )
=> ( big_f(X0,X0,X1)
=> big_f(X0,X1,X1) ) )
=> ( ( ( big_f(X1,X2,X3)
=> big_f(X2,X4,X4) )
=> ( big_f(X0,X1,X1)
=> big_f(X0,X0,X1) ) )
=> ( big_f(X2,X3,X4)
=> ( big_f(X1,X1,X2)
& ( big_f(X0,X0,X1)
<=> big_f(X0,X1,X1) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X1,X1,X2)
| ( big_f(X0,X0,X1)
<~> big_f(X0,X1,X1) ) )
& big_f(X2,X3,X4)
& ( big_f(X0,X0,X1)
| ~ big_f(X0,X1,X1)
| ( ~ big_f(X2,X4,X4)
& big_f(X1,X2,X3) ) )
& ( big_f(X0,X1,X1)
| ~ big_f(X0,X0,X1)
| ( ~ big_f(X3,X2,X4)
& big_f(X0,X1,X2) ) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X1,X1,X2)
| ( big_f(X0,X0,X1)
<~> big_f(X0,X1,X1) ) )
& big_f(X2,X3,X4)
& ( big_f(X0,X0,X1)
| ~ big_f(X0,X1,X1)
| ( ~ big_f(X2,X4,X4)
& big_f(X1,X2,X3) ) )
& ( big_f(X0,X1,X1)
| ~ big_f(X0,X0,X1)
| ( ~ big_f(X3,X2,X4)
& big_f(X0,X1,X2) ) ) ),
inference(flattening,[],[f3]) ).
fof(f5,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X1,X1,X2)
| ( ( ~ big_f(X0,X1,X1)
| ~ big_f(X0,X0,X1) )
& ( big_f(X0,X1,X1)
| big_f(X0,X0,X1) ) ) )
& big_f(X2,X3,X4)
& ( big_f(X0,X0,X1)
| ~ big_f(X0,X1,X1)
| ( ~ big_f(X2,X4,X4)
& big_f(X1,X2,X3) ) )
& ( big_f(X0,X1,X1)
| ~ big_f(X0,X0,X1)
| ( ~ big_f(X3,X2,X4)
& big_f(X0,X1,X2) ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f6,plain,
! [X2,X3] :
( ( ~ big_f(sK1,sK1,X2)
| ( ( ~ big_f(sK0,sK1,sK1)
| ~ big_f(sK0,sK0,sK1) )
& ( big_f(sK0,sK1,sK1)
| big_f(sK0,sK0,sK1) ) ) )
& big_f(X2,X3,sK2(X2,X3))
& ( big_f(sK0,sK0,sK1)
| ~ big_f(sK0,sK1,sK1)
| ( ~ big_f(X2,sK2(X2,X3),sK2(X2,X3))
& big_f(sK1,X2,X3) ) )
& ( big_f(sK0,sK1,sK1)
| ~ big_f(sK0,sK0,sK1)
| ( ~ big_f(X3,X2,sK2(X2,X3))
& big_f(sK0,sK1,X2) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X4,sK2(X2,X3))],[f5]) ).
fof(f7,plain,
! [X2] :
( big_f(sK0,sK1,sK1)
| ~ big_f(sK0,sK0,sK1)
| big_f(sK0,sK1,X2) ),
inference(cnf_transformation,[],[f6]) ).
fof(f8,plain,
! [X2,X3] :
( big_f(sK0,sK1,sK1)
| ~ big_f(sK0,sK0,sK1)
| ~ big_f(X3,X2,sK2(X2,X3)) ),
inference(cnf_transformation,[],[f6]) ).
fof(f9,plain,
! [X2,X3] :
( big_f(sK0,sK0,sK1)
| ~ big_f(sK0,sK1,sK1)
| big_f(sK1,X2,X3) ),
inference(cnf_transformation,[],[f6]) ).
fof(f10,plain,
! [X2,X3] :
( big_f(sK0,sK0,sK1)
| ~ big_f(sK0,sK1,sK1)
| ~ big_f(X2,sK2(X2,X3),sK2(X2,X3)) ),
inference(cnf_transformation,[],[f6]) ).
fof(f11,plain,
! [X2,X3] : big_f(X2,X3,sK2(X2,X3)),
inference(cnf_transformation,[],[f6]) ).
fof(f12,plain,
! [X2] :
( ~ big_f(sK1,sK1,X2)
| big_f(sK0,sK1,sK1)
| big_f(sK0,sK0,sK1) ),
inference(cnf_transformation,[],[f6]) ).
fof(f13,plain,
! [X2] :
( ~ big_f(sK1,sK1,X2)
| ~ big_f(sK0,sK1,sK1)
| ~ big_f(sK0,sK0,sK1) ),
inference(cnf_transformation,[],[f6]) ).
fof(f14,plain,
! [X2] :
( big_f(sK1,sK1,X2)
| big_f(sK0,sK1,sK1)
| big_f(sK0,sK0,sK1) ),
inference(consistent_polarity_flipping,[],[f13]) ).
fof(f15,plain,
! [X2] :
( big_f(sK1,sK1,X2)
| ~ big_f(sK0,sK1,sK1)
| ~ big_f(sK0,sK0,sK1) ),
inference(consistent_polarity_flipping,[],[f12]) ).
fof(f16,plain,
! [X2,X3] : ~ big_f(X2,X3,sK2(X2,X3)),
inference(consistent_polarity_flipping,[],[f11]) ).
fof(f17,plain,
! [X2,X3] :
( ~ big_f(sK0,sK0,sK1)
| big_f(sK0,sK1,sK1)
| big_f(X2,sK2(X2,X3),sK2(X2,X3)) ),
inference(consistent_polarity_flipping,[],[f10]) ).
fof(f18,plain,
! [X2,X3] :
( ~ big_f(sK0,sK0,sK1)
| big_f(sK0,sK1,sK1)
| ~ big_f(sK1,X2,X3) ),
inference(consistent_polarity_flipping,[],[f9]) ).
fof(f19,plain,
! [X2,X3] :
( ~ big_f(sK0,sK1,sK1)
| big_f(sK0,sK0,sK1)
| big_f(X3,X2,sK2(X2,X3)) ),
inference(consistent_polarity_flipping,[],[f8]) ).
fof(f20,plain,
! [X2] :
( ~ big_f(sK0,sK1,sK1)
| big_f(sK0,sK0,sK1)
| ~ big_f(sK0,sK1,X2) ),
inference(consistent_polarity_flipping,[],[f7]) ).
fof(f100,plain,
$false,
inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f14,f15,f16,f17,f18,f19,f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN345+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.06/0.19 % Computer : n026.cluster.edu
% 0.06/0.19 % Model : x86_64 x86_64
% 0.06/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.19 % Memory : 8046.5625MB
% 0.06/0.19 % OS : Linux 6.8.0-71-generic
% 0.06/0.19 % CPULimit : 300
% 0.06/0.19 % WCLimit : 300
% 0.06/0.19 % DateTime : Mon Sep 28 15:49:42 UTC 2026
% 0.06/0.19 % CPUTime :
% 0.06/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.06/0.22 Running first-order model finding
% 0.06/0.22 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.26 % (3970204)Will run a generic schedule for satisfiability detection.
% 0.21/0.26 % (3970209)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1722891295_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.26 % TRYING [1]
% 0.21/0.26 % TRYING [2]
% 0.21/0.26 % TRYING [3]
% 0.21/0.26 % TRYING [4]
% 0.21/0.26 % TRYING [5]
% 0.21/0.26 % (3970210)% WARNING: option uhcvi not known.
% 0.21/0.26 % (3970209) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3970204-3970209"...
% 0.21/0.26 % (3970209)...printing done.
% 0.21/0.26 % (3970209)Refutation found. Thanks to Tanya!
% 0.21/0.26 % SZS status Theorem for theBenchmark
% 0.21/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.26 % (3970209)------------------------------
% 0.21/0.26 % (3970209)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.26 % (3970209)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.26 % (3970209)CaDiCaL version: 2.1.3
% 0.21/0.26 % (3970209)Termination reason: Refutation
% 0.21/0.26 % (3970209)Time elapsed: 0.006 s
% 0.21/0.26 % (3970209)Peak memory usage: 12 MB
% 0.21/0.26 % (3970209)Instructions burned: 23 (million)
% 0.21/0.26 % (3970204)Success in time 0.032 s
% 0.21/0.26 % Vampire exiting
%------------------------------------------------------------------------------