%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYN943+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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 02:06:02 PM UTC 2026
% Result : Theorem 3.50s 1.25s
% Output : Refutation 3.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 34 ( 7 unt; 2 def)
% Number of atoms : 127 ( 0 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 140 ( 47 ~; 53 |; 30 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 3 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 35 ( 0 sgn 23 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0] :
? [X1,X2,X3,X4,X5] :
( ( p(X0)
& e(X0)
& ( e(X1)
=> ( g(X1)
| s(X1,f(X1)) ) )
& ( e(X2)
=> ( g(X2)
| c(f(X2)) ) )
& ( s(X0,X5)
=> p(X5) ) )
=> ( ( p(X3)
& g(X3) )
| ( p(X4)
& c(X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ! [X0] :
? [X1,X2,X3,X4,X5] :
( ( p(X0)
& e(X0)
& ( e(X1)
=> ( g(X1)
| s(X1,f(X1)) ) )
& ( e(X2)
=> ( g(X2)
| c(f(X2)) ) )
& ( s(X0,X5)
=> p(X5) ) )
=> ( ( p(X3)
& g(X3) )
| ( p(X4)
& c(X4) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
? [X0] :
! [X1,X2,X3,X4,X5] :
( ( ~ p(X3)
| ~ g(X3) )
& ( ~ p(X4)
| ~ c(X4) )
& p(X0)
& e(X0)
& ( g(X1)
| s(X1,f(X1))
| ~ e(X1) )
& ( g(X2)
| c(f(X2))
| ~ e(X2) )
& ( p(X5)
| ~ s(X0,X5) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
? [X0] :
! [X1,X2,X3,X4,X5] :
( ( ~ p(X3)
| ~ g(X3) )
& ( ~ p(X4)
| ~ c(X4) )
& p(X0)
& e(X0)
& ( g(X1)
| s(X1,f(X1))
| ~ e(X1) )
& ( g(X2)
| c(f(X2))
| ~ e(X2) )
& ( p(X5)
| ~ s(X0,X5) ) ),
inference(flattening,[],[f3]) ).
fof(f5,plain,
! [X1,X2,X3,X4,X5] :
( ( ~ p(X3)
| ~ g(X3) )
& ( ~ p(X4)
| ~ c(X4) )
& p(sK0)
& e(sK0)
& ( g(X1)
| s(X1,f(X1))
| ~ e(X1) )
& ( g(X2)
| c(f(X2))
| ~ e(X2) )
& ( p(X5)
| ~ s(sK0,X5) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f4]) ).
fof(f6,plain,
! [X5] :
( ~ s(sK0,X5)
| p(X5) ),
inference(cnf_transformation,[],[f5]) ).
fof(f7,plain,
! [X2] :
( c(f(X2))
| g(X2)
| ~ e(X2) ),
inference(cnf_transformation,[],[f5]) ).
fof(f8,plain,
! [X1] :
( s(X1,f(X1))
| g(X1)
| ~ e(X1) ),
inference(cnf_transformation,[],[f5]) ).
fof(f9,plain,
e(sK0),
inference(cnf_transformation,[],[f5]) ).
fof(f10,plain,
p(sK0),
inference(cnf_transformation,[],[f5]) ).
fof(f11,plain,
! [X4] :
( ~ c(X4)
| ~ p(X4) ),
inference(cnf_transformation,[],[f5]) ).
fof(f12,plain,
! [X3] :
( ~ g(X3)
| ~ p(X3) ),
inference(cnf_transformation,[],[f5]) ).
fof(f13,plain,
! [X0] :
( ~ p(f(X0))
| ~ e(X0)
| g(X0) ),
inference(resolution,[],[f7,f11]) ).
fof(f14,plain,
( g(sK0)
| ~ e(sK0)
| p(f(sK0)) ),
inference(resolution,[],[f8,f6]) ).
fof(f15,plain,
( g(sK0)
| p(f(sK0)) ),
inference(forward_subsumption_resolution,[],[f14,f9]) ).
fof(f17,definition,
( spl1_1
<=> p(f(sK0)) ),
introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).
fof(f19,plain,
( p(f(sK0))
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f17]) ).
fof(f21,definition,
( spl1_2
<=> g(sK0) ),
introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).
fof(f22,plain,
( ~ g(sK0)
| spl1_2 ),
inference(avatar_component_clause,[],[f21]) ).
fof(f23,plain,
( g(sK0)
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f21]) ).
fof(f24,plain,
( spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f15,f21,f17]) ).
fof(f25,plain,
( ~ p(sK0)
| ~ spl1_2 ),
inference(resolution,[],[f23,f12]) ).
fof(f26,plain,
( $false
| ~ spl1_2 ),
inference(forward_subsumption_resolution,[],[f25,f10]) ).
fof(f27,plain,
~ spl1_2,
inference(avatar_contradiction_clause,[],[f26]) ).
fof(f28,plain,
( ~ e(sK0)
| g(sK0)
| ~ spl1_1 ),
inference(resolution,[],[f19,f13]) ).
fof(f29,plain,
( g(sK0)
| ~ spl1_1 ),
inference(forward_subsumption_resolution,[],[f28,f9]) ).
fof(f30,plain,
( $false
| ~ spl1_1
| spl1_2 ),
inference(forward_subsumption_resolution,[],[f29,f22]) ).
fof(f31,plain,
( ~ spl1_1
| spl1_2 ),
inference(avatar_contradiction_clause,[],[f30]) ).
cnf(s1,plain,
( spl1_1
| spl1_2 ),
inference(sat_conversion,[],[f24]) ).
cnf(s2,plain,
~ spl1_2,
inference(sat_conversion,[],[f27]) ).
cnf(s3,plain,
( ~ spl1_1
| spl1_2 ),
inference(sat_conversion,[],[f31]) ).
cnf(s4,plain,
~ spl1_1,
inference(rat,[],[s3,s2]) ).
cnf(s5,plain,
$false,
inference(rat,[],[s1,s2,s4]) ).
fof(f32,plain,
$false,
inference(avatar_sat_refutation,[],[s5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN943+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.17 % Computer : n018.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Mon Sep 28 17:17:25 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 Running first-order theorem proving
% 0.10/0.20 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.50/1.25 % (3550667)Detected formulas, will run a generic FOF schedule.
% 3.50/1.25 % (3550674)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1267919796:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.50/1.25 % (3550677)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=257893983:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.50/1.25 % (3550678)dis-21_1_sil=8000:lcm=predicate:random_seed=3943154046:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.50/1.25 % (3550672)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=1972028238:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.50/1.25 % (3550673)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=103697291:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.50/1.25 % (3550676)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=647000793:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.50/1.25 % (3550675)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1279935209:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.50/1.25 % (3550678)Also succeeded, but the first one will report.
% 3.50/1.25 % (3550677)First to succeed.
% 3.50/1.25 % (3550676)Also succeeded, but the first one will report.
% 3.50/1.25 % (3550677)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3550667"
% 3.50/1.25 % (3550675)Also succeeded, but the first one will report.
% 3.50/1.25 % (3550677)Refutation found. Thanks to Tanya!
% 3.50/1.25 % SZS status Theorem for theBenchmark
% 3.50/1.25 % SZS output start Proof for theBenchmark
% See solution above
% 3.50/1.25 % (3550677)------------------------------
% 3.50/1.25 % (3550677)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.50/1.25 % (3550677)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.50/1.25 % (3550677)CaDiCaL version: 2.1.3
% 3.50/1.25 % (3550677)Termination reason: Refutation
% 3.50/1.25 % (3550677)Time elapsed: 0.002 s
% 3.50/1.25 % (3550677)Peak memory usage: 89 MB
% 3.50/1.25 % (3550677)Instructions burned: 1 (million)
% 3.50/1.25 % (3550677)------------------------------
% 3.50/1.25 % (3550677)------------------------------
% 3.50/1.25 % (3550667)Success in time 0.413 s
% 3.50/1.25 % Vampire exiting
%------------------------------------------------------------------------------