%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : MSC012+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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 12:04:57 PM UTC 2026
% Result : Theorem 3.18s 1.21s
% Output : Refutation 3.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 10 unt; 0 def)
% Number of atoms : 68 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 76 ( 37 ~; 32 |; 5 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 43 ( 41 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ( p(X0)
& less(X0,X1)
& p(X1) )
=> goal ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_to_right) ).
fof(f2,axiom,
! [X0] :
( p(X0)
| ? [X1] :
( less(X0,X1)
& p(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_to_left) ).
fof(f3,axiom,
! [X0,X1,X2] :
( ( less(X0,X1)
& less(X1,X2) )
=> less(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitive_less) ).
fof(f4,axiom,
! [X0] :
? [X1] : less(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',serial_less) ).
fof(f5,conjecture,
goal,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_to_be_proved) ).
fof(f6,negated_conjecture,
~ goal,
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,plain,
~ goal,
inference(flattening,[],[f6]) ).
fof(f8,plain,
! [X0,X1] :
( goal
| ~ p(X0)
| ~ less(X0,X1)
| ~ p(X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f9,plain,
! [X0,X1] :
( goal
| ~ p(X0)
| ~ less(X0,X1)
| ~ p(X1) ),
inference(flattening,[],[f8]) ).
fof(f10,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(ennf_transformation,[],[f3]) ).
fof(f11,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(flattening,[],[f10]) ).
fof(f12,plain,
! [X0] :
( p(X0)
| ( less(X0,sK0(X0))
& p(sK0(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f2]) ).
fof(f13,plain,
! [X0] : less(X0,sK1(X0)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X1,sK1(X0))],[f4]) ).
fof(f14,plain,
~ goal,
inference(cnf_transformation,[],[f7]) ).
fof(f15,plain,
! [X0,X1] :
( goal
| ~ p(X0)
| ~ less(X0,X1)
| ~ p(X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f16,plain,
! [X0] :
( p(sK0(X0))
| p(X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f17,plain,
! [X0] :
( less(X0,sK0(X0))
| p(X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f18,plain,
! [X0] : less(X0,sK1(X0)),
inference(cnf_transformation,[],[f13]) ).
fof(f19,plain,
! [X2,X0,X1] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(cnf_transformation,[],[f11]) ).
fof(f20,plain,
! [X0,X1] :
( ~ less(X0,X1)
| ~ p(X0)
| ~ p(X1) ),
inference(forward_subsumption_resolution,[],[f15,f14]) ).
fof(f21,plain,
! [X0] :
( ~ p(sK1(X0))
| ~ p(X0) ),
inference(resolution,[],[f20,f18]) ).
fof(f23,plain,
! [X2,X0,X1] :
( ~ less(X1,X2)
| ~ less(X0,X1)
| ~ p(X0)
| ~ p(X2) ),
inference(resolution,[],[f19,f20]) ).
fof(f25,plain,
! [X0,X1] :
( ~ less(X0,X1)
| ~ p(X0)
| ~ p(sK0(X1))
| p(X1) ),
inference(resolution,[],[f23,f17]) ).
fof(f29,plain,
! [X0,X1] :
( ~ less(X0,X1)
| ~ p(X0)
| ~ p(sK0(X1)) ),
inference(forward_subsumption_resolution,[],[f25,f20]) ).
fof(f34,plain,
! [X0] :
( ~ p(sK0(sK1(X0)))
| ~ p(X0) ),
inference(resolution,[],[f29,f18]) ).
fof(f43,plain,
! [X0] :
( ~ p(X0)
| p(sK1(X0)) ),
inference(resolution,[],[f34,f16]) ).
fof(f44,plain,
! [X0] : ~ p(X0),
inference(forward_subsumption_resolution,[],[f43,f21]) ).
fof(f45,plain,
! [X0] : p(X0),
inference(resolution,[],[f44,f16]) ).
fof(f46,plain,
$false,
inference(forward_subsumption_resolution,[],[f45,f44]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MSC012+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n003.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 27 17:42:42 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.18/1.21 % (818202)Detected formulas, will run a generic FOF schedule.
% 3.18/1.21 % (818213)dis-21_1_sil=8000:lcm=predicate:random_seed=3943306658: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.18/1.21 % (818211)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3324049191:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.18/1.21 % (818209)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=1465453240:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.18/1.21 % (818212)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3390439725:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.18/1.21 % (818208)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=914873157:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.18/1.21 % (818210)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3109955956:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.18/1.21 % (818207)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=3385604910:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.18/1.21 % (818210)Refutation not found, incomplete strategy
% 3.18/1.21 % (818210)------------------------------
% 3.18/1.21 % (818210)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.18/1.21 % (818210)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.18/1.21 % (818210)CaDiCaL version: 2.1.3
% 3.18/1.21 % (818210)Termination reason: Refutation not found, incomplete strategy
% 3.18/1.21 % (818210)Time elapsed: 0.0000 s
% 3.18/1.21 % (818210)Peak memory usage: 86 MB
% 3.18/1.21 % (818211)First to succeed.
% 3.18/1.21 % (818211)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-818202"
% 3.18/1.21 % (818212)Also succeeded, but the first one will report.
% 3.18/1.21 % (818213)Instruction limit reached!
% 3.18/1.21 % (818213)------------------------------
% 3.18/1.21 % (818213)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.18/1.21 % (818213)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.18/1.21 % (818213)CaDiCaL version: 2.1.3
% 3.18/1.21 % (818213)Termination reason: Instruction limit
% 3.18/1.21 % (818213)Termination phase: Saturation
% 3.18/1.21 % (818213)Time elapsed: 0.063 s
% 3.18/1.21 % (818213)Peak memory usage: 88 MB
% 3.18/1.21 % (818213)Instructions burned: 131 (million)
% 3.18/1.21 % (818221)lrs+10_1_sil=8000:sp=occurrence:random_seed=1656978907:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.18/1.21 % (818221)Also succeeded, but the first one will report.
% 3.18/1.21 % (818210)------------------------------
% 3.18/1.21 % (818210)------------------------------
% 3.18/1.21 % (818211)Refutation found. Thanks to Tanya!
% 3.18/1.21 % SZS status Theorem for theBenchmark
% 3.18/1.21 % SZS output start Proof for theBenchmark
% See solution above
% 3.18/1.21 % (818211)------------------------------
% 3.18/1.21 % (818211)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.18/1.21 % (818211)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.18/1.21 % (818211)CaDiCaL version: 2.1.3
% 3.18/1.21 % (818211)Termination reason: Refutation
% 3.18/1.21 % (818211)Time elapsed: 0.002 s
% 3.18/1.21 % (818211)Peak memory usage: 88 MB
% 3.18/1.21 % (818211)Instructions burned: 1 (million)
% 3.18/1.21 % (818211)------------------------------
% 3.18/1.21 % (818211)------------------------------
% 3.18/1.21 % (818202)Success in time 0.396 s
% 3.18/1.21 % Vampire exiting
%------------------------------------------------------------------------------