%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC360+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n006.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:05:42 PM UTC 2026
% Result : Theorem 0.08s 0.25s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 6 unt; 0 def)
% Number of atoms : 66 ( 10 equ)
% Maximal formula atoms : 15 ( 6 avg)
% Number of connectives : 81 ( 25 ~; 20 |; 28 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 8 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 20 ( 10 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| ~ segmentP(X3,X2)
| ~ totalorderedP(X2)
| ? [X4] :
( ssList(X4)
& neq(X2,X4)
& segmentP(X3,X4)
& segmentP(X4,X2)
& totalorderedP(X4) )
| segmentP(X1,X0) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| ~ segmentP(X3,X2)
| ~ totalorderedP(X2)
| ? [X4] :
( ssList(X4)
& neq(X2,X4)
& segmentP(X3,X4)
& segmentP(X4,X2)
& totalorderedP(X4) )
| segmentP(X1,X0) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& segmentP(X3,X2)
& totalorderedP(X2)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X2,X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2)
| ~ totalorderedP(X4) )
& ~ segmentP(X1,X0)
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& segmentP(X3,X2)
& totalorderedP(X2)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X2,X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2)
| ~ totalorderedP(X4) )
& ~ segmentP(X1,X0)
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f413,plain,
~ segmentP(sK48,sK47),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
segmentP(sK50,sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f425,plain,
~ segmentP(sK50,sK49),
inference(definition_unfolding,[],[f413,f418,f417]) ).
fof(f458,plain,
$false,
inference(forward_subsumption_resolution,[],[f415,f425]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC360+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.17 % Computer : n006.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 09:16:25 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.21 Running first-order model finding
% 0.08/0.21 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.25 % (3833522)Will run a generic schedule for satisfiability detection.
% 0.08/0.25 % (3833531)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=89912450:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.25 % (3833528)% WARNING: option uhcvi not known.
% 0.08/0.25 % (3833531) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3833522-3833531"...
% 0.08/0.25 % (3833531)...printing done.
% 0.08/0.25 % (3833531)Refutation found. Thanks to Tanya!
% 0.08/0.25 % SZS status Theorem for theBenchmark
% 0.08/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.25 % (3833531)------------------------------
% 0.08/0.25 % (3833531)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.25 % (3833531)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.25 % (3833531)CaDiCaL version: 2.1.3
% 0.08/0.25 % (3833531)Termination reason: Refutation
% 0.08/0.25 % (3833531)Time elapsed: 0.004 s
% 0.08/0.25 % (3833531)Peak memory usage: 12 MB
% 0.08/0.25 % (3833531)Instructions burned: 11 (million)
% 0.08/0.25 % (3833522)Success in time 0.033 s
% 0.08/0.25 % Vampire exiting
%------------------------------------------------------------------------------