%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN333+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 : n009.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:21 PM UTC 2026
% Result : Theorem 0.07s 0.24s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 16 ( 4 unt; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 77 ( 35 ~; 24 |; 14 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 34 ( 28 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
? [X0,X1] :
! [X2] :
( big_f(X0,X1)
=> ( big_f(X1,X2)
& big_f(X2,X2)
& ( ( big_f(X0,X1)
& big_g(X0,X1) )
=> ( big_g(X0,X2)
& big_g(X2,X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_14_5) ).
fof(f2,negated_conjecture,
~ ? [X0,X1] :
! [X2] :
( big_f(X0,X1)
=> ( big_f(X1,X2)
& big_f(X2,X2)
& ( ( big_f(X0,X1)
& big_g(X0,X1) )
=> ( big_g(X0,X2)
& big_g(X2,X2) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
! [X0,X1] :
? [X2] :
( ( ~ big_f(X1,X2)
| ~ big_f(X2,X2)
| ( ( ~ big_g(X0,X2)
| ~ big_g(X2,X2) )
& big_f(X0,X1)
& big_g(X0,X1) ) )
& big_f(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
! [X0,X1] :
? [X2] :
( ( ~ big_f(X1,X2)
| ~ big_f(X2,X2)
| ( ( ~ big_g(X0,X2)
| ~ big_g(X2,X2) )
& big_f(X0,X1)
& big_g(X0,X1) ) )
& big_f(X0,X1) ),
inference(flattening,[],[f3]) ).
fof(f5,plain,
! [X0,X1] :
( ~ big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_g(X0,sK0(X0,X1))
| ~ big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(X1,sK0(X0,X1)) ),
inference(cnf_transformation,[],[f4]) ).
fof(f6,plain,
! [X0,X1] :
( big_g(X0,X1)
| ~ big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(X1,sK0(X0,X1)) ),
inference(cnf_transformation,[],[f4]) ).
fof(f7,plain,
! [X0,X1] :
( ~ big_f(sK0(X0,X1),sK0(X0,X1))
| big_f(X0,X1)
| ~ big_f(X1,sK0(X0,X1)) ),
inference(cnf_transformation,[],[f4]) ).
fof(f8,plain,
! [X0,X1] : big_f(X0,X1),
inference(cnf_transformation,[],[f4]) ).
fof(f10,plain,
! [X0,X1] :
( ~ big_g(X0,sK0(X0,X1))
| ~ big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(X1,sK0(X0,X1))
| ~ big_f(sK0(sK0(X0,X1),sK0(X0,X1)),sK0(sK0(X0,X1),sK0(X0,X1)))
| ~ big_f(sK0(X0,X1),sK0(sK0(X0,X1),sK0(X0,X1))) ),
inference(resolution,[],[f5,f6]) ).
fof(f11,plain,
! [X0,X1] :
( ~ big_g(X0,sK0(X0,X1))
| ~ big_f(X1,sK0(X0,X1))
| ~ big_f(sK0(sK0(X0,X1),sK0(X0,X1)),sK0(sK0(X0,X1),sK0(X0,X1)))
| ~ big_f(sK0(X0,X1),sK0(sK0(X0,X1),sK0(X0,X1))) ),
inference(forward_subsumption_resolution,[],[f10,f7]) ).
fof(f12,plain,
! [X0,X1] :
( ~ big_g(X0,sK0(X0,X1))
| ~ big_f(X1,sK0(X0,X1))
| ~ big_f(sK0(sK0(X0,X1),sK0(X0,X1)),sK0(sK0(X0,X1),sK0(X0,X1))) ),
inference(forward_subsumption_resolution,[],[f11,f8]) ).
fof(f13,plain,
! [X0,X1] :
( ~ big_g(X0,sK0(X0,X1))
| ~ big_f(X1,sK0(X0,X1)) ),
inference(forward_subsumption_resolution,[],[f12,f8]) ).
fof(f14,plain,
! [X0,X1] : ~ big_g(X0,sK0(X0,X1)),
inference(forward_subsumption_resolution,[],[f13,f8]) ).
fof(f15,plain,
! [X0,X1] :
( ~ big_f(sK0(X0,sK0(X0,X1)),sK0(X0,sK0(X0,X1)))
| ~ big_f(sK0(X0,X1),sK0(X0,sK0(X0,X1))) ),
inference(resolution,[],[f14,f6]) ).
fof(f16,plain,
! [X0,X1] : ~ big_f(sK0(X0,sK0(X0,X1)),sK0(X0,sK0(X0,X1))),
inference(forward_subsumption_resolution,[],[f15,f8]) ).
fof(f17,plain,
$false,
inference(forward_subsumption_resolution,[],[f16,f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN333+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.07/0.17 % Computer : n009.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.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Mon Sep 28 15:42:31 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21 Running first-order model finding
% 0.07/0.21 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.07/0.24 % (3172913)Will run a generic schedule for satisfiability detection.
% 0.07/0.24 % (3172922)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=666117871:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.07/0.24 % (3172922) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3172913-3172922"...
% 0.07/0.24 % (3172922)...printing done.
% 0.07/0.24 % (3172922)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 % (3172922)------------------------------
% 0.07/0.24 % (3172922)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.24 % (3172922)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.24 % (3172922)CaDiCaL version: 2.1.3
% 0.07/0.24 % (3172922)Termination reason: Refutation
% 0.07/0.24 % (3172922)Time elapsed: 0.001 s
% 0.07/0.24 % (3172922)Peak memory usage: 11 MB
% 0.07/0.24 % (3172922)Instructions burned: 1 (million)
% 0.07/0.24 % (3172913)Success in time 0.026 s
% 0.07/0.24 % Vampire exiting
%------------------------------------------------------------------------------