%------------------------------------------------------------------------------
% File : Vampire-SAT---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 SAT
% Computer : n008.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:05:45 PM UTC 2026
% Result : Theorem 0.14s 5.50s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 39 ( 13 unt; 2 def)
% Number of atoms : 92 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 103 ( 50 ~; 44 |; 5 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 44 ( 0 sgn 42 !; 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,
! [X0,X1] :
( goal
| ~ p(X0)
| ~ less(X0,X1)
| ~ p(X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f15,plain,
! [X0] :
( p(sK0(X0))
| p(X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f16,plain,
! [X0] :
( less(X0,sK0(X0))
| p(X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f17,plain,
! [X2,X0,X1] :
( ~ less(X1,X2)
| ~ less(X0,X1)
| less(X0,X2) ),
inference(cnf_transformation,[],[f11]) ).
fof(f18,plain,
! [X0] : less(X0,sK1(X0)),
inference(cnf_transformation,[],[f13]) ).
fof(f19,plain,
~ goal,
inference(cnf_transformation,[],[f7]) ).
fof(f21,definition,
( spl2_1
<=> ! [X0,X1] :
( ~ p(X0)
| ~ p(X1)
| ~ less(X0,X1) ) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
fof(f22,plain,
( ! [X0,X1] :
( ~ less(X0,X1)
| ~ p(X1)
| ~ p(X0) )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f21]) ).
fof(f24,definition,
( spl2_2
<=> goal ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
fof(f27,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f14,f24,f21]) ).
fof(f28,plain,
~ spl2_2,
inference(avatar_split_clause,[],[f19,f24]) ).
fof(f29,plain,
( ! [X0] :
( ~ p(sK1(X0))
| ~ p(X0) )
| ~ spl2_1 ),
inference(resolution,[],[f22,f18]) ).
fof(f32,plain,
! [X0,X1] :
( less(X0,sK0(X1))
| ~ less(X0,X1)
| p(X1) ),
inference(resolution,[],[f17,f16]) ).
fof(f36,plain,
( ! [X0,X1] :
( ~ less(X0,X1)
| p(X1)
| ~ p(sK0(X1))
| ~ p(X0) )
| ~ spl2_1 ),
inference(resolution,[],[f32,f22]) ).
fof(f37,plain,
( ! [X0,X1] :
( ~ less(X0,X1)
| ~ p(sK0(X1))
| ~ p(X0) )
| ~ spl2_1 ),
inference(forward_subsumption_resolution,[],[f36,f22]) ).
fof(f43,plain,
( ! [X0] :
( ~ p(sK0(sK1(X0)))
| ~ p(X0) )
| ~ spl2_1 ),
inference(resolution,[],[f37,f18]) ).
fof(f52,plain,
( ! [X0] :
( ~ p(X0)
| p(sK1(X0)) )
| ~ spl2_1 ),
inference(resolution,[],[f43,f15]) ).
fof(f53,plain,
( ! [X0] : ~ p(X0)
| ~ spl2_1 ),
inference(forward_subsumption_resolution,[],[f52,f29]) ).
fof(f58,plain,
( ! [X0] : p(X0)
| ~ spl2_1 ),
inference(resolution,[],[f53,f15]) ).
fof(f59,plain,
( $false
| ~ spl2_1 ),
inference(forward_subsumption_resolution,[],[f58,f53]) ).
fof(f60,plain,
~ spl2_1,
inference(avatar_contradiction_clause,[],[f59]) ).
cnf(s1,plain,
( spl2_1
| spl2_2 ),
inference(sat_conversion,[],[f27]) ).
cnf(s2,plain,
~ spl2_2,
inference(sat_conversion,[],[f28]) ).
cnf(s3,plain,
~ spl2_1,
inference(sat_conversion,[],[f60]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
fof(f61,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % 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 SAT
% 0.14/5.41 % Computer : n008.cluster.edu
% 0.14/5.41 % Model : x86_64 x86_64
% 0.14/5.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/5.41 % Memory : 8046.5625MB
% 0.14/5.41 % OS : Linux 6.8.0-71-generic
% 0.14/5.41 % CPULimit : 300
% 0.14/5.41 % WCLimit : 300
% 0.14/5.41 % DateTime : Sun Sep 27 17:42:29 UTC 2026
% 0.14/5.41 % CPUTime :
% 0.14/5.41 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.14/5.45 Running first-order model finding
% 0.14/5.45 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.14/5.50 % (1488930)Will run a generic schedule for satisfiability detection.
% 0.14/5.50 % (1488935)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1473948296_2999 on theBenchmark for (2999ds/0Mi)
% 0.14/5.50 % TRYING [1]
% 0.14/5.50 % TRYING [2]
% 0.14/5.50 % TRYING [3]
% 0.14/5.50 % TRYING [4]
% 0.14/5.50 % TRYING [5]
% 0.14/5.50 % TRYING [6]
% 0.14/5.50 % (1488936)% WARNING: option uhcvi not known.
% 0.14/5.50 % TRYING [7]
% 0.14/5.50 % (1488936)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3648955896:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.14/5.50 % (1488939)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3602612098:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.14/5.50 % (1488938)dis+10_1_sil=32000:sp=arity:random_seed=1854988142:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.14/5.50 % (1488937)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4089782306:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.14/5.50 % (1488940)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=375341824:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.14/5.50 % (1488941)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=648780414:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.14/5.50 % (1488938) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1488930-1488938"...
% 0.14/5.50 % (1488936) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1488930-1488936"...
% 0.14/5.50 % (1488937) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1488930-1488937"...
% 0.14/5.50 % (1488941) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1488930-1488941"...
% 0.14/5.50 % (1488938)...printing done.
% 0.14/5.50 % (1488936)...printing done.
% 0.14/5.50 % (1488937)...printing done.
% 0.14/5.50 % (1488938)Refutation found. Thanks to Tanya!
% 0.14/5.50 % SZS status Theorem for theBenchmark
% 0.14/5.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/5.50 % (1488938)------------------------------
% 0.17/5.50 % (1488938)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.50 % (1488938)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.50 % (1488938)CaDiCaL version: 2.1.3
% 0.17/5.50 % (1488938)Termination reason: Refutation
% 0.17/5.50 % (1488938)Time elapsed: 0.002 s
% 0.17/5.50 % (1488938)Peak memory usage: 12 MB
% 0.17/5.50 % (1488938)Instructions burned: 2 (million)
% 0.17/5.50 % (1488930)Success in time 0.04 s
% 0.17/5.50 % Vampire exiting
%------------------------------------------------------------------------------