%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV048+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n013.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:20:04 PM UTC 2026
% Result : Theorem 0.21s 0.28s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 45 ( 30 unt; 5 def)
% Number of atoms : 101 ( 40 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 88 ( 32 ~; 23 |; 22 &)
% ( 5 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 11 con; 0-3 aty)
% Number of variables : 9 ( 0 sgn 9 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f26,axiom,
! [X0] : sum(n0,tptp_minus_1,X0) = n0,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',sum_plus_base) ).
fof(f28,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_tptp_minus_1) ).
fof(f29,axiom,
! [X0] : plus(X0,n1) = succ(X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_1_r) ).
fof(f39,axiom,
! [X0] : minus(X0,n1) = pred(X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
fof(f40,axiom,
! [X0] : pred(succ(X0)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_succ) ).
fof(f51,axiom,
true,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',ttrue) ).
fof(f53,conjecture,
( ( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) )
=> ( ( n0 != pv78
=> ( n0 = sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) ) )
& ( n0 = pv78
=> true ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_norm_0016) ).
fof(f54,negated_conjecture,
~ ( ( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) )
=> ( ( n0 != pv78
=> ( n0 = sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) ) )
& ( n0 = pv78
=> true ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f142,plain,
( ( ( ( n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| ~ leq(n0,pv35)
| ~ leq(pv35,minus(n5,n1)) )
& n0 != pv78 )
| ( ~ true
& n0 = pv78 ) )
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) ),
inference(ennf_transformation,[],[f54]) ).
fof(f143,plain,
( ( ( ( n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| ~ leq(n0,pv35)
| ~ leq(pv35,minus(n5,n1)) )
& n0 != pv78 )
| ( ~ true
& n0 = pv78 ) )
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) ),
inference(flattening,[],[f142]) ).
fof(f273,plain,
! [X0] : n0 = sum(n0,tptp_minus_1,X0),
inference(cnf_transformation,[],[f26]) ).
fof(f275,plain,
n0 = succ(tptp_minus_1),
inference(cnf_transformation,[],[f28]) ).
fof(f276,plain,
! [X0] : succ(X0) = plus(X0,n1),
inference(cnf_transformation,[],[f29]) ).
fof(f286,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[],[f39]) ).
fof(f287,plain,
! [X0] : pred(succ(X0)) = X0,
inference(cnf_transformation,[],[f40]) ).
fof(f305,plain,
true,
inference(cnf_transformation,[],[f51]) ).
fof(f307,plain,
leq(pv35,minus(n5,n1)),
inference(cnf_transformation,[],[f143]) ).
fof(f308,plain,
leq(n0,pv35),
inference(cnf_transformation,[],[f143]) ).
fof(f309,plain,
pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)),
inference(cnf_transformation,[],[f143]) ).
fof(f313,plain,
( n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| ~ leq(n0,pv35)
| ~ leq(pv35,minus(n5,n1))
| ~ true ),
inference(cnf_transformation,[],[f143]) ).
fof(f359,plain,
n0 = plus(tptp_minus_1,n1),
inference(definition_unfolding,[],[f275,f276]) ).
fof(f369,plain,
! [X0] : minus(plus(X0,n1),n1) = X0,
inference(definition_unfolding,[],[f287,f286,f276]) ).
fof(f383,definition,
( spl31_1
<=> true ),
introduced(definition,[new_symbols(definition,[spl31_1])],[avatar_definition]) ).
fof(f392,definition,
( spl31_3
<=> leq(pv35,minus(n5,n1)) ),
introduced(definition,[new_symbols(definition,[spl31_3])],[avatar_definition]) ).
fof(f396,definition,
( spl31_4
<=> leq(n0,pv35) ),
introduced(definition,[new_symbols(definition,[spl31_4])],[avatar_definition]) ).
fof(f400,definition,
( spl31_5
<=> pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) ),
introduced(definition,[new_symbols(definition,[spl31_5])],[avatar_definition]) ).
fof(f404,definition,
( spl31_6
<=> n0 = sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) ),
introduced(definition,[new_symbols(definition,[spl31_6])],[avatar_definition]) ).
fof(f406,plain,
( n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
| spl31_6 ),
inference(avatar_component_clause,[],[f404]) ).
fof(f408,plain,
( ~ spl31_1
| ~ spl31_3
| ~ spl31_4
| ~ spl31_5
| ~ spl31_6 ),
inference(avatar_split_clause,[],[f313,f404,f400,f396,f392,f383]) ).
fof(f409,plain,
spl31_1,
inference(avatar_split_clause,[],[f305,f383]) ).
fof(f410,plain,
spl31_4,
inference(avatar_split_clause,[],[f308,f396]) ).
fof(f411,plain,
spl31_3,
inference(avatar_split_clause,[],[f307,f392]) ).
fof(f412,plain,
spl31_5,
inference(avatar_split_clause,[],[f309,f400]) ).
fof(f446,plain,
tptp_minus_1 = minus(n0,n1),
inference(superposition,[],[f369,f359]) ).
fof(f498,plain,
( n0 != sum(n0,tptp_minus_1,times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
| spl31_6 ),
inference(superposition,[],[f406,f446]) ).
fof(f504,plain,
( $false
| spl31_6 ),
inference(forward_subsumption_resolution,[],[f498,f273]) ).
fof(f505,plain,
spl31_6,
inference(avatar_contradiction_clause,[],[f504]) ).
cnf(s3,plain,
( ~ spl31_1
| ~ spl31_3
| ~ spl31_4
| ~ spl31_5
| ~ spl31_6 ),
inference(sat_conversion,[],[f408]) ).
cnf(s4,plain,
spl31_1,
inference(sat_conversion,[],[f409]) ).
cnf(s5,plain,
spl31_4,
inference(sat_conversion,[],[f410]) ).
cnf(s6,plain,
spl31_3,
inference(sat_conversion,[],[f411]) ).
cnf(s7,plain,
spl31_5,
inference(sat_conversion,[],[f412]) ).
cnf(s8,plain,
spl31_6,
inference(sat_conversion,[],[f505]) ).
cnf(s9,plain,
$false,
inference(rat,[],[s3,s8,s7,s5,s6,s4]) ).
fof(f506,plain,
$false,
inference(avatar_sat_refutation,[],[s9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV048+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n013.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:46:52 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/0.23 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.21/0.28 % (1061489)Will run a generic schedule for satisfiability detection.
% 0.21/0.28 % (1061497)dis+10_1_sil=32000:sp=arity:random_seed=3112478104:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.28 % (1061495)% WARNING: option uhcvi not known.
% 0.21/0.28 % (1061497) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1061489-1061497"...
% 0.21/0.28 % (1061497)...printing done.
% 0.21/0.28 % (1061497)Refutation found. Thanks to Tanya!
% 0.21/0.28 % SZS status Theorem for theBenchmark
% 0.21/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.28 % (1061497)------------------------------
% 0.21/0.28 % (1061497)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (1061497)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (1061497)CaDiCaL version: 2.1.3
% 0.21/0.28 % (1061497)Termination reason: Refutation
% 0.21/0.28 % (1061497)Time elapsed: 0.006 s
% 0.21/0.28 % (1061497)Peak memory usage: 12 MB
% 0.21/0.28 % (1061497)Instructions burned: 16 (million)
% 0.21/0.28 % (1061489)Success in time 0.043 s
% 0.21/0.28 % Vampire exiting
%------------------------------------------------------------------------------