%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC035+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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 01:04:23 PM UTC 2026
% Result : Theorem 0.16s 0.47s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 9 unt; 0 def)
% Number of atoms : 54 ( 33 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 54 ( 14 ~; 8 |; 24 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 16 ( 8 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil != X1
| X1 != X3
| X0 != X2
| X3 != X2
| nil = X0 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil != X1
| X1 != X3
| X0 != X2
| X3 != X2
| nil = X0 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil = X1
& X1 = X3
& X0 = X2
& X2 = X3
& nil != X0
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil = X1
& X1 = X3
& X0 = X2
& X2 = X3
& nil != X0
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f296,plain,
( nil = sK54
& sK54 = sK56
& sK53 = sK55
& sK55 = sK56
& nil != sK53
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[f222]) ).
fof(f500,plain,
nil != sK53,
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
sK55 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
nil = sK54,
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
nil = sK56,
inference(definition_unfolding,[],[f504,f503]) ).
fof(f506,plain,
sK53 = sK56,
inference(definition_unfolding,[],[f502,f501]) ).
fof(f565,plain,
sK56 != sK56,
inference(definition_unfolding,[],[f500,f505,f506]) ).
fof(f596,plain,
$false,
inference(trivial_inequality_removal,[],[f565]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC035+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39 % Computer : n008.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Mon Sep 28 07:33:55 UTC 2026
% 0.11/0.40 % CPUTime :
% 0.11/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.43 Running first-order model finding
% 0.11/0.43 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.16/0.47 % (2080072)Will run a generic schedule for satisfiability detection.
% 0.16/0.47 % (2080080)dis+10_1_sil=32000:sp=arity:random_seed=3666004249:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.47 % (2080080) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2080072-2080080"...
% 0.16/0.47 % (2080078)% WARNING: option uhcvi not known.
% 0.16/0.47 % (2080080)...printing done.
% 0.16/0.47 % (2080080)Refutation found. Thanks to Tanya!
% 0.16/0.47 % SZS status Theorem for theBenchmark
% 0.16/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.47 % (2080080)------------------------------
% 0.16/0.47 % (2080080)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.47 % (2080080)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.47 % (2080080)CaDiCaL version: 2.1.3
% 0.16/0.47 % (2080080)Termination reason: Refutation
% 0.16/0.47 % (2080080)Time elapsed: 0.003 s
% 0.16/0.47 % (2080080)Peak memory usage: 11 MB
% 0.16/0.47 % (2080080)Instructions burned: 7 (million)
% 0.16/0.47 % (2080072)Success in time 0.033 s
% 0.16/0.47 % Vampire exiting
%------------------------------------------------------------------------------