%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN393+1.003 : 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 : n018.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:34 PM UTC 2026
% Result : Theorem 0.24s 0.34s
% Output : Refutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 40 ( 1 unt; 1 def)
% Number of atoms : 199 ( 0 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 246 ( 87 ~; 124 |; 14 &)
% ( 19 <=>; 0 =>; 0 <=; 2 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 5 ( 4 usr; 5 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ( p1
<=> p2 )
<=> p3 )
<=> ( p1
<=> ( p2
<=> p3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel12) ).
fof(f2,negated_conjecture,
~ ( ( ( p1
<=> p2 )
<=> p3 )
<=> ( p1
<=> ( p2
<=> p3 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ( ( p1
<=> p2 )
<=> p3 )
<~> ( p1
<=> ( p2
<=> p3 ) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,definition,
( sP0
<=> ( ( p1
<=> p2 )
<=> p3 ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f5,plain,
( sP0
<~> ( p1
<=> ( p2
<=> p3 ) ) ),
inference(definition_folding,[],[f3,f4]) ).
fof(f6,plain,
( ( sP0
| ( ( ~ p3
| ( ( ~ p2
| ~ p1 )
& ( p2
| p1 ) ) )
& ( p3
| ( ( p1
| ~ p2 )
& ( p2
| ~ p1 ) ) ) ) )
& ( ( ( ( ( p1
| ~ p2 )
& ( p2
| ~ p1 ) )
| ~ p3 )
& ( p3
| ( ( ~ p2
| ~ p1 )
& ( p2
| p1 ) ) ) )
| ~ sP0 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f7,plain,
( ( ( ( ( ( ~ p3
| ~ p2 )
& ( p3
| p2 ) )
| ~ p1 )
& ( ( ( p2
| ~ p3 )
& ( p3
| ~ p2 ) )
| p1 ) )
| ~ sP0 )
& ( ( ( p1
| ( ( ~ p3
| ~ p2 )
& ( p3
| p2 ) ) )
& ( ( ( p2
| ~ p3 )
& ( p3
| ~ p2 ) )
| ~ p1 ) )
| sP0 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f8,plain,
( p3
| p2
| p1
| ~ sP0 ),
inference(cnf_transformation,[],[f6]) ).
fof(f9,plain,
( p3
| ~ p2
| ~ p1
| ~ sP0 ),
inference(cnf_transformation,[],[f6]) ).
fof(f10,plain,
( p2
| ~ p1
| ~ p3
| ~ sP0 ),
inference(cnf_transformation,[],[f6]) ).
fof(f11,plain,
( p1
| ~ p2
| ~ p3
| ~ sP0 ),
inference(cnf_transformation,[],[f6]) ).
fof(f12,plain,
( sP0
| p3
| p2
| ~ p1 ),
inference(cnf_transformation,[],[f6]) ).
fof(f13,plain,
( sP0
| p3
| p1
| ~ p2 ),
inference(cnf_transformation,[],[f6]) ).
fof(f14,plain,
( sP0
| ~ p3
| p2
| p1 ),
inference(cnf_transformation,[],[f6]) ).
fof(f15,plain,
( sP0
| ~ p3
| ~ p2
| ~ p1 ),
inference(cnf_transformation,[],[f6]) ).
fof(f16,plain,
( p3
| ~ p2
| ~ p1
| sP0 ),
inference(cnf_transformation,[],[f7]) ).
fof(f17,plain,
( p2
| ~ p3
| ~ p1
| sP0 ),
inference(cnf_transformation,[],[f7]) ).
fof(f18,plain,
( p1
| p3
| p2
| sP0 ),
inference(cnf_transformation,[],[f7]) ).
fof(f19,plain,
( p1
| ~ p3
| ~ p2
| sP0 ),
inference(cnf_transformation,[],[f7]) ).
fof(f20,plain,
( p3
| ~ p2
| p1
| ~ sP0 ),
inference(cnf_transformation,[],[f7]) ).
fof(f21,plain,
( p2
| ~ p3
| p1
| ~ sP0 ),
inference(cnf_transformation,[],[f7]) ).
fof(f22,plain,
( p3
| p2
| ~ p1
| ~ sP0 ),
inference(cnf_transformation,[],[f7]) ).
fof(f23,plain,
( ~ p3
| ~ p2
| ~ p1
| ~ sP0 ),
inference(cnf_transformation,[],[f7]) ).
fof(f24,plain,
( ~ sP0
| ~ p3
| p2
| ~ p1 ),
inference(consistent_polarity_flipping,[],[f15]) ).
fof(f25,plain,
( ~ sP0
| ~ p3
| ~ p2
| p1 ),
inference(consistent_polarity_flipping,[],[f14]) ).
fof(f26,plain,
( ~ sP0
| p3
| p1
| p2 ),
inference(consistent_polarity_flipping,[],[f13]) ).
fof(f27,plain,
( ~ sP0
| p3
| ~ p2
| ~ p1 ),
inference(consistent_polarity_flipping,[],[f12]) ).
fof(f28,plain,
( p1
| p2
| ~ p3
| sP0 ),
inference(consistent_polarity_flipping,[],[f11]) ).
fof(f29,plain,
( ~ p2
| ~ p1
| ~ p3
| sP0 ),
inference(consistent_polarity_flipping,[],[f10]) ).
fof(f30,plain,
( p3
| p2
| ~ p1
| sP0 ),
inference(consistent_polarity_flipping,[],[f9]) ).
fof(f31,plain,
( p3
| ~ p2
| p1
| sP0 ),
inference(consistent_polarity_flipping,[],[f8]) ).
fof(f32,plain,
( ~ p3
| p2
| ~ p1
| sP0 ),
inference(consistent_polarity_flipping,[],[f23]) ).
fof(f33,plain,
( p3
| ~ p2
| ~ p1
| sP0 ),
inference(consistent_polarity_flipping,[],[f22]) ).
fof(f34,plain,
( ~ p2
| ~ p3
| p1
| sP0 ),
inference(consistent_polarity_flipping,[],[f21]) ).
fof(f35,plain,
( p3
| p2
| p1
| sP0 ),
inference(consistent_polarity_flipping,[],[f20]) ).
fof(f36,plain,
( p1
| ~ p3
| p2
| ~ sP0 ),
inference(consistent_polarity_flipping,[],[f19]) ).
fof(f37,plain,
( p1
| p3
| ~ p2
| ~ sP0 ),
inference(consistent_polarity_flipping,[],[f18]) ).
fof(f38,plain,
( ~ p2
| ~ p3
| ~ p1
| ~ sP0 ),
inference(consistent_polarity_flipping,[],[f17]) ).
fof(f39,plain,
( p3
| p2
| ~ p1
| ~ sP0 ),
inference(consistent_polarity_flipping,[],[f16]) ).
fof(f40,plain,
$false,
inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f24,f25,f26,f27,f28,f29,f30,f31,f32,f33,f34,f35,f36,f37,f38,f39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN393+1.003 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.25 % Computer : n018.cluster.edu
% 0.10/0.25 % Model : x86_64 x86_64
% 0.10/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.25 % Memory : 8046.5625MB
% 0.10/0.25 % OS : Linux 6.8.0-71-generic
% 0.10/0.25 % CPULimit : 300
% 0.10/0.25 % WCLimit : 300
% 0.10/0.25 % DateTime : Mon Sep 28 15:56:25 UTC 2026
% 0.10/0.25 % CPUTime :
% 0.10/0.25 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.24/0.31 Running first-order model finding
% 0.24/0.31 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.24/0.34 % (3504182)Will run a generic schedule for satisfiability detection.
% 0.24/0.34 % (3504187)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1140644382_3000 on theBenchmark for (3000ds/0Mi)
% 0.24/0.34 % The problem is propositional so there are no sorts!
% 0.24/0.34 % TRYING []
% 0.24/0.34 % (3504187) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3504182-3504187"...
% 0.24/0.34 % (3504187)...printing done.
% 0.24/0.34 % (3504187)Refutation found. Thanks to Tanya!
% 0.24/0.34 % SZS status Theorem for theBenchmark
% 0.24/0.34 % SZS output start Proof for theBenchmark
% See solution above
% 0.24/0.34 % (3504187)------------------------------
% 0.24/0.34 % (3504187)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.34 % (3504187)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.34 % (3504187)CaDiCaL version: 2.1.3
% 0.24/0.34 % (3504187)Termination reason: Refutation
% 0.24/0.34 % (3504187)Time elapsed: 0.001 s
% 0.24/0.34 % (3504187)Peak memory usage: 11 MB
% 0.24/0.34 % (3504187)Instructions burned: 1 (million)
% 0.24/0.34 % (3504182)Success in time 0.024 s
% 0.24/0.34 % Vampire exiting
%------------------------------------------------------------------------------