%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN074+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 : n015.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:41 PM UTC 2026
% Result : Theorem 0.08s 0.27s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 2
% Syntax : Number of formulae : 32 ( 7 unt; 0 def)
% Number of atoms : 69 ( 43 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 62 ( 25 ~; 29 |; 1 &)
% ( 6 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 45 ( 37 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0,X1] :
! [X2,X3] :
( big_f(X2,X3)
<=> ( X2 = X0
& X3 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel51_1) ).
fof(f2,conjecture,
? [X0] :
! [X1] :
( ? [X2] :
! [X3] :
( big_f(X1,X3)
<=> X3 = X2 )
<=> X1 = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel51) ).
fof(f3,negated_conjecture,
~ ? [X0] :
! [X1] :
( ? [X2] :
! [X3] :
( big_f(X1,X3)
<=> X3 = X2 )
<=> X1 = X0 ),
inference(negated_conjecture,[status(cth)],[f2]) ).
fof(f4,plain,
! [X0] :
? [X1] :
( ? [X2] :
! [X3] :
( big_f(X1,X3)
<=> X3 = X2 )
<~> X1 = X0 ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
! [X2,X3] :
( sK1 = X3
| ~ big_f(X2,X3) ),
inference(cnf_transformation,[],[f1]) ).
fof(f6,plain,
! [X2,X3] :
( sK0 = X2
| ~ big_f(X2,X3) ),
inference(cnf_transformation,[],[f1]) ).
fof(f7,plain,
! [X2,X3] :
( sK1 != X3
| sK0 != X2
| big_f(X2,X3) ),
inference(cnf_transformation,[],[f1]) ).
fof(f8,plain,
! [X2,X0] :
( sK2(X0) != X0
| sK4(X0,X2) = X2
| big_f(sK2(X0),sK4(X0,X2)) ),
inference(cnf_transformation,[],[f4]) ).
fof(f9,plain,
! [X2,X0] :
( sK2(X0) != X0
| sK4(X0,X2) != X2
| ~ big_f(sK2(X0),sK4(X0,X2)) ),
inference(cnf_transformation,[],[f4]) ).
fof(f10,plain,
! [X3,X0] :
( sK2(X0) = X0
| sK3(X0) != X3
| big_f(sK2(X0),X3) ),
inference(cnf_transformation,[],[f4]) ).
fof(f12,plain,
! [X2] :
( sK0 != X2
| big_f(X2,sK1) ),
inference(equality_resolution,[],[f7]) ).
fof(f13,plain,
big_f(sK0,sK1),
inference(equality_resolution,[],[f12]) ).
fof(f14,plain,
! [X0] :
( sK2(X0) = X0
| big_f(sK2(X0),sK3(X0)) ),
inference(equality_resolution,[],[f10]) ).
fof(f15,plain,
~ big_f(sK0,sK1),
inference(consistent_polarity_flipping,[],[f13]) ).
fof(f16,plain,
! [X2,X3] :
( big_f(X2,X3)
| sK0 = X2 ),
inference(consistent_polarity_flipping,[],[f6]) ).
fof(f17,plain,
! [X2,X3] :
( big_f(X2,X3)
| sK1 = X3 ),
inference(consistent_polarity_flipping,[],[f5]) ).
fof(f19,plain,
! [X0] :
( ~ big_f(sK2(X0),sK3(X0))
| sK2(X0) = X0 ),
inference(consistent_polarity_flipping,[],[f14]) ).
fof(f20,plain,
! [X2,X0] :
( sK4(X0,X2) != X2
| sK2(X0) != X0
| big_f(sK2(X0),sK4(X0,X2)) ),
inference(consistent_polarity_flipping,[],[f9]) ).
fof(f21,plain,
! [X2,X0] :
( sK2(X0) != X0
| sK4(X0,X2) = X2
| ~ big_f(sK2(X0),sK4(X0,X2)) ),
inference(consistent_polarity_flipping,[],[f8]) ).
fof(f24,plain,
! [X0] :
( sK0 = sK2(X0)
| sK2(X0) = X0 ),
inference(resolution,[],[f16,f19]) ).
fof(f30,plain,
! [X0] :
( sK0 != X0
| sK2(X0) = X0 ),
inference(equality_factoring,[],[f24]) ).
fof(f37,plain,
sK0 = sK2(sK0),
inference(equality_resolution,[],[f30]) ).
fof(f38,plain,
! [X0] :
( sK0 != sK0
| sK4(sK0,X0) = X0
| ~ big_f(sK0,sK4(sK0,X0)) ),
inference(superposition,[],[f21,f37]) ).
fof(f39,plain,
! [X0] :
( ~ big_f(sK0,sK4(sK0,X0))
| sK4(sK0,X0) = X0 ),
inference(trivial_inequality_removal,[],[f38]) ).
fof(f51,plain,
! [X0] :
( sK4(sK0,X0) = X0
| sK1 = sK4(sK0,X0) ),
inference(resolution,[],[f39,f17]) ).
fof(f69,plain,
! [X0] :
( sK1 != X0
| sK1 = sK4(sK0,X0) ),
inference(equality_factoring,[],[f51]) ).
fof(f77,plain,
sK1 = sK4(sK0,sK1),
inference(equality_resolution,[],[f69]) ).
fof(f113,plain,
( sK1 != sK1
| sK0 != sK2(sK0)
| big_f(sK2(sK0),sK1) ),
inference(superposition,[],[f20,f77]) ).
fof(f114,plain,
( sK0 != sK2(sK0)
| big_f(sK2(sK0),sK1) ),
inference(trivial_inequality_removal,[],[f113]) ).
fof(f115,plain,
big_f(sK2(sK0),sK1),
inference(forward_subsumption_resolution,[],[f114,f16]) ).
fof(f116,plain,
big_f(sK0,sK1),
inference(forward_demodulation,[],[f115,f37]) ).
fof(f117,plain,
$false,
inference(forward_subsumption_resolution,[],[f116,f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN074+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20 % Computer : n015.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Mon Sep 28 15:35:32 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/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.08/0.27 % (2717197)Will run a generic schedule for satisfiability detection.
% 0.08/0.27 % (2717209)% WARNING: option uhcvi not known.
% 0.08/0.27 % (2717209)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1055962810:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.27 % (2717209) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2717197-2717209"...
% 0.08/0.27 % (2717209)...printing done.
% 0.08/0.27 % (2717209)Refutation found. Thanks to Tanya!
% 0.08/0.27 % SZS status Theorem for theBenchmark
% 0.08/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.27 % (2717209)------------------------------
% 0.08/0.27 % (2717209)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.27 % (2717209)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.27 % (2717209)CaDiCaL version: 2.1.3
% 0.08/0.27 % (2717209)Termination reason: Refutation
% 0.08/0.27 % (2717209)Time elapsed: 0.002 s
% 0.08/0.27 % (2717209)Peak memory usage: 12 MB
% 0.08/0.27 % (2717209)Instructions burned: 5 (million)
% 0.08/0.27 % (2717197)Success in time 0.028 s
% 0.19/0.27 % Vampire exiting
%------------------------------------------------------------------------------