%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYN364+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 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:50:23 PM UTC 2026
% Result : Theorem 3.63s 1.29s
% Output : Refutation 3.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 18 ( 6 unt; 0 def)
% Number of atoms : 79 ( 0 equ)
% Maximal formula atoms : 9 ( 4 avg)
% Number of connectives : 94 ( 33 ~; 24 |; 28 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 67 ( 52 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ! [X0] :
( ? [X1] : big_p(X0,X1)
=> ! [X2] : big_p(X2,X2) )
& ! [X3] :
? [X4] :
( big_p(X3,X4)
| ( big_m(X3)
& big_q(f(X3,X4)) ) )
& ! [X5] :
( big_q(X5)
=> ~ big_m(g(X5)) ) )
=> ! [X3] :
? [X4] :
( big_p(g(X3),X4)
& big_p(X3,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2115) ).
fof(f2,negated_conjecture,
~ ( ( ! [X0] :
( ? [X1] : big_p(X0,X1)
=> ! [X2] : big_p(X2,X2) )
& ! [X3] :
? [X4] :
( big_p(X3,X4)
| ( big_m(X3)
& big_q(f(X3,X4)) ) )
& ! [X5] :
( big_q(X5)
=> ~ big_m(g(X5)) ) )
=> ! [X3] :
? [X4] :
( big_p(g(X3),X4)
& big_p(X3,X3) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ( ( ! [X0] :
( ? [X1] : big_p(X0,X1)
=> ! [X2] : big_p(X2,X2) )
& ! [X3] :
? [X4] :
( big_p(X3,X4)
| ( big_m(X3)
& big_q(f(X3,X4)) ) )
& ! [X5] :
( big_q(X5)
=> ~ big_m(g(X5)) ) )
=> ! [X6] :
? [X7] :
( big_p(g(X6),X7)
& big_p(X6,X6) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ? [X6] :
! [X7] :
( ~ big_p(g(X6),X7)
| ~ big_p(X6,X6) )
& ! [X0] :
( ! [X2] : big_p(X2,X2)
| ! [X1] : ~ big_p(X0,X1) )
& ! [X3] :
? [X4] :
( big_p(X3,X4)
| ( big_m(X3)
& big_q(f(X3,X4)) ) )
& ! [X5] :
( ~ big_m(g(X5))
| ~ big_q(X5) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ? [X6] :
! [X7] :
( ~ big_p(g(X6),X7)
| ~ big_p(X6,X6) )
& ! [X0] :
( ! [X2] : big_p(X2,X2)
| ! [X1] : ~ big_p(X0,X1) )
& ! [X3] :
? [X4] :
( big_p(X3,X4)
| ( big_m(X3)
& big_q(f(X3,X4)) ) )
& ! [X5] :
( ~ big_m(g(X5))
| ~ big_q(X5) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ? [X0] :
! [X1] :
( ~ big_p(g(X0),X1)
| ~ big_p(X0,X0) )
& ! [X2] :
( ! [X3] : big_p(X3,X3)
| ! [X4] : ~ big_p(X2,X4) )
& ! [X5] :
? [X6] :
( big_p(X5,X6)
| ( big_m(X5)
& big_q(f(X5,X6)) ) )
& ! [X7] :
( ~ big_m(g(X7))
| ~ big_q(X7) ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ! [X1] :
( ~ big_p(g(sK0),X1)
| ~ big_p(sK0,sK0) )
& ! [X2] :
( ! [X3] : big_p(X3,X3)
| ! [X4] : ~ big_p(X2,X4) )
& ! [X5] :
( big_p(X5,sK1(X5))
| ( big_m(X5)
& big_q(f(X5,sK1(X5))) ) )
& ! [X7] :
( ~ big_m(g(X7))
| ~ big_q(X7) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X6,sK1(X5))],[f6]) ).
fof(f8,plain,
! [X7] :
( ~ big_m(g(X7))
| ~ big_q(X7) ),
inference(cnf_transformation,[],[f7]) ).
fof(f9,plain,
! [X5] :
( big_q(f(X5,sK1(X5)))
| big_p(X5,sK1(X5)) ),
inference(cnf_transformation,[],[f7]) ).
fof(f10,plain,
! [X5] :
( big_p(X5,sK1(X5))
| big_m(X5) ),
inference(cnf_transformation,[],[f7]) ).
fof(f11,plain,
! [X2,X3,X4] :
( big_p(X3,X3)
| ~ big_p(X2,X4) ),
inference(cnf_transformation,[],[f7]) ).
fof(f12,plain,
! [X1] :
( ~ big_p(g(sK0),X1)
| ~ big_p(sK0,sK0) ),
inference(cnf_transformation,[],[f7]) ).
fof(f13,plain,
! [X1] : ~ big_p(g(sK0),X1),
inference(forward_subsumption_resolution,[],[f12,f11]) ).
fof(f15,plain,
! [X0,X1] : ~ big_p(X0,X1),
inference(resolution,[],[f13,f11]) ).
fof(f17,plain,
! [X0] : big_m(X0),
inference(resolution,[],[f15,f10]) ).
fof(f19,plain,
! [X0] : ~ big_q(X0),
inference(resolution,[],[f17,f8]) ).
fof(f20,plain,
! [X0] : big_p(X0,sK1(X0)),
inference(resolution,[],[f19,f9]) ).
fof(f21,plain,
$false,
inference(forward_subsumption_resolution,[],[f20,f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN364+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n015.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 15:52:02 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.21 Running first-order theorem proving
% 0.09/0.21 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.63/1.29 % (2741970)Detected formulas, will run a generic FOF schedule.
% 3.63/1.29 % (2741977)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=104305352:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.63/1.29 % (2741978)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2425092095:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.63/1.29 % (2741979)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2481856268:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.63/1.29 % (2741980)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=60428551:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.63/1.29 % (2741981)dis-21_1_sil=8000:lcm=predicate:random_seed=2636126351: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.63/1.29 % (2741976)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=592315082:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.63/1.29 % (2741975)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=2734563046:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.63/1.29 % (2741979)First to succeed.
% 3.63/1.29 % (2741980)Also succeeded, but the first one will report.
% 3.63/1.29 % (2741981)Also succeeded, but the first one will report.
% 3.63/1.29 % (2741978)Also succeeded, but the first one will report.
% 3.63/1.29 % (2741979)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2741970"
% 3.63/1.29 % (2741979)Refutation found. Thanks to Tanya!
% 3.63/1.29 % SZS status Theorem for theBenchmark
% 3.63/1.29 % SZS output start Proof for theBenchmark
% See solution above
% 3.63/1.29 % (2741979)------------------------------
% 3.63/1.29 % (2741979)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.63/1.29 % (2741979)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.63/1.29 % (2741979)CaDiCaL version: 2.1.3
% 3.63/1.29 % (2741979)Termination reason: Refutation
% 3.63/1.29 % (2741979)Time elapsed: 0.002 s
% 3.63/1.29 % (2741979)Peak memory usage: 88 MB
% 3.63/1.29 % (2741979)Instructions burned: 1 (million)
% 3.63/1.29 % (2741979)------------------------------
% 3.63/1.29 % (2741979)------------------------------
% 3.63/1.29 % (2741970)Success in time 0.429 s
% 3.63/1.29 % Vampire exiting
%------------------------------------------------------------------------------