%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC012-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 : n017.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:17 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.45s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 15
% Syntax : Number of formulae : 50 ( 17 unt; 5 def)
% Number of atoms : 133 ( 28 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 173 ( 90 ~; 78 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f73,axiom,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
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,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f213,negated_conjecture,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk2
| app(X1,X2) != sk1
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
fof(f214,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk2 != app(app(X1,cons(X0,nil)),X2)
| app(X1,X2) != sk1
| ~ neq(sk4,nil) ),
inference(reorient_equations,[],[f213]) ).
fof(f215,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
fof(f216,negated_conjecture,
( app(sk3,cons(sk5,nil)) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
fof(f217,plain,
( sk4 = app(sk3,cons(sk5,nil))
| ~ neq(sk4,nil) ),
inference(reorient_equations,[],[f216]) ).
fof(f220,plain,
( neq(sk4,nil)
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f206,f204,f204]) ).
fof(f225,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk4 != app(app(X1,cons(X0,nil)),X2)
| app(X1,X2) != sk3
| ~ neq(sk4,nil) ),
inference(definition_unfolding,[],[f214,f204,f205]) ).
fof(f250,plain,
neq(sk4,nil),
inference(duplicate_literal_removal,[],[f220]) ).
fof(f258,definition,
( spl0_1
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f262,definition,
( spl0_2
<=> sk4 = app(sk3,cons(sk5,nil)) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f264,plain,
( sk4 = app(sk3,cons(sk5,nil))
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f262]) ).
fof(f265,plain,
( ~ spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f217,f262,f258]) ).
fof(f267,definition,
( spl0_3
<=> ssItem(sk5) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f269,plain,
( ssItem(sk5)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f267]) ).
fof(f270,plain,
( ~ spl0_1
| spl0_3 ),
inference(avatar_split_clause,[],[f215,f267,f258]) ).
fof(f272,definition,
( spl0_4
<=> ! [X2,X0,X1] :
( ~ ssItem(X0)
| app(X1,X2) != sk3
| sk4 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X2)
| ~ ssList(X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f273,plain,
( ! [X2,X0,X1] :
( sk4 != app(app(X1,cons(X0,nil)),X2)
| app(X1,X2) != sk3
| ~ ssItem(X0)
| ~ ssList(X2)
| ~ ssList(X1) )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f272]) ).
fof(f274,plain,
( ~ spl0_1
| spl0_4 ),
inference(avatar_split_clause,[],[f225,f272,f258]) ).
fof(f278,plain,
spl0_1,
inference(avatar_split_clause,[],[f250,f258]) ).
fof(f284,definition,
( spl0_6
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f285,plain,
( ssList(nil)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f284]) ).
fof(f320,plain,
spl0_6,
inference(avatar_split_clause,[],[f8,f284]) ).
fof(f321,plain,
( ! [X0] :
( sk4 != app(sk4,X0)
| sk3 != app(sk3,X0)
| ~ ssItem(sk5)
| ~ ssList(X0)
| ~ ssList(sk3) )
| ~ spl0_2
| ~ spl0_4 ),
inference(superposition,[],[f273,f264]) ).
fof(f322,plain,
( ! [X0] :
( sk4 != app(sk4,X0)
| sk3 != app(sk3,X0)
| ~ ssList(X0)
| ~ ssList(sk3) )
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f321,f269]) ).
fof(f323,plain,
( ! [X0] :
( sk4 != app(sk4,X0)
| sk3 != app(sk3,X0)
| ~ ssList(X0) )
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f322,f202]) ).
fof(f382,plain,
sk3 = app(sk3,nil),
inference(resolution,[],[f73,f202]) ).
fof(f383,plain,
sk4 = app(sk4,nil),
inference(resolution,[],[f73,f203]) ).
fof(f414,plain,
( sk4 != sk4
| sk3 != app(sk3,nil)
| ~ ssList(nil)
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4 ),
inference(superposition,[],[f323,f383]) ).
fof(f415,plain,
( sk3 != app(sk3,nil)
| ~ ssList(nil)
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4 ),
inference(trivial_inequality_removal,[],[f414]) ).
fof(f416,plain,
( ~ ssList(nil)
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f415,f382]) ).
fof(f417,plain,
( $false
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f416,f285]) ).
fof(f418,plain,
( ~ spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_6 ),
inference(avatar_contradiction_clause,[],[f417]) ).
cnf(s1,plain,
( ~ spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f265]) ).
cnf(s2,plain,
( ~ spl0_1
| spl0_3 ),
inference(sat_conversion,[],[f270]) ).
cnf(s3,plain,
( ~ spl0_1
| spl0_4 ),
inference(sat_conversion,[],[f274]) ).
cnf(s7,plain,
spl0_1,
inference(sat_conversion,[],[f278]) ).
cnf(s17,plain,
spl0_6,
inference(sat_conversion,[],[f320]) ).
cnf(s18,plain,
( ~ spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_6 ),
inference(sat_conversion,[],[f418]) ).
cnf(s23,plain,
spl0_4,
inference(rat,[],[s3,s7]) ).
cnf(s24,plain,
spl0_3,
inference(rat,[],[s2,s7]) ).
cnf(s25,plain,
~ spl0_2,
inference(rat,[],[s18,s17,s23,s24]) ).
cnf(s26,plain,
$false,
inference(rat,[],[s1,s25,s7]) ).
fof(f419,plain,
$false,
inference(avatar_sat_refutation,[],[s26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC012-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 : n017.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:21:06 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 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 % (3373020)Will run a generic schedule for satisfiability detection.
% 0.10/0.45 % (3373028)dis+10_1_sil=32000:sp=arity:random_seed=290477614:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.45 % (3373026)% WARNING: option uhcvi not known.
% 0.10/0.45 % (3373028) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3373020-3373028"...
% 0.10/0.45 % (3373028)...printing done.
% 0.10/0.45 % (3373028)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 % (3373028)------------------------------
% 0.10/0.45 % (3373028)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.45 % (3373028)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.45 % (3373028)CaDiCaL version: 2.1.3
% 0.10/0.45 % (3373028)Termination reason: Refutation
% 0.10/0.45 % (3373028)Time elapsed: 0.004 s
% 0.10/0.45 % (3373028)Peak memory usage: 12 MB
% 0.10/0.45 % (3373028)Instructions burned: 9 (million)
% 0.10/0.45 % (3373020)Success in time 0.035 s
% 0.10/0.45 % Vampire exiting
%------------------------------------------------------------------------------