%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC275-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 : n020.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:21 PM UTC 2026
% Result : Unsatisfiable 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 17
% Syntax : Number of formulae : 58 ( 18 unt; 7 def)
% Number of atoms : 117 ( 17 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 111 ( 52 ~; 52 |; 0 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 8 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause4) ).
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f67,axiom,
! [X0] :
( ~ ssItem(X0)
| totalorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause67) ).
fof(f101,axiom,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X1 = X0 ),
file('/export/starexec/sandbox2/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(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
~ totalorderedP(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f210,plain,
( sk3 = cons(sk5,nil)
| ~ neq(sk4,nil) ),
inference(reorient_equations,[],[f209]) ).
fof(f214,plain,
~ totalorderedP(sk3),
inference(definition_unfolding,[],[f206,f205]) ).
fof(f267,plain,
! [X0] :
( ssItem(X0)
| totalorderedP(cons(X0,nil)) ),
inference(consistent_polarity_flipping,[],[f67]) ).
fof(f286,plain,
! [X0,X1] :
( ~ neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0)
| X0 = X1 ),
inference(consistent_polarity_flipping,[],[f102]) ).
fof(f346,plain,
( ~ ssItem(sk5)
| neq(sk4,nil) ),
inference(consistent_polarity_flipping,[],[f208]) ).
fof(f347,plain,
( sk3 = cons(sk5,nil)
| neq(sk4,nil) ),
inference(consistent_polarity_flipping,[],[f210]) ).
fof(f356,definition,
( spl0_1
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f358,plain,
( neq(sk4,nil)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f356]) ).
fof(f365,definition,
( spl0_3
<=> sk3 = cons(sk5,nil) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f367,plain,
( sk3 = cons(sk5,nil)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f365]) ).
fof(f368,plain,
( spl0_1
| spl0_3 ),
inference(avatar_split_clause,[],[f347,f365,f356]) ).
fof(f370,definition,
( spl0_4
<=> ssItem(sk5) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f373,plain,
( spl0_1
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f346,f370,f356]) ).
fof(f375,definition,
( spl0_5
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f379,definition,
( spl0_6
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f381,plain,
( nil = sk3
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f379]) ).
fof(f382,plain,
( ~ spl0_5
| spl0_6 ),
inference(avatar_split_clause,[],[f207,f379,f375]) ).
fof(f388,definition,
( spl0_8
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f389,plain,
( ssList(nil)
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f388]) ).
fof(f393,definition,
( spl0_9
<=> ! [X1] :
( ssItem(X1)
| totalorderedP(cons(X1,nil)) ) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f394,plain,
( ! [X1] :
( totalorderedP(cons(X1,nil))
| ssItem(X1) )
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f393]) ).
fof(f422,plain,
spl0_9,
inference(avatar_split_clause,[],[f267,f393]) ).
fof(f424,plain,
spl0_8,
inference(avatar_split_clause,[],[f8,f388]) ).
fof(f454,plain,
( totalorderedP(sk3)
| ssItem(sk5)
| ~ spl0_3
| ~ spl0_9 ),
inference(superposition,[],[f394,f367]) ).
fof(f455,plain,
( ssItem(sk5)
| ~ spl0_3
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f454,f214]) ).
fof(f483,plain,
( spl0_4
| ~ spl0_3
| ~ spl0_9 ),
inference(avatar_split_clause,[],[f455,f393,f365,f370]) ).
fof(f667,plain,
( ~ ssList(sk4)
| ~ ssList(nil)
| nil = sk4
| ~ spl0_1 ),
inference(resolution,[],[f286,f358]) ).
fof(f670,plain,
( ~ ssList(nil)
| nil = sk4
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f667,f203]) ).
fof(f671,plain,
( nil = sk4
| ~ spl0_1
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f670,f389]) ).
fof(f674,plain,
( spl0_5
| ~ spl0_1
| ~ spl0_8 ),
inference(avatar_split_clause,[],[f671,f388,f356,f375]) ).
fof(f682,plain,
( ~ totalorderedP(nil)
| ~ spl0_6 ),
inference(superposition,[],[f214,f381]) ).
fof(f684,plain,
( $false
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f682,f4]) ).
fof(f685,plain,
~ spl0_6,
inference(avatar_contradiction_clause,[],[f684]) ).
cnf(s2,plain,
( spl0_1
| spl0_3 ),
inference(sat_conversion,[],[f368]) ).
cnf(s3,plain,
( spl0_1
| ~ spl0_4 ),
inference(sat_conversion,[],[f373]) ).
cnf(s4,plain,
( ~ spl0_5
| spl0_6 ),
inference(sat_conversion,[],[f382]) ).
cnf(s12,plain,
spl0_9,
inference(sat_conversion,[],[f422]) ).
cnf(s14,plain,
spl0_8,
inference(sat_conversion,[],[f424]) ).
cnf(s22,plain,
( ~ spl0_3
| spl0_4
| ~ spl0_9 ),
inference(sat_conversion,[],[f483]) ).
cnf(s24,plain,
( ~ spl0_1
| spl0_5
| ~ spl0_8 ),
inference(sat_conversion,[],[f674]) ).
cnf(s25,plain,
~ spl0_6,
inference(sat_conversion,[],[f685]) ).
cnf(s30,plain,
~ spl0_5,
inference(rat,[],[s4,s25]) ).
cnf(s31,plain,
~ spl0_1,
inference(rat,[],[s24,s14,s30]) ).
cnf(s32,plain,
~ spl0_4,
inference(rat,[],[s3,s31]) ).
cnf(s33,plain,
~ spl0_3,
inference(rat,[],[s22,s12,s32]) ).
cnf(s34,plain,
$false,
inference(rat,[],[s2,s33,s31]) ).
fof(f686,plain,
$false,
inference(avatar_sat_refutation,[],[s34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC275-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n020.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Mon Sep 28 08:51:34 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 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.20/0.28 % (39369)Will run a generic schedule for satisfiability detection.
% 0.20/0.28 % (39374)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1667208321_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.28 % (39375)% WARNING: option uhcvi not known.
% 0.20/0.28 % TRYING [1]
% 0.20/0.28 % TRYING [2]
% 0.20/0.28 % (39375)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2929518132:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.28 % (39376)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3132118573:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.28 % (39377)dis+10_1_sil=32000:sp=arity:random_seed=169252538:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.28 % (39378)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2880912869:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.28 % (39380)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2342846172:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.28 % (39379)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3676120373:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.28 % TRYING [3]
% 0.20/0.28 % (39377) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-39369-39377"...
% 0.20/0.28 % (39375) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-39369-39375"...
% 0.20/0.28 % (39375)...printing done.
% 0.20/0.28 % (39377)...printing done.
% 0.20/0.28 % TRYING [4]
% 0.20/0.28 % (39375)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28 % (39375)------------------------------
% 0.20/0.28 % (39375)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (39375)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (39375)CaDiCaL version: 2.1.3
% 0.20/0.28 % (39375)Termination reason: Refutation
% 0.20/0.28 % (39375)Time elapsed: 0.011 s
% 0.20/0.28 % (39375)Peak memory usage: 12 MB
% 0.20/0.28 % (39375)Instructions burned: 15 (million)
% 0.20/0.28 % (39369)Success in time 0.056 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------