%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC047-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 : n001.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.18s 0.49s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 40 ( 11 unt; 3 def)
% Number of atoms : 93 ( 16 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 107 ( 54 ~; 50 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 9 ( 0 sgn 9 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f59,axiom,
! [X0] :
( ~ ssList(X0)
| rearsegP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause59) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
sk4 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f207,plain,
sk3 = sk4,
inference(reorient_equations,[],[f206]) ).
fof(f208,negated_conjecture,
( nil = sk2
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f209,negated_conjecture,
! [X0] :
( nil = sk2
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ rearsegP(sk2,X0)
| ~ rearsegP(sk1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f210,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f211,negated_conjecture,
! [X0] :
( nil != sk1
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ rearsegP(sk2,X0)
| ~ rearsegP(sk1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f212,plain,
sk1 = sk4,
inference(definition_unfolding,[],[f205,f207]) ).
fof(f216,plain,
( nil = sk4
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f208,f204,f204]) ).
fof(f217,plain,
! [X0] :
( nil = sk4
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ rearsegP(sk4,X0)
| ~ rearsegP(sk4,X0) ),
inference(definition_unfolding,[],[f209,f204,f204,f212]) ).
fof(f218,plain,
( nil != sk4
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f210,f212,f204]) ).
fof(f219,plain,
! [X0] :
( nil != sk4
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ rearsegP(sk4,X0)
| ~ rearsegP(sk4,X0) ),
inference(definition_unfolding,[],[f211,f212,f204,f212]) ).
fof(f244,plain,
! [X0] :
( nil != sk4
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ rearsegP(sk4,X0) ),
inference(duplicate_literal_removal,[],[f219]) ).
fof(f245,plain,
! [X0] :
( nil = sk4
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ rearsegP(sk4,X0) ),
inference(duplicate_literal_removal,[],[f217]) ).
fof(f253,definition,
( spl0_1
<=> ! [X0] :
( ~ ssList(X0)
| ~ rearsegP(sk4,X0)
| ~ neq(X0,nil) ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f254,plain,
( ! [X0] :
( ~ neq(X0,nil)
| ~ rearsegP(sk4,X0)
| ~ ssList(X0) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f253]) ).
fof(f256,definition,
( spl0_2
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f259,plain,
( spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f244,f256,f253]) ).
fof(f261,definition,
( spl0_3
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f263,plain,
( neq(sk4,nil)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f261]) ).
fof(f264,plain,
( spl0_3
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f218,f256,f261]) ).
fof(f265,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f245,f256,f253]) ).
fof(f266,plain,
( spl0_3
| spl0_2 ),
inference(avatar_split_clause,[],[f216,f256,f261]) ).
fof(f309,plain,
( ~ rearsegP(sk4,sk4)
| ~ ssList(sk4)
| ~ spl0_1
| ~ spl0_3 ),
inference(resolution,[],[f254,f263]) ).
fof(f310,plain,
( ~ ssList(sk4)
| ~ spl0_1
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f309,f59]) ).
fof(f311,plain,
( $false
| ~ spl0_1
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f310,f203]) ).
fof(f312,plain,
( ~ spl0_1
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f311]) ).
cnf(s1,plain,
( spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f259]) ).
cnf(s2,plain,
( ~ spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f264]) ).
cnf(s3,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f265]) ).
cnf(s4,plain,
( spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f266]) ).
cnf(s15,plain,
( ~ spl0_1
| ~ spl0_3 ),
inference(sat_conversion,[],[f312]) ).
cnf(s20,plain,
spl0_1,
inference(rat,[],[s1,s3]) ).
cnf(s21,plain,
~ spl0_3,
inference(rat,[],[s15,s20]) ).
cnf(s22,plain,
spl0_2,
inference(rat,[],[s4,s21]) ).
cnf(s23,plain,
$false,
inference(rat,[],[s2,s21,s22]) ).
fof(f313,plain,
$false,
inference(avatar_sat_refutation,[],[s23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC047-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.10/0.40 % Computer : n001.cluster.edu
% 0.10/0.40 % Model : x86_64 x86_64
% 0.10/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.40 % Memory : 8046.5625MB
% 0.10/0.40 % OS : Linux 6.8.0-71-generic
% 0.10/0.40 % CPULimit : 300
% 0.10/0.40 % WCLimit : 300
% 0.10/0.40 % DateTime : Mon Sep 28 07:42:18 UTC 2026
% 0.10/0.40 % CPUTime :
% 0.10/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.43 Running first-order model finding
% 0.10/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.18/0.49 % (191554)Will run a generic schedule for satisfiability detection.
% 0.18/0.49 % (191563)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1982643583:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.49 % (191560)% WARNING: option uhcvi not known.
% 0.18/0.49 % (191563) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-191554-191563"...
% 0.18/0.49 % (191563)...printing done.
% 0.18/0.49 % (191563)Refutation found. Thanks to Tanya!
% 0.18/0.49 % SZS status Unsatisfiable for theBenchmark
% 0.18/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.49 % (191563)------------------------------
% 0.18/0.49 % (191563)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.49 % (191563)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.49 % (191563)CaDiCaL version: 2.1.3
% 0.18/0.49 % (191563)Termination reason: Refutation
% 0.18/0.49 % (191563)Time elapsed: 0.004 s
% 0.18/0.49 % (191563)Peak memory usage: 12 MB
% 0.18/0.49 % (191563)Instructions burned: 11 (million)
% 0.18/0.49 % (191554)Success in time 0.045 s
% 0.18/0.49 % Vampire exiting
%------------------------------------------------------------------------------