%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV001-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 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:07:52 PM UTC 2026
% Result : Unsatisfiable 2.58s 0.98s
% Output : Refutation 2.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of formulae : 51 ( 10 unt; 6 def)
% Number of atoms : 110 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 114 ( 55 ~; 53 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 7 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 23 ( 0 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X2,X0,X1] :
( q2(X0,X1,X2)
| ~ less_or_equalish(X0,X1)
| ~ q1(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
fof(f4,axiom,
! [X2,X0,X1] :
( q3(X0,X1,X2)
| less_or_equalish(X0,X1)
| ~ q1(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
fof(f5,axiom,
! [X2,X0,X1] :
( ~ q2(X0,X1,X2)
| q4(X0,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
fof(f6,axiom,
! [X2,X0,X1] :
( ~ q3(X0,X1,X2)
| q4(X0,X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
fof(f7,axiom,
! [X0] : less_or_equalish(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_reflexivity) ).
fof(f10,axiom,
! [X0,X1] :
( less_or_equalish(X1,X0)
| less_or_equalish(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',all_less_or_equal) ).
fof(f12,negated_conjecture,
q1(a,b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
fof(f13,negated_conjecture,
! [X0] :
( ~ q4(a,b,X0)
| ~ less_or_equalish(a,X0)
| ~ less_or_equalish(b,X0)
| ~ less_or_equalish(X0,a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
fof(f14,negated_conjecture,
! [X0] :
( ~ q4(a,b,X0)
| ~ less_or_equalish(a,X0)
| ~ less_or_equalish(b,X0)
| ~ less_or_equalish(X0,b) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
fof(f18,plain,
! [X2,X0,X1] :
( ~ q1(X0,X1,X2)
| ~ less_or_equalish(X0,X1)
| q4(X0,X1,X1) ),
inference(resolution,[],[f3,f5]) ).
fof(f19,plain,
! [X2,X0,X1] :
( ~ q1(X0,X1,X2)
| less_or_equalish(X0,X1)
| q4(X0,X1,X0) ),
inference(resolution,[],[f4,f6]) ).
fof(f20,plain,
( ~ less_or_equalish(a,b)
| q4(a,b,b) ),
inference(resolution,[],[f18,f12]) ).
fof(f22,definition,
( spl0_1
<=> q4(a,b,b) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f23,plain,
( q4(a,b,b)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f22]) ).
fof(f25,definition,
( spl0_2
<=> less_or_equalish(a,b) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f27,plain,
( spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f20,f25,f22]) ).
fof(f30,plain,
( less_or_equalish(a,b)
| q4(a,b,a) ),
inference(resolution,[],[f19,f12]) ).
fof(f32,definition,
( spl0_3
<=> q4(a,b,a) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f33,plain,
( q4(a,b,a)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f32]) ).
fof(f35,plain,
( spl0_3
| spl0_2 ),
inference(avatar_split_clause,[],[f30,f25,f32]) ).
fof(f37,plain,
( ~ less_or_equalish(a,a)
| ~ less_or_equalish(b,a)
| ~ less_or_equalish(a,a)
| ~ spl0_3 ),
inference(resolution,[],[f33,f13]) ).
fof(f38,plain,
( ~ less_or_equalish(a,a)
| ~ less_or_equalish(b,a)
| ~ spl0_3 ),
inference(duplicate_literal_removal,[],[f37]) ).
fof(f40,definition,
( spl0_4
<=> less_or_equalish(b,a) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f41,plain,
( ~ less_or_equalish(b,a)
| spl0_4 ),
inference(avatar_component_clause,[],[f40]) ).
fof(f43,definition,
( spl0_5
<=> less_or_equalish(a,a) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f44,plain,
( ~ less_or_equalish(a,a)
| spl0_5 ),
inference(avatar_component_clause,[],[f43]) ).
fof(f45,plain,
( ~ spl0_4
| ~ spl0_5
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f38,f32,f43,f40]) ).
fof(f48,plain,
( less_or_equalish(a,b)
| spl0_4 ),
inference(resolution,[],[f41,f10]) ).
fof(f50,plain,
( spl0_2
| spl0_4 ),
inference(avatar_split_clause,[],[f48,f40,f25]) ).
fof(f51,plain,
( ~ less_or_equalish(a,b)
| ~ less_or_equalish(b,b)
| ~ less_or_equalish(b,b)
| ~ spl0_1 ),
inference(resolution,[],[f23,f14]) ).
fof(f53,plain,
( ~ less_or_equalish(a,b)
| ~ less_or_equalish(b,b)
| ~ spl0_1 ),
inference(duplicate_literal_removal,[],[f51]) ).
fof(f55,definition,
( spl0_6
<=> less_or_equalish(b,b) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f56,plain,
( ~ less_or_equalish(b,b)
| spl0_6 ),
inference(avatar_component_clause,[],[f55]) ).
fof(f57,plain,
( ~ spl0_6
| ~ spl0_2
| ~ spl0_1 ),
inference(avatar_split_clause,[],[f53,f22,f25,f55]) ).
fof(f58,plain,
( $false
| spl0_6 ),
inference(resolution,[],[f56,f7]) ).
fof(f61,plain,
spl0_6,
inference(avatar_contradiction_clause,[],[f58]) ).
fof(f66,plain,
( $false
| spl0_5 ),
inference(resolution,[],[f44,f7]) ).
fof(f69,plain,
spl0_5,
inference(avatar_contradiction_clause,[],[f66]) ).
cnf(s1,plain,
( spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f27]) ).
cnf(s2,plain,
( spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f35]) ).
cnf(s3,plain,
( ~ spl0_3
| ~ spl0_4
| ~ spl0_5 ),
inference(sat_conversion,[],[f45]) ).
cnf(s5,plain,
( spl0_2
| spl0_4 ),
inference(sat_conversion,[],[f50]) ).
cnf(s6,plain,
( ~ spl0_1
| ~ spl0_2
| ~ spl0_6 ),
inference(sat_conversion,[],[f57]) ).
cnf(s7,plain,
spl0_6,
inference(sat_conversion,[],[f61]) ).
cnf(s10,plain,
spl0_5,
inference(sat_conversion,[],[f69]) ).
cnf(s12,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(rat,[],[s6,s7]) ).
cnf(s13,plain,
( ~ spl0_3
| ~ spl0_4 ),
inference(rat,[],[s3,s10]) ).
cnf(s14,plain,
spl0_2,
inference(rat,[],[s13,s2,s5]) ).
cnf(s15,plain,
~ spl0_1,
inference(rat,[],[s12,s14]) ).
cnf(s16,plain,
$false,
inference(rat,[],[s1,s14,s15]) ).
fof(f70,plain,
$false,
inference(avatar_sat_refutation,[],[s16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV001-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n020.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 09:43:04 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running first-order theorem proving
% 0.08/0.22 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.58/0.98 % (61382)Input is clausal, will run a generic CNF schedule.
% 2.58/0.98 % (61393)dis-21_1_sil=8000:lcm=predicate:random_seed=1891651249:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 2.58/0.98 % (61393)First to succeed.
% 2.58/0.98 % (61393)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-61382"
% 2.58/0.98 % (61390)lrs+10_1_sil=8000:sp=occurrence:random_seed=915117677:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.58/0.98 % (61389)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3248911087:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.58/0.98 % (61392)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=735944591:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.58/0.98 % (61387)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=422957501:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.58/0.98 % (61388)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=6401414:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.58/0.98 % (61390)Also succeeded, but the first one will report.
% 2.58/0.98 % (61392)Also succeeded, but the first one will report.
% 2.58/0.98 % (61391)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3519293719:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.58/0.98 % (61391)Also succeeded, but the first one will report.
% 2.58/0.98 % (61393)Refutation found. Thanks to Tanya!
% 2.58/0.98 % SZS status Unsatisfiable for theBenchmark
% 2.58/0.98 % SZS output start Proof for theBenchmark
% See solution above
% 2.58/0.98 % (61393)------------------------------
% 2.58/0.98 % (61393)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.58/0.98 % (61393)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.58/0.98 % (61393)CaDiCaL version: 2.1.3
% 2.58/0.98 % (61393)Termination reason: Refutation
% 2.58/0.98 % (61393)Time elapsed: 0.002 s
% 2.58/0.98 % (61393)Peak memory usage: 89 MB
% 2.58/0.98 % (61393)Instructions burned: 2 (million)
% 2.58/0.98 % (61393)------------------------------
% 2.58/0.98 % (61393)------------------------------
% 2.58/0.98 % (61382)Success in time 0.31 s
% 2.58/0.98 % Vampire exiting
%------------------------------------------------------------------------------