%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC252-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 : n013.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:16 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.24s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 15
% Syntax : Number of formulae : 56 ( 15 unt; 4 def)
% Number of atoms : 171 ( 31 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 228 ( 113 ~; 111 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 33 ( 0 sgn 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f71,axiom,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
fof(f73,axiom,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
fof(f74,axiom,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk1
| ssItem(sk5(X2,X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f208,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk1 != app(app(X1,cons(X0,nil)),X2)
| ssItem(sk5(X2,X1,X0)) ),
inference(reorient_equations,[],[f207]) ).
fof(f209,negated_conjecture,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk1
| memberP(X1,sk5(X2,X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f210,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk1 != app(app(X1,cons(X0,nil)),X2)
| memberP(X1,sk5(X2,X1,X0)) ),
inference(reorient_equations,[],[f209]) ).
fof(f218,negated_conjecture,
( ssItem(sk6)
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
fof(f222,negated_conjecture,
( cons(sk6,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
fof(f223,plain,
( sk3 = cons(sk6,nil)
| nil = sk3 ),
inference(reorient_equations,[],[f222]) ).
fof(f227,plain,
nil != sk3,
inference(definition_unfolding,[],[f206,f205]) ).
fof(f228,plain,
! [X2,X0,X1] :
( sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X0)
| ssItem(sk5(X2,X1,X0)) ),
inference(definition_unfolding,[],[f208,f205]) ).
fof(f229,plain,
! [X2,X0,X1] :
( sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X0)
| memberP(X1,sk5(X2,X1,X0)) ),
inference(definition_unfolding,[],[f210,f205]) ).
fof(f264,definition,
( spl0_1
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f273,definition,
( spl0_3
<=> sk3 = cons(sk6,nil) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f275,plain,
( sk3 = cons(sk6,nil)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f273]) ).
fof(f276,plain,
( spl0_1
| spl0_3 ),
inference(avatar_split_clause,[],[f223,f273,f264]) ).
fof(f284,definition,
( spl0_5
<=> ssItem(sk6) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f286,plain,
( ssItem(sk6)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f284]) ).
fof(f287,plain,
( spl0_1
| spl0_5 ),
inference(avatar_split_clause,[],[f218,f284,f264]) ).
fof(f289,plain,
~ spl0_1,
inference(avatar_split_clause,[],[f227,f264]) ).
fof(f295,definition,
( spl0_7
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f296,plain,
( ssList(nil)
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f295]) ).
fof(f331,plain,
spl0_7,
inference(avatar_split_clause,[],[f8,f295]) ).
fof(f332,plain,
( ! [X0,X1] :
( sk3 != app(app(X0,sk3),X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssItem(sk6)
| ssItem(sk5(X1,X0,sk6)) )
| ~ spl0_3 ),
inference(superposition,[],[f228,f275]) ).
fof(f333,plain,
( ! [X0,X1] :
( sk3 != app(app(X0,sk3),X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ssItem(sk5(X1,X0,sk6)) )
| ~ spl0_3
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f332,f286]) ).
fof(f389,plain,
sk3 = app(sk3,nil),
inference(resolution,[],[f73,f202]) ).
fof(f419,plain,
sk3 = app(nil,sk3),
inference(resolution,[],[f74,f202]) ).
fof(f427,plain,
( ! [X0] :
( sk3 != app(sk3,X0)
| ~ ssList(nil)
| ~ ssList(X0)
| ssItem(sk5(X0,nil,sk6)) )
| ~ spl0_3
| ~ spl0_5 ),
inference(superposition,[],[f333,f419]) ).
fof(f437,plain,
( ! [X0] :
( sk3 != app(sk3,X0)
| ~ ssList(X0)
| ssItem(sk5(X0,nil,sk6)) )
| ~ spl0_3
| ~ spl0_5
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f427,f296]) ).
fof(f438,plain,
( ! [X0,X1] :
( sk3 != app(app(X0,sk3),X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssItem(sk6)
| memberP(X0,sk5(X1,X0,sk6)) )
| ~ spl0_3 ),
inference(superposition,[],[f229,f275]) ).
fof(f439,plain,
( ! [X0,X1] :
( sk3 != app(app(X0,sk3),X1)
| ~ ssList(X0)
| ~ ssList(X1)
| memberP(X0,sk5(X1,X0,sk6)) )
| ~ spl0_3
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f438,f286]) ).
fof(f440,plain,
( sk3 != sk3
| ~ ssList(nil)
| ssItem(sk5(nil,nil,sk6))
| ~ spl0_3
| ~ spl0_5
| ~ spl0_7 ),
inference(superposition,[],[f437,f389]) ).
fof(f441,plain,
( ~ ssList(nil)
| ssItem(sk5(nil,nil,sk6))
| ~ spl0_3
| ~ spl0_5
| ~ spl0_7 ),
inference(trivial_inequality_removal,[],[f440]) ).
fof(f442,plain,
( ssItem(sk5(nil,nil,sk6))
| ~ spl0_3
| ~ spl0_5
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f441,f296]) ).
fof(f447,plain,
( ! [X0] :
( sk3 != app(sk3,X0)
| ~ ssList(nil)
| ~ ssList(X0)
| memberP(nil,sk5(X0,nil,sk6)) )
| ~ spl0_3
| ~ spl0_5 ),
inference(superposition,[],[f439,f419]) ).
fof(f448,plain,
( ! [X0] :
( sk3 != app(sk3,X0)
| ~ ssList(X0)
| memberP(nil,sk5(X0,nil,sk6)) )
| ~ spl0_3
| ~ spl0_5
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f447,f296]) ).
fof(f451,plain,
( sk3 != sk3
| ~ ssList(nil)
| memberP(nil,sk5(nil,nil,sk6))
| ~ spl0_3
| ~ spl0_5
| ~ spl0_7 ),
inference(superposition,[],[f448,f389]) ).
fof(f452,plain,
( ~ ssList(nil)
| memberP(nil,sk5(nil,nil,sk6))
| ~ spl0_3
| ~ spl0_5
| ~ spl0_7 ),
inference(trivial_inequality_removal,[],[f451]) ).
fof(f453,plain,
( memberP(nil,sk5(nil,nil,sk6))
| ~ spl0_3
| ~ spl0_5
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f452,f296]) ).
fof(f499,plain,
( ~ ssItem(sk5(nil,nil,sk6))
| ~ spl0_3
| ~ spl0_5
| ~ spl0_7 ),
inference(resolution,[],[f71,f453]) ).
fof(f500,plain,
( $false
| ~ spl0_3
| ~ spl0_5
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f499,f442]) ).
fof(f501,plain,
( ~ spl0_3
| ~ spl0_5
| ~ spl0_7 ),
inference(avatar_contradiction_clause,[],[f500]) ).
cnf(s2,plain,
( spl0_1
| spl0_3 ),
inference(sat_conversion,[],[f276]) ).
cnf(s5,plain,
( spl0_1
| spl0_5 ),
inference(sat_conversion,[],[f287]) ).
cnf(s7,plain,
~ spl0_1,
inference(sat_conversion,[],[f289]) ).
cnf(s17,plain,
spl0_7,
inference(sat_conversion,[],[f331]) ).
cnf(s19,plain,
( ~ spl0_3
| ~ spl0_5
| ~ spl0_7 ),
inference(sat_conversion,[],[f501]) ).
cnf(s24,plain,
spl0_5,
inference(rat,[],[s5,s7]) ).
cnf(s25,plain,
~ spl0_3,
inference(rat,[],[s19,s17,s24]) ).
cnf(s27,plain,
$false,
inference(rat,[],[s2,s25,s7]) ).
fof(f502,plain,
$false,
inference(avatar_sat_refutation,[],[s27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC252-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.17 % Computer : n013.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Mon Sep 28 08:41:51 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.20 Running first-order model finding
% 0.10/0.20 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.24 % (1029560)Will run a generic schedule for satisfiability detection.
% 0.10/0.24 % (1029568)dis+10_1_sil=32000:sp=arity:random_seed=1603487830:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.24 % (1029568) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1029560-1029568"...
% 0.10/0.24 % (1029566)% WARNING: option uhcvi not known.
% 0.10/0.24 % (1029568)...printing done.
% 0.10/0.24 % (1029568)Refutation found. Thanks to Tanya!
% 0.10/0.24 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.24 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.24 % (1029568)------------------------------
% 0.10/0.24 % (1029568)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.24 % (1029568)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.24 % (1029568)CaDiCaL version: 2.1.3
% 0.10/0.24 % (1029568)Termination reason: Refutation
% 0.10/0.24 % (1029568)Time elapsed: 0.005 s
% 0.10/0.24 % (1029568)Peak memory usage: 12 MB
% 0.10/0.24 % (1029568)Instructions burned: 14 (million)
% 0.10/0.24 % (1029560)Success in time 0.033 s
% 0.10/0.24 % Vampire exiting
%------------------------------------------------------------------------------