%------------------------------------------------------------------------------
% File : Vampire-SAT---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 SAT
% Computer : n002.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:19:56 PM UTC 2026
% Result : Unsatisfiable 0.08s 0.24s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 53 ( 9 unt; 4 def)
% Number of atoms : 123 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 128 ( 58 ~; 66 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 5 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 35 ( 0 sgn 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X2,X0,X1] :
( ~ q1(X0,X1,X2)
| ~ less_or_equalish(X0,X1)
| q2(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
fof(f4,axiom,
! [X2,X0,X1] :
( ~ q1(X0,X1,X2)
| less_or_equalish(X0,X1)
| q3(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(X0,X1)
| less_or_equalish(X1,X0) ),
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(f17,plain,
! [X2,X0,X1] :
( q2(X0,X1,X2)
| less_or_equalish(X0,X1)
| ~ q1(X0,X1,X2) ),
inference(consistent_polarity_flipping,[],[f3]) ).
fof(f18,plain,
! [X2,X0,X1] :
( ~ less_or_equalish(X0,X1)
| ~ q1(X0,X1,X2)
| q3(X0,X1,X2) ),
inference(consistent_polarity_flipping,[],[f4]) ).
fof(f19,plain,
! [X0] : ~ less_or_equalish(X0,X0),
inference(consistent_polarity_flipping,[],[f7]) ).
fof(f22,plain,
! [X0,X1] :
( ~ less_or_equalish(X1,X0)
| ~ less_or_equalish(X0,X1) ),
inference(consistent_polarity_flipping,[],[f10]) ).
fof(f24,plain,
! [X0] :
( ~ q4(a,b,X0)
| less_or_equalish(a,X0)
| less_or_equalish(b,X0)
| less_or_equalish(X0,a) ),
inference(consistent_polarity_flipping,[],[f13]) ).
fof(f25,plain,
! [X0] :
( ~ q4(a,b,X0)
| less_or_equalish(a,X0)
| less_or_equalish(b,X0)
| less_or_equalish(X0,b) ),
inference(consistent_polarity_flipping,[],[f14]) ).
fof(f26,plain,
! [X2,X0,X1] :
( ~ q1(X0,X1,X2)
| less_or_equalish(X0,X1)
| q4(X0,X1,X1) ),
inference(resolution,[],[f17,f5]) ).
fof(f27,plain,
( less_or_equalish(a,b)
| q4(a,b,b) ),
inference(resolution,[],[f26,f12]) ).
fof(f29,definition,
( spl0_1
<=> q4(a,b,b) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f31,plain,
( q4(a,b,b)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f33,definition,
( spl0_2
<=> less_or_equalish(a,b) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f34,plain,
( ~ less_or_equalish(a,b)
| spl0_2 ),
inference(avatar_component_clause,[],[f33]) ).
fof(f35,plain,
( less_or_equalish(a,b)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f33]) ).
fof(f36,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f27,f33,f29]) ).
fof(f37,plain,
( ! [X0] :
( q3(a,b,X0)
| ~ q1(a,b,X0) )
| ~ spl0_2 ),
inference(resolution,[],[f35,f18]) ).
fof(f42,plain,
( ~ less_or_equalish(b,a)
| ~ spl0_2 ),
inference(resolution,[],[f35,f22]) ).
fof(f59,plain,
( ! [X0] :
( ~ q1(a,b,X0)
| q4(a,b,a) )
| ~ spl0_2 ),
inference(resolution,[],[f37,f6]) ).
fof(f61,definition,
( spl0_3
<=> q4(a,b,a) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f63,plain,
( q4(a,b,a)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f61]) ).
fof(f65,definition,
( spl0_4
<=> ! [X0] : ~ q1(a,b,X0) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f66,plain,
( ! [X0] : ~ q1(a,b,X0)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f65]) ).
fof(f67,plain,
( spl0_3
| spl0_4
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f59,f33,f65,f61]) ).
fof(f69,plain,
( less_or_equalish(a,a)
| less_or_equalish(b,a)
| less_or_equalish(a,a)
| ~ spl0_3 ),
inference(resolution,[],[f63,f24]) ).
fof(f70,plain,
( less_or_equalish(a,a)
| less_or_equalish(b,a)
| ~ spl0_3 ),
inference(duplicate_literal_removal,[],[f69]) ).
fof(f71,plain,
( less_or_equalish(b,a)
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f70,f19]) ).
fof(f72,plain,
( $false
| ~ spl0_2
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f71,f42]) ).
fof(f73,plain,
( ~ spl0_2
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f72]) ).
fof(f74,plain,
( $false
| ~ spl0_4 ),
inference(backward_subsumption_resolution,[],[f12,f66]) ).
fof(f75,plain,
~ spl0_4,
inference(avatar_contradiction_clause,[],[f74]) ).
fof(f79,plain,
( less_or_equalish(a,b)
| less_or_equalish(b,b)
| less_or_equalish(b,b)
| ~ spl0_1 ),
inference(resolution,[],[f31,f25]) ).
fof(f81,plain,
( less_or_equalish(a,b)
| less_or_equalish(b,b)
| ~ spl0_1 ),
inference(duplicate_literal_removal,[],[f79]) ).
fof(f83,plain,
( less_or_equalish(b,b)
| ~ spl0_1
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f81,f34]) ).
fof(f85,plain,
( $false
| ~ spl0_1
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f83,f19]) ).
fof(f86,plain,
( ~ spl0_1
| spl0_2 ),
inference(avatar_contradiction_clause,[],[f85]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f36]) ).
cnf(s2,plain,
( ~ spl0_2
| spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f67]) ).
cnf(s3,plain,
( ~ spl0_2
| ~ spl0_3 ),
inference(sat_conversion,[],[f73]) ).
cnf(s4,plain,
~ spl0_4,
inference(sat_conversion,[],[f75]) ).
cnf(s6,plain,
( ~ spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f86]) ).
cnf(s7,plain,
( ~ spl0_2
| spl0_3 ),
inference(rat,[],[s2,s4]) ).
cnf(s8,plain,
~ spl0_2,
inference(rat,[],[s7,s3]) ).
cnf(s9,plain,
~ spl0_1,
inference(rat,[],[s6,s8]) ).
cnf(s10,plain,
$false,
inference(rat,[],[s1,s8,s9]) ).
fof(f87,plain,
$false,
inference(avatar_sat_refutation,[],[s10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % 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 SAT
% 0.08/0.18 % Computer : n002.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % 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:44:52 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 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.08/0.24 % (237947)Will run a generic schedule for satisfiability detection.
% 0.08/0.24 % (237953)% WARNING: option uhcvi not known.
% 0.08/0.24 % (237953)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=184882999:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.24 % (237953) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-237947-237953"...
% 0.08/0.24 % (237953)...printing done.
% 0.08/0.24 % (237953)Refutation found. Thanks to Tanya!
% 0.08/0.24 % SZS status Unsatisfiable for theBenchmark
% 0.08/0.24 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.24 % (237953)------------------------------
% 0.08/0.24 % (237953)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.24 % (237953)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.24 % (237953)CaDiCaL version: 2.1.3
% 0.08/0.24 % (237953)Termination reason: Refutation
% 0.08/0.24 % (237953)Time elapsed: 0.002 s
% 0.08/0.24 % (237953)Peak memory usage: 12 MB
% 0.08/0.24 % (237953)Instructions burned: 2 (million)
% 0.08/0.24 % (237947)Success in time 0.024 s
% 0.08/0.24 % Vampire exiting
%------------------------------------------------------------------------------