%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC049-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 : n004.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:26 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.45s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 18
% Syntax : Number of formulae : 55 ( 13 unt; 6 def)
% Number of atoms : 119 ( 16 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 126 ( 62 ~; 58 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 7 ( 0 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f59,axiom,
! [X0] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause59) ).
fof(f101,axiom,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X1 = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
fof(f102,plain,
! [X0,X1] :
( neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0)
| X0 = X1 ),
inference(reorient_equations,[],[f101]) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
! [X0] :
( ~ ssList(X0)
| ~ neq(X0,nil)
| ~ rearsegP(sk2,X0)
| ~ rearsegP(sk1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk3,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
fof(f210,negated_conjecture,
( ~ neq(sk4,nil)
| rearsegP(sk4,sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f213,plain,
! [X0] :
( ~ neq(X0,nil)
| ~ ssList(X0)
| ~ rearsegP(sk4,X0)
| ~ rearsegP(sk3,X0) ),
inference(definition_unfolding,[],[f206,f204,f205]) ).
fof(f214,plain,
( nil != sk4
| nil != sk3 ),
inference(definition_unfolding,[],[f208,f204,f205]) ).
fof(f246,definition,
( spl0_1
<=> rearsegP(sk4,sk3) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f248,plain,
( rearsegP(sk4,sk3)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f246]) ).
fof(f250,definition,
( spl0_2
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f252,plain,
( ~ neq(sk4,nil)
| spl0_2 ),
inference(avatar_component_clause,[],[f250]) ).
fof(f253,plain,
( spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f210,f250,f246]) ).
fof(f255,definition,
( spl0_3
<=> neq(sk3,nil) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f257,plain,
( neq(sk3,nil)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f255]) ).
fof(f258,plain,
( spl0_3
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f209,f250,f255]) ).
fof(f260,definition,
( spl0_4
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f264,definition,
( spl0_5
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f266,plain,
( nil != sk4
| spl0_5 ),
inference(avatar_component_clause,[],[f264]) ).
fof(f267,plain,
( ~ spl0_4
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f214,f264,f260]) ).
fof(f268,plain,
( ~ spl0_5
| spl0_4 ),
inference(avatar_split_clause,[],[f207,f260,f264]) ).
fof(f274,definition,
( spl0_7
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f275,plain,
( ssList(nil)
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f274]) ).
fof(f310,plain,
spl0_7,
inference(avatar_split_clause,[],[f8,f274]) ).
fof(f499,plain,
( ~ ssList(sk4)
| ~ ssList(nil)
| nil = sk4
| spl0_2 ),
inference(resolution,[],[f102,f252]) ).
fof(f505,plain,
( ~ ssList(nil)
| nil = sk4
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f499,f203]) ).
fof(f506,plain,
( nil = sk4
| spl0_2
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f505,f275]) ).
fof(f507,plain,
( $false
| spl0_2
| spl0_5
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f506,f266]) ).
fof(f508,plain,
( spl0_2
| spl0_5
| ~ spl0_7 ),
inference(avatar_contradiction_clause,[],[f507]) ).
fof(f520,plain,
( ~ ssList(sk3)
| ~ rearsegP(sk4,sk3)
| ~ rearsegP(sk3,sk3)
| ~ spl0_3 ),
inference(resolution,[],[f257,f213]) ).
fof(f521,plain,
( ~ rearsegP(sk4,sk3)
| ~ rearsegP(sk3,sk3)
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f520,f202]) ).
fof(f522,plain,
( ~ rearsegP(sk3,sk3)
| ~ spl0_1
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f521,f248]) ).
fof(f525,plain,
( ~ ssList(sk3)
| ~ spl0_1
| ~ spl0_3 ),
inference(resolution,[],[f522,f59]) ).
fof(f526,plain,
( $false
| ~ spl0_1
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f525,f202]) ).
fof(f527,plain,
( ~ spl0_1
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f526]) ).
cnf(s1,plain,
( spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f253]) ).
cnf(s2,plain,
( ~ spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f258]) ).
cnf(s3,plain,
( ~ spl0_4
| ~ spl0_5 ),
inference(sat_conversion,[],[f267]) ).
cnf(s4,plain,
( spl0_4
| ~ spl0_5 ),
inference(sat_conversion,[],[f268]) ).
cnf(s14,plain,
spl0_7,
inference(sat_conversion,[],[f310]) ).
cnf(s15,plain,
( spl0_2
| spl0_5
| ~ spl0_7 ),
inference(sat_conversion,[],[f508]) ).
cnf(s17,plain,
( ~ spl0_1
| ~ spl0_3 ),
inference(sat_conversion,[],[f527]) ).
cnf(s22,plain,
~ spl0_5,
inference(rat,[],[s3,s4]) ).
cnf(s23,plain,
spl0_2,
inference(rat,[],[s15,s14,s22]) ).
cnf(s24,plain,
spl0_3,
inference(rat,[],[s2,s23]) ).
cnf(s25,plain,
spl0_1,
inference(rat,[],[s1,s23]) ).
cnf(s26,plain,
$false,
inference(rat,[],[s17,s24,s25]) ).
fof(f528,plain,
$false,
inference(avatar_sat_refutation,[],[s26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC049-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.10/0.37 % Computer : n004.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 07:36:37 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 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.10/0.45 % (183932)Will run a generic schedule for satisfiability detection.
% 0.10/0.45 % (183940)dis+10_1_sil=32000:sp=arity:random_seed=3897121434:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.45 % (183938)% WARNING: option uhcvi not known.
% 0.10/0.45 % (183940) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-183932-183940"...
% 0.10/0.45 % (183940)...printing done.
% 0.10/0.45 % (183940)Refutation found. Thanks to Tanya!
% 0.10/0.45 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.45 % (183940)------------------------------
% 0.10/0.45 % (183940)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.45 % (183940)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.45 % (183940)CaDiCaL version: 2.1.3
% 0.10/0.45 % (183940)Termination reason: Refutation
% 0.10/0.45 % (183940)Time elapsed: 0.005 s
% 0.10/0.45 % (183940)Peak memory usage: 12 MB
% 0.10/0.45 % (183940)Instructions burned: 13 (million)
% 0.10/0.45 % (183932)Success in time 0.036 s
% 0.10/0.45 % Vampire exiting
%------------------------------------------------------------------------------