%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC112-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 : n007.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:43 PM UTC 2026
% Result : Unsatisfiable 0.17s 0.51s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 25
% Syntax : Number of formulae : 103 ( 29 unt; 8 def)
% Number of atoms : 248 ( 45 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 244 ( 99 ~; 137 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 9 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f85,axiom,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
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] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X0 = X1 ),
inference(reorient_equations,[],[f101]) ).
fof(f118,axiom,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).
fof(f121,axiom,
! [X0,X1] :
( app(X0,X1) != nil
| ~ ssList(X1)
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
fof(f122,plain,
! [X0,X1] :
( nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| nil = X0 ),
inference(reorient_equations,[],[f121]) ).
fof(f123,axiom,
! [X0,X1] :
( app(X0,X1) != nil
| ~ ssList(X1)
| ~ ssList(X0)
| nil = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).
fof(f124,plain,
! [X0,X1] :
( nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| nil = X1 ),
inference(reorient_equations,[],[f123]) ).
fof(f187,axiom,
! [X2,X3,X0,X1] :
( app(app(X0,X1),X2) != X3
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X3)
| segmentP(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
fof(f200,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
fof(f201,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
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,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
app(app(sk5,sk3),sk6) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f209,plain,
sk4 = app(app(sk5,sk3),sk6),
inference(reorient_equations,[],[f208]) ).
fof(f215,negated_conjecture,
( nil = sk4
| nil != sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
fof(f217,negated_conjecture,
( nil = sk2
| ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
fof(f218,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
fof(f220,plain,
ssList(sk3),
inference(definition_unfolding,[],[f200,f205]) ).
fof(f221,plain,
ssList(sk4),
inference(definition_unfolding,[],[f201,f204]) ).
fof(f223,plain,
( nil = sk4
| ~ neq(sk3,nil)
| ~ segmentP(sk4,sk3) ),
inference(definition_unfolding,[],[f217,f204,f205,f204,f205]) ).
fof(f224,plain,
( nil != sk3
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f218,f205,f204]) ).
fof(f232,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f118]) ).
fof(f240,plain,
! [X2,X0,X1] :
( ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(app(app(X0,X1),X2))
| segmentP(app(app(X0,X1),X2),X1) ),
inference(equality_resolution,[],[f187]) ).
fof(f255,plain,
~ ssList(nil),
inference(consistent_polarity_flipping,[],[f8]) ).
fof(f331,plain,
! [X0,X1] :
( ~ ssList(app(X1,X0))
| ssList(X1)
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f85]) ).
fof(f346,plain,
! [X0,X1] :
( neq(X1,X0)
| ssList(X1)
| ssList(X0)
| X0 = X1 ),
inference(consistent_polarity_flipping,[],[f102]) ).
fof(f361,plain,
! [X1] :
( ~ neq(X1,X1)
| ssList(X1)
| ssList(X1) ),
inference(consistent_polarity_flipping,[],[f232]) ).
fof(f364,plain,
! [X0,X1] :
( nil != app(X0,X1)
| ssList(X1)
| ssList(X0)
| nil = X0 ),
inference(consistent_polarity_flipping,[],[f122]) ).
fof(f365,plain,
! [X0,X1] :
( nil != app(X0,X1)
| ssList(X1)
| ssList(X0)
| nil = X1 ),
inference(consistent_polarity_flipping,[],[f124]) ).
fof(f419,plain,
! [X2,X0,X1] :
( segmentP(app(app(X0,X1),X2),X1)
| ssList(X0)
| ssList(X1)
| ssList(app(app(X0,X1),X2))
| ssList(X2) ),
inference(consistent_polarity_flipping,[],[f240]) ).
fof(f432,plain,
~ ssList(sk3),
inference(consistent_polarity_flipping,[],[f220]) ).
fof(f433,plain,
~ ssList(sk4),
inference(consistent_polarity_flipping,[],[f221]) ).
fof(f436,plain,
~ ssList(sk5),
inference(consistent_polarity_flipping,[],[f206]) ).
fof(f437,plain,
~ ssList(sk6),
inference(consistent_polarity_flipping,[],[f207]) ).
fof(f445,plain,
! [X1] :
( ~ neq(X1,X1)
| ssList(X1) ),
inference(duplicate_literal_removal,[],[f361]) ).
fof(f448,definition,
( spl0_1
<=> segmentP(sk4,sk3) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f452,definition,
( spl0_2
<=> neq(sk3,nil) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f454,plain,
( ~ neq(sk3,nil)
| spl0_2 ),
inference(avatar_component_clause,[],[f452]) ).
fof(f456,definition,
( spl0_3
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f461,definition,
( spl0_4
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f463,plain,
( neq(sk4,nil)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f461]) ).
fof(f464,plain,
( spl0_4
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f224,f456,f461]) ).
fof(f466,definition,
( spl0_5
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f468,plain,
( nil = sk4
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f466]) ).
fof(f469,plain,
( ~ spl0_1
| ~ spl0_2
| spl0_5 ),
inference(avatar_split_clause,[],[f223,f466,f452,f448]) ).
fof(f471,plain,
( ~ spl0_3
| spl0_5 ),
inference(avatar_split_clause,[],[f215,f466,f456]) ).
fof(f477,definition,
( spl0_7
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f478,plain,
( ~ ssList(nil)
| spl0_7 ),
inference(avatar_component_clause,[],[f477]) ).
fof(f513,plain,
~ spl0_7,
inference(avatar_split_clause,[],[f255,f477]) ).
fof(f794,plain,
( neq(nil,nil)
| ~ spl0_4
| ~ spl0_5 ),
inference(superposition,[],[f463,f468]) ).
fof(f862,plain,
( nil != sk4
| ssList(sk6)
| ssList(app(sk5,sk3))
| nil = app(sk5,sk3) ),
inference(superposition,[],[f364,f209]) ).
fof(f867,plain,
( ssList(sk6)
| ssList(app(sk5,sk3))
| nil = app(sk5,sk3)
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f862,f468]) ).
fof(f868,plain,
( ssList(app(sk5,sk3))
| nil = app(sk5,sk3)
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f867,f437]) ).
fof(f891,definition,
( spl0_21
<=> nil = app(sk5,sk3) ),
introduced(definition,[new_symbols(definition,[spl0_21])],[avatar_definition]) ).
fof(f893,plain,
( nil = app(sk5,sk3)
| ~ spl0_21 ),
inference(avatar_component_clause,[],[f891]) ).
fof(f895,definition,
( spl0_22
<=> ssList(app(sk5,sk3)) ),
introduced(definition,[new_symbols(definition,[spl0_22])],[avatar_definition]) ).
fof(f896,plain,
( ~ ssList(app(sk5,sk3))
| spl0_22 ),
inference(avatar_component_clause,[],[f895]) ).
fof(f897,plain,
( ssList(app(sk5,sk3))
| ~ spl0_22 ),
inference(avatar_component_clause,[],[f895]) ).
fof(f901,plain,
( ssList(sk5)
| ssList(sk3)
| ~ spl0_22 ),
inference(resolution,[],[f897,f331]) ).
fof(f902,plain,
( ssList(sk3)
| ~ spl0_22 ),
inference(forward_subsumption_resolution,[],[f901,f436]) ).
fof(f903,plain,
( $false
| ~ spl0_22 ),
inference(forward_subsumption_resolution,[],[f902,f432]) ).
fof(f904,plain,
~ spl0_22,
inference(avatar_contradiction_clause,[],[f903]) ).
fof(f979,plain,
( nil != nil
| ssList(sk3)
| ssList(sk5)
| nil = sk3
| ~ spl0_21 ),
inference(superposition,[],[f365,f893]) ).
fof(f983,plain,
( ssList(sk3)
| ssList(sk5)
| nil = sk3
| ~ spl0_21 ),
inference(trivial_inequality_removal,[],[f979]) ).
fof(f985,plain,
( ssList(sk5)
| nil = sk3
| ~ spl0_21 ),
inference(forward_subsumption_resolution,[],[f983,f432]) ).
fof(f987,plain,
( nil = sk3
| ~ spl0_21 ),
inference(forward_subsumption_resolution,[],[f985,f436]) ).
fof(f3035,plain,
( segmentP(sk4,sk3)
| ssList(sk5)
| ssList(sk3)
| ssList(sk4)
| ssList(sk6) ),
inference(superposition,[],[f419,f209]) ).
fof(f3063,plain,
( segmentP(sk4,sk3)
| ssList(sk3)
| ssList(sk4)
| ssList(sk6) ),
inference(forward_subsumption_resolution,[],[f3035,f436]) ).
fof(f3064,plain,
( segmentP(sk4,sk3)
| ssList(sk4)
| ssList(sk6) ),
inference(forward_subsumption_resolution,[],[f3063,f432]) ).
fof(f3065,plain,
( segmentP(sk4,sk3)
| ssList(sk6) ),
inference(forward_subsumption_resolution,[],[f3064,f433]) ).
fof(f3066,plain,
segmentP(sk4,sk3),
inference(forward_subsumption_resolution,[],[f3065,f437]) ).
fof(f3067,plain,
spl0_1,
inference(avatar_split_clause,[],[f3066,f448]) ).
fof(f3090,plain,
( ssList(sk3)
| ssList(nil)
| nil = sk3
| spl0_2 ),
inference(resolution,[],[f454,f346]) ).
fof(f3091,plain,
( ssList(nil)
| nil = sk3
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f3090,f432]) ).
fof(f3093,plain,
( nil = sk3
| spl0_2
| spl0_7 ),
inference(forward_subsumption_resolution,[],[f3091,f478]) ).
fof(f3108,plain,
( nil = app(sk5,sk3)
| ~ spl0_5
| spl0_22 ),
inference(forward_subsumption_resolution,[],[f868,f896]) ).
fof(f3114,plain,
( spl0_3
| ~ spl0_21 ),
inference(avatar_split_clause,[],[f987,f891,f456]) ).
fof(f3209,plain,
( spl0_3
| spl0_2
| spl0_7 ),
inference(avatar_split_clause,[],[f3093,f477,f452,f456]) ).
fof(f3210,plain,
( spl0_21
| ~ spl0_5
| spl0_22 ),
inference(avatar_split_clause,[],[f3108,f895,f466,f891]) ).
fof(f3494,plain,
( ssList(nil)
| ~ spl0_4
| ~ spl0_5 ),
inference(resolution,[],[f794,f445]) ).
fof(f3497,plain,
( $false
| ~ spl0_4
| ~ spl0_5
| spl0_7 ),
inference(forward_subsumption_resolution,[],[f3494,f478]) ).
fof(f3498,plain,
( ~ spl0_4
| ~ spl0_5
| spl0_7 ),
inference(avatar_contradiction_clause,[],[f3497]) ).
cnf(s2,plain,
( ~ spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f464]) ).
cnf(s3,plain,
( ~ spl0_1
| ~ spl0_2
| spl0_5 ),
inference(sat_conversion,[],[f469]) ).
cnf(s5,plain,
( ~ spl0_3
| spl0_5 ),
inference(sat_conversion,[],[f471]) ).
cnf(s15,plain,
~ spl0_7,
inference(sat_conversion,[],[f513]) ).
cnf(s25,plain,
~ spl0_22,
inference(sat_conversion,[],[f904]) ).
cnf(s114,plain,
spl0_1,
inference(sat_conversion,[],[f3067]) ).
cnf(s121,plain,
( spl0_3
| ~ spl0_21 ),
inference(sat_conversion,[],[f3114]) ).
cnf(s142,plain,
( spl0_2
| spl0_3
| spl0_7 ),
inference(sat_conversion,[],[f3209]) ).
cnf(s143,plain,
( ~ spl0_5
| spl0_21
| spl0_22 ),
inference(sat_conversion,[],[f3210]) ).
cnf(s185,plain,
( ~ spl0_4
| ~ spl0_5
| spl0_7 ),
inference(sat_conversion,[],[f3498]) ).
cnf(s192,plain,
( ~ spl0_2
| spl0_5 ),
inference(rat,[],[s3,s114]) ).
cnf(s194,plain,
~ spl0_3,
inference(rat,[],[s185,s2,s5,s15]) ).
cnf(s195,plain,
spl0_2,
inference(rat,[],[s142,s15,s194]) ).
cnf(s200,plain,
~ spl0_21,
inference(rat,[],[s121,s194]) ).
cnf(s203,plain,
spl0_5,
inference(rat,[],[s192,s195]) ).
cnf(s204,plain,
$false,
inference(rat,[],[s143,s25,s200,s203]) ).
fof(f3499,plain,
$false,
inference(avatar_sat_refutation,[],[s204]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC112-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n007.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:57:23 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.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.17/0.51 % (2232121)Will run a generic schedule for satisfiability detection.
% 0.17/0.51 % (2232129)dis+10_1_sil=32000:sp=arity:random_seed=3474019108:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.51 % (2232127)% WARNING: option uhcvi not known.
% 0.17/0.51 % (2232126)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=842586092_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.51 % (2232127)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1973749924:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.51 % (2232128)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2138103418:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.51 % (2232130)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3828728798:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.51 % (2232131)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1421341191:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.51 % (2232132)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=285243498:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.51 % TRYING [1]
% 0.17/0.51 % TRYING [2]
% 0.17/0.51 % TRYING [3]
% 0.17/0.51 % (2232129)Instruction limit reached!
% 0.17/0.51 % (2232129)------------------------------
% 0.17/0.51 % (2232129)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.51 % (2232129)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.51 % (2232129)CaDiCaL version: 2.1.3
% 0.17/0.51 % (2232129)Termination reason: Instruction limit
% 0.17/0.51 % (2232129)Termination phase: Saturation
% 0.17/0.51 % (2232129)Time elapsed: 0.034 s
% 0.17/0.51 % (2232129)Peak memory usage: 13 MB
% 0.17/0.51 % (2232129)Instructions burned: 106 (million)
% 0.17/0.51 % TRYING [4]
% 0.17/0.51 % (2232140)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2435520658:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.17/0.51 % (2232127) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2232121-2232127"...
% 0.17/0.51 % TRYING [1]
% 0.17/0.51 % TRYING [2]
% 0.17/0.51 % (2232127)...printing done.
% 0.17/0.51 % (2232127)Refutation found. Thanks to Tanya!
% 0.17/0.51 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.51 % (2232127)------------------------------
% 0.17/0.51 % (2232127)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.51 % (2232127)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.51 % (2232127)CaDiCaL version: 2.1.3
% 0.17/0.51 % (2232127)Termination reason: Refutation
% 0.17/0.51 % (2232127)Time elapsed: 0.059 s
% 0.17/0.51 % (2232127)Peak memory usage: 14 MB
% 0.17/0.51 % (2232127)Instructions burned: 98 (million)
% 0.17/0.51 % (2232121)Success in time 0.096 s
% 0.17/0.51 % Vampire exiting
%------------------------------------------------------------------------------