%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWX200+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n015.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:46:42 PM UTC 2026
% Result : Theorem 0.09s 0.25s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 14 unt; 2 def)
% Number of atoms : 67 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 61 ( 27 ~; 22 |; 5 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 33 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0] : ~ leqNat(s(X0),z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_007) ).
fof(f9,axiom,
! [X0] : merge(nil,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_009) ).
fof(f13,axiom,
ord(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_013) ).
fof(f15,axiom,
! [X0,X1,X2] :
( ord(cons(X0,cons(X1,X2)))
<=> ( leqNat(X0,X1)
& ord(cons(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_015) ).
fof(f16,conjecture,
? [X0,X1] :
~ ( ord(X0)
=> ( ~ ord(X1)
=> ord(merge(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_016) ).
fof(f17,negated_conjecture,
~ ? [X0,X1] :
~ ( ord(X0)
=> ( ~ ord(X1)
=> ord(merge(X0,X1)) ) ),
inference(negated_conjecture,[status(cth)],[f16]) ).
fof(f20,plain,
! [X0,X1] :
( ord(merge(X0,X1))
| ord(X1)
| ~ ord(X0) ),
inference(ennf_transformation,[],[f17]) ).
fof(f21,plain,
! [X0,X1] :
( ord(merge(X0,X1))
| ord(X1)
| ~ ord(X0) ),
inference(flattening,[],[f20]) ).
fof(f23,plain,
! [X0,X1,X2] :
( ( ord(cons(X0,cons(X1,X2)))
| ~ leqNat(X0,X1)
| ~ ord(cons(X1,X2)) )
& ( ( leqNat(X0,X1)
& ord(cons(X1,X2)) )
| ~ ord(cons(X0,cons(X1,X2))) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( ord(cons(X0,cons(X1,X2)))
| ~ leqNat(X0,X1)
| ~ ord(cons(X1,X2)) )
& ( ( leqNat(X0,X1)
& ord(cons(X1,X2)) )
| ~ ord(cons(X0,cons(X1,X2))) ) ),
inference(flattening,[],[f23]) ).
fof(f31,plain,
! [X0] : ~ leqNat(s(X0),z),
inference(cnf_transformation,[],[f7]) ).
fof(f34,plain,
! [X0] : merge(nil,X0) = X0,
inference(cnf_transformation,[],[f9]) ).
fof(f38,plain,
ord(nil),
inference(cnf_transformation,[],[f13]) ).
fof(f41,plain,
! [X2,X0,X1] :
( leqNat(X0,X1)
| ~ ord(cons(X0,cons(X1,X2))) ),
inference(cnf_transformation,[],[f24]) ).
fof(f43,plain,
! [X0,X1] :
( ord(merge(X0,X1))
| ord(X1)
| ~ ord(X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f48,definition,
( spl0_2
<=> ! [X1] : ord(X1) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f49,plain,
( ! [X1] : ord(X1)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f48]) ).
fof(f56,plain,
! [X0] :
( ord(X0)
| ord(X0)
| ~ ord(nil) ),
inference(superposition,[],[f43,f34]) ).
fof(f57,plain,
! [X0] :
( ord(X0)
| ~ ord(nil) ),
inference(duplicate_literal_removal,[],[f56]) ).
fof(f59,definition,
( spl0_4
<=> ! [X0,X1] : leqNat(X0,X1) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f60,plain,
( ! [X0,X1] : leqNat(X0,X1)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f59]) ).
fof(f64,plain,
( $false
| ~ spl0_4 ),
inference(resolution,[],[f60,f31]) ).
fof(f68,plain,
~ spl0_4,
inference(avatar_contradiction_clause,[],[f64]) ).
fof(f85,plain,
( ! [X0,X1] : leqNat(X0,X1)
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f41,f49]) ).
fof(f86,plain,
( spl0_4
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f85,f48,f59]) ).
fof(f87,plain,
! [X0] : ord(X0),
inference(global_subsumption,[],[f57,f38]) ).
fof(f88,plain,
spl0_2,
inference(avatar_split_clause,[],[f87,f48]) ).
cnf(s42,plain,
~ spl0_4,
inference(sat_conversion,[],[f68]) ).
cnf(s59,plain,
( ~ spl0_2
| spl0_4 ),
inference(sat_conversion,[],[f86]) ).
cnf(s67,plain,
spl0_2,
inference(sat_conversion,[],[f88]) ).
cnf(s68,plain,
spl0_4,
inference(rat,[],[s59,s67]) ).
cnf(s69,plain,
$false,
inference(rat,[],[s42,s68]) ).
fof(f89,plain,
$false,
inference(avatar_sat_refutation,[],[s69]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX200+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n015.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 15:11:17 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 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.09/0.25 % (2704077)Will run a generic schedule for satisfiability detection.
% 0.09/0.25 % (2704084)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3011905643:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.25 % (2704084) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2704077-2704084"...
% 0.09/0.25 % (2704084)...printing done.
% 0.09/0.25 % (2704084)Refutation found. Thanks to Tanya!
% 0.09/0.25 % SZS status Theorem for theBenchmark
% 0.09/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.25 % (2704084)------------------------------
% 0.09/0.25 % (2704084)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.25 % (2704084)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.25 % (2704084)CaDiCaL version: 2.1.3
% 0.09/0.25 % (2704084)Termination reason: Refutation
% 0.09/0.25 % (2704084)Time elapsed: 0.002 s
% 0.09/0.25 % (2704084)Peak memory usage: 12 MB
% 0.09/0.25 % (2704084)Instructions burned: 2 (million)
% 0.09/0.25 % (2704077)Success in time 0.026 s
% 0.09/0.25 % Vampire exiting
%------------------------------------------------------------------------------