%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU267+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n016.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 12:52:39 PM UTC 2026
% Result : Theorem 0.15s 0.45s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 8 unt; 2 def)
% Number of atoms : 74 ( 56 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 69 ( 27 ~; 24 |; 2 &)
% ( 8 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 76 ( 0 sgn 66 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,conjecture,
! [X0,X1] :
( pair_first(ordered_pair(X0,X1)) = X0
& pair_second(ordered_pair(X0,X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_mcart_1) ).
fof(f18,negated_conjecture,
~ ! [X0,X1] :
( pair_first(ordered_pair(X0,X1)) = X0
& pair_second(ordered_pair(X0,X1)) = X1 ),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f19,axiom,
! [X0] :
( ? [X1,X2] : X0 = ordered_pair(X1,X2)
=> ! [X1] :
( X1 = pair_first(X0)
<=> ! [X2,X3] :
( X0 = ordered_pair(X2,X3)
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_mcart_1) ).
fof(f20,axiom,
! [X0] :
( ? [X1,X2] : X0 = ordered_pair(X1,X2)
=> ! [X1] :
( X1 = pair_second(X0)
<=> ! [X2,X3] :
( X0 = ordered_pair(X2,X3)
=> X1 = X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_mcart_1) ).
fof(f21,plain,
! [X0] :
( ? [X1,X2] : X0 = ordered_pair(X1,X2)
=> ! [X3] :
( pair_first(X0) = X3
<=> ! [X4,X5] :
( ordered_pair(X4,X5) = X0
=> X3 = X4 ) ) ),
inference(rectify,[],[f19]) ).
fof(f22,plain,
! [X0] :
( ? [X1,X2] : X0 = ordered_pair(X1,X2)
=> ! [X3] :
( pair_second(X0) = X3
<=> ! [X4,X5] :
( ordered_pair(X4,X5) = X0
=> X3 = X5 ) ) ),
inference(rectify,[],[f20]) ).
fof(f30,plain,
? [X0,X1] :
( pair_first(ordered_pair(X0,X1)) != X0
| pair_second(ordered_pair(X0,X1)) != X1 ),
inference(ennf_transformation,[],[f18]) ).
fof(f31,plain,
! [X0] :
( ! [X3] :
( pair_first(X0) = X3
<=> ! [X4,X5] :
( X3 = X4
| ordered_pair(X4,X5) != X0 ) )
| ! [X1,X2] : ordered_pair(X1,X2) != X0 ),
inference(ennf_transformation,[],[f21]) ).
fof(f32,plain,
! [X0] :
( ! [X3] :
( pair_second(X0) = X3
<=> ! [X4,X5] :
( X3 = X5
| ordered_pair(X4,X5) != X0 ) )
| ! [X1,X2] : ordered_pair(X1,X2) != X0 ),
inference(ennf_transformation,[],[f22]) ).
fof(f44,plain,
( sK4 != pair_second(ordered_pair(sK3,sK4))
| sK3 != pair_first(ordered_pair(sK3,sK4)) ),
inference(cnf_transformation,[],[f30]) ).
fof(f45,plain,
! [X2,X3,X0,X1,X4,X5] :
( ordered_pair(X1,X2) != X0
| ordered_pair(X4,X5) != X0
| X3 = X4
| pair_first(X0) != X3 ),
inference(cnf_transformation,[],[f31]) ).
fof(f48,plain,
! [X2,X3,X0,X1,X4,X5] :
( ordered_pair(X1,X2) != X0
| ordered_pair(X4,X5) != X0
| X3 = X5
| pair_second(X0) != X3 ),
inference(cnf_transformation,[],[f32]) ).
fof(f53,plain,
! [X2,X3,X1,X4,X5] :
( ordered_pair(X1,X2) != ordered_pair(X4,X5)
| X3 = X4
| pair_first(ordered_pair(X1,X2)) != X3 ),
inference(equality_resolution,[],[f45]) ).
fof(f54,plain,
! [X2,X1,X4,X5] :
( ordered_pair(X1,X2) != ordered_pair(X4,X5)
| pair_first(ordered_pair(X1,X2)) = X4 ),
inference(equality_resolution,[],[f53]) ).
fof(f57,plain,
! [X2,X3,X1,X4,X5] :
( ordered_pair(X1,X2) != ordered_pair(X4,X5)
| X3 = X5
| pair_second(ordered_pair(X1,X2)) != X3 ),
inference(equality_resolution,[],[f48]) ).
fof(f58,plain,
! [X2,X1,X4,X5] :
( ordered_pair(X1,X2) != ordered_pair(X4,X5)
| pair_second(ordered_pair(X1,X2)) = X5 ),
inference(equality_resolution,[],[f57]) ).
fof(f70,definition,
( spl9_1
<=> sK3 = pair_first(ordered_pair(sK3,sK4)) ),
introduced(definition,[new_symbols(definition,[spl9_1])],[avatar_definition]) ).
fof(f72,plain,
( sK3 != pair_first(ordered_pair(sK3,sK4))
| spl9_1 ),
inference(avatar_component_clause,[],[f70]) ).
fof(f74,definition,
( spl9_2
<=> sK4 = pair_second(ordered_pair(sK3,sK4)) ),
introduced(definition,[new_symbols(definition,[spl9_2])],[avatar_definition]) ).
fof(f76,plain,
( sK4 != pair_second(ordered_pair(sK3,sK4))
| spl9_2 ),
inference(avatar_component_clause,[],[f74]) ).
fof(f77,plain,
( ~ spl9_1
| ~ spl9_2 ),
inference(avatar_split_clause,[],[f44,f74,f70]) ).
fof(f92,plain,
! [X0,X1] : pair_first(ordered_pair(X0,X1)) = X0,
inference(equality_resolution,[],[f54]) ).
fof(f93,plain,
( $false
| spl9_1 ),
inference(backward_subsumption_resolution,[],[f72,f92]) ).
fof(f94,plain,
spl9_1,
inference(avatar_contradiction_clause,[],[f93]) ).
fof(f95,plain,
! [X0,X1] : pair_second(ordered_pair(X0,X1)) = X1,
inference(equality_resolution,[],[f58]) ).
fof(f96,plain,
( $false
| spl9_2 ),
inference(backward_subsumption_resolution,[],[f76,f95]) ).
fof(f97,plain,
spl9_2,
inference(avatar_contradiction_clause,[],[f96]) ).
cnf(s1,plain,
( ~ spl9_1
| ~ spl9_2 ),
inference(sat_conversion,[],[f77]) ).
cnf(s2,plain,
spl9_1,
inference(sat_conversion,[],[f94]) ).
cnf(s3,plain,
spl9_2,
inference(sat_conversion,[],[f97]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s3,s2]) ).
fof(f98,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU267+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n016.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 28 04:29:03 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 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.15/0.45 % (3257931)Will run a generic schedule for satisfiability detection.
% 0.15/0.45 % (3257937)% WARNING: option uhcvi not known.
% 0.15/0.45 % (3257937)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3045070964:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.45 % (3257937) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3257931-3257937"...
% 0.15/0.45 % (3257937)...printing done.
% 0.15/0.45 % (3257937)Refutation found. Thanks to Tanya!
% 0.15/0.45 % SZS status Theorem for theBenchmark
% 0.15/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.45 % (3257937)------------------------------
% 0.15/0.45 % (3257937)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.45 % (3257937)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.45 % (3257937)CaDiCaL version: 2.1.3
% 0.15/0.45 % (3257937)Termination reason: Refutation
% 0.15/0.45 % (3257937)Time elapsed: 0.002 s
% 0.15/0.45 % (3257937)Peak memory usage: 12 MB
% 0.15/0.45 % (3257937)Instructions burned: 3 (million)
% 0.15/0.45 % (3257931)Success in time 0.035 s
% 0.15/0.45 % Vampire exiting
%------------------------------------------------------------------------------