%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN933+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n011.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:22:53 PM UTC 2026
% Result : Theorem 0.08s 0.24s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 3 unt; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 16 ( 7 ~; 4 |; 1 &)
% ( 3 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 2 ( 1 usr; 2 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 2 ( 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X0] : c
<=> c ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ( ! [X0] : c
<=> c ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ( c
<=> c ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( c
<~> c ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ( ~ c
| ~ c )
& ( c
| c ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f6,plain,
( c
| c ),
inference(cnf_transformation,[],[f5]) ).
fof(f7,plain,
( ~ c
| ~ c ),
inference(cnf_transformation,[],[f5]) ).
fof(f8,plain,
c,
inference(duplicate_literal_removal,[],[f6]) ).
fof(f9,plain,
~ c,
inference(duplicate_literal_removal,[],[f7]) ).
fof(f10,plain,
$false,
inference(forward_subsumption_resolution,[],[f9,f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN933+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.17 % Computer : n011.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Mon Sep 28 17:13:46 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20 Running first-order model finding
% 0.08/0.20 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.24 % (3537340)Will run a generic schedule for satisfiability detection.
% 0.08/0.24 % (3537350)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3636333128:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.24 % (3537350) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3537340-3537350"...
% 0.08/0.24 % (3537350)...printing done.
% 0.08/0.24 % (3537350)Refutation found. Thanks to Tanya!
% 0.08/0.24 % SZS status Theorem for theBenchmark
% 0.08/0.24 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.24 % (3537350)------------------------------
% 0.08/0.24 % (3537350)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.24 % (3537350)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.24 % (3537350)CaDiCaL version: 2.1.3
% 0.08/0.24 % (3537350)Termination reason: Refutation
% 0.08/0.24 % (3537350)Time elapsed: 0.0000 s
% 0.08/0.24 % (3537350)Peak memory usage: 11 MB
% 0.08/0.24 % (3537340)Success in time 0.026 s
% 0.08/0.24 % Vampire exiting
%------------------------------------------------------------------------------