%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ALG030+1 : TPTP v9.3.1. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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 09:07:48 AM UTC 2026
% Result : Theorem 3.45s 1.16s
% Output : Refutation 3.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 49 ( 13 unt; 3 def)
% Number of atoms : 162 ( 32 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 185 ( 72 ~; 58 |; 27 &)
% ( 2 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn 64 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( sorti1(X0)
=> ! [X1] :
( sorti1(X1)
=> sorti1(op1(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
fof(f3,axiom,
~ ! [X0] :
( sorti1(X0)
=> ! [X1] :
( sorti1(X1)
=> op1(X0,X1) = op1(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).
fof(f4,axiom,
~ ~ ! [X0] :
( sorti2(X0)
=> ! [X1] :
( sorti2(X1)
=> op2(X0,X1) = op2(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
fof(f5,conjecture,
( ( ! [X0] :
( sorti1(X0)
=> sorti2(h(X0)) )
& ! [X1] :
( sorti2(X1)
=> sorti1(j(X1)) ) )
=> ~ ( ! [X2] :
( sorti1(X2)
=> ! [X3] :
( sorti1(X3)
=> h(op1(X2,X3)) = op2(h(X2),h(X3)) ) )
& ! [X4] :
( sorti2(X4)
=> ! [X5] :
( sorti2(X5)
=> j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
& ! [X6] :
( sorti2(X6)
=> h(j(X6)) = X6 )
& ! [X7] :
( sorti1(X7)
=> j(h(X7)) = X7 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f6,negated_conjecture,
~ ( ( ! [X0] :
( sorti1(X0)
=> sorti2(h(X0)) )
& ! [X1] :
( sorti2(X1)
=> sorti1(j(X1)) ) )
=> ~ ( ! [X2] :
( sorti1(X2)
=> ! [X3] :
( sorti1(X3)
=> h(op1(X2,X3)) = op2(h(X2),h(X3)) ) )
& ! [X4] :
( sorti2(X4)
=> ! [X5] :
( sorti2(X5)
=> j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
& ! [X6] :
( sorti2(X6)
=> h(j(X6)) = X6 )
& ! [X7] :
( sorti1(X7)
=> j(h(X7)) = X7 ) ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,plain,
! [X0] :
( sorti2(X0)
=> ! [X1] :
( sorti2(X1)
=> op2(X0,X1) = op2(X1,X0) ) ),
inference(flattening,[],[f4]) ).
fof(f8,plain,
( ! [X2] :
( ! [X3] :
( h(op1(X2,X3)) = op2(h(X2),h(X3))
| ~ sorti1(X3) )
| ~ sorti1(X2) )
& ! [X4] :
( ! [X5] :
( j(op2(X4,X5)) = op1(j(X4),j(X5))
| ~ sorti2(X5) )
| ~ sorti2(X4) )
& ! [X6] :
( h(j(X6)) = X6
| ~ sorti2(X6) )
& ! [X7] :
( j(h(X7)) = X7
| ~ sorti1(X7) )
& ! [X0] :
( sorti2(h(X0))
| ~ sorti1(X0) )
& ! [X1] :
( sorti1(j(X1))
| ~ sorti2(X1) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f9,plain,
( ! [X2] :
( ! [X3] :
( h(op1(X2,X3)) = op2(h(X2),h(X3))
| ~ sorti1(X3) )
| ~ sorti1(X2) )
& ! [X4] :
( ! [X5] :
( j(op2(X4,X5)) = op1(j(X4),j(X5))
| ~ sorti2(X5) )
| ~ sorti2(X4) )
& ! [X6] :
( h(j(X6)) = X6
| ~ sorti2(X6) )
& ! [X7] :
( j(h(X7)) = X7
| ~ sorti1(X7) )
& ! [X0] :
( sorti2(h(X0))
| ~ sorti1(X0) )
& ! [X1] :
( sorti1(j(X1))
| ~ sorti2(X1) ) ),
inference(flattening,[],[f8]) ).
fof(f10,plain,
! [X0] :
( ! [X1] :
( op2(X0,X1) = op2(X1,X0)
| ~ sorti2(X1) )
| ~ sorti2(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f11,plain,
? [X0] :
( ? [X1] :
( op1(X0,X1) != op1(X1,X0)
& sorti1(X1) )
& sorti1(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f12,plain,
! [X0] :
( ! [X1] :
( sorti1(op1(X0,X1))
| ~ sorti1(X1) )
| ~ sorti1(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f14,plain,
( ! [X0] :
( ! [X1] :
( h(op1(X0,X1)) = op2(h(X0),h(X1))
| ~ sorti1(X1) )
| ~ sorti1(X0) )
& ! [X2] :
( ! [X3] :
( j(op2(X2,X3)) = op1(j(X2),j(X3))
| ~ sorti2(X3) )
| ~ sorti2(X2) )
& ! [X4] :
( h(j(X4)) = X4
| ~ sorti2(X4) )
& ! [X5] :
( j(h(X5)) = X5
| ~ sorti1(X5) )
& ! [X6] :
( sorti2(h(X6))
| ~ sorti1(X6) )
& ! [X7] :
( sorti1(j(X7))
| ~ sorti2(X7) ) ),
inference(rectify,[],[f9]) ).
fof(f15,plain,
( op1(sK0,sK1) != op1(sK1,sK0)
& sorti1(sK1)
& sorti1(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f11]) ).
fof(f17,plain,
! [X6] :
( sorti2(h(X6))
| ~ sorti1(X6) ),
inference(cnf_transformation,[],[f14]) ).
fof(f18,plain,
! [X5] :
( j(h(X5)) = X5
| ~ sorti1(X5) ),
inference(cnf_transformation,[],[f14]) ).
fof(f21,plain,
! [X0,X1] :
( h(op1(X0,X1)) = op2(h(X0),h(X1))
| ~ sorti1(X1)
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f22,plain,
! [X0,X1] :
( op2(X0,X1) = op2(X1,X0)
| ~ sorti2(X1)
| ~ sorti2(X0) ),
inference(cnf_transformation,[],[f10]) ).
fof(f23,plain,
sorti1(sK0),
inference(cnf_transformation,[],[f15]) ).
fof(f24,plain,
sorti1(sK1),
inference(cnf_transformation,[],[f15]) ).
fof(f25,plain,
op1(sK0,sK1) != op1(sK1,sK0),
inference(cnf_transformation,[],[f15]) ).
fof(f26,plain,
! [X0,X1] :
( sorti1(op1(X0,X1))
| ~ sorti1(X1)
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f28,definition,
~ sP2(op1(sK0,sK1)),
introduced(definition,[new_symbols(definition,[sP2])],[inequality_splitting_name_introduction]) ).
fof(f29,plain,
sP2(op1(sK1,sK0)),
inference(inequality_splitting,[],[f25,f28]) ).
fof(f40,plain,
! [X0,X1] :
( op1(X0,X1) = j(op2(h(X0),h(X1)))
| ~ sorti1(op1(X0,X1))
| ~ sorti1(X1)
| ~ sorti1(X0) ),
inference(superposition,[],[f18,f21]) ).
fof(f43,plain,
! [X0,X1] :
( op1(X0,X1) = j(op2(h(X0),h(X1)))
| ~ sorti1(X1)
| ~ sorti1(X0) ),
inference(forward_subsumption_resolution,[],[f40,f26]) ).
fof(f122,plain,
( ~ sP2(j(op2(h(sK0),h(sK1))))
| ~ sorti1(sK1)
| ~ sorti1(sK0) ),
inference(superposition,[],[f28,f43]) ).
fof(f123,plain,
( sP2(j(op2(h(sK1),h(sK0))))
| ~ sorti1(sK0)
| ~ sorti1(sK1) ),
inference(superposition,[],[f29,f43]) ).
fof(f130,plain,
( sP2(j(op2(h(sK1),h(sK0))))
| ~ sorti1(sK1) ),
inference(forward_subsumption_resolution,[],[f123,f23]) ).
fof(f131,plain,
( ~ sP2(j(op2(h(sK0),h(sK1))))
| ~ sorti1(sK0) ),
inference(forward_subsumption_resolution,[],[f122,f24]) ).
fof(f138,plain,
sP2(j(op2(h(sK1),h(sK0)))),
inference(forward_subsumption_resolution,[],[f130,f24]) ).
fof(f139,plain,
~ sP2(j(op2(h(sK0),h(sK1)))),
inference(forward_subsumption_resolution,[],[f131,f23]) ).
fof(f142,plain,
( sP2(j(op2(h(sK0),h(sK1))))
| ~ sorti2(h(sK1))
| ~ sorti2(h(sK0)) ),
inference(superposition,[],[f138,f22]) ).
fof(f145,plain,
( ~ sorti2(h(sK1))
| ~ sorti2(h(sK0)) ),
inference(forward_subsumption_resolution,[],[f142,f139]) ).
fof(f147,definition,
( spl3_1
<=> sorti2(h(sK1)) ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
fof(f149,plain,
( ~ sorti2(h(sK1))
| spl3_1 ),
inference(avatar_component_clause,[],[f147]) ).
fof(f151,definition,
( spl3_2
<=> sorti2(h(sK0)) ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
fof(f153,plain,
( ~ sorti2(h(sK0))
| spl3_2 ),
inference(avatar_component_clause,[],[f151]) ).
fof(f155,plain,
( ~ spl3_2
| ~ spl3_1 ),
inference(avatar_split_clause,[],[f145,f147,f151]) ).
fof(f177,plain,
( ~ sorti1(sK1)
| spl3_1 ),
inference(resolution,[],[f149,f17]) ).
fof(f178,plain,
( $false
| spl3_1 ),
inference(forward_subsumption_resolution,[],[f177,f24]) ).
fof(f179,plain,
spl3_1,
inference(avatar_contradiction_clause,[],[f178]) ).
fof(f190,plain,
( ~ sorti1(sK0)
| spl3_2 ),
inference(resolution,[],[f153,f17]) ).
fof(f191,plain,
( $false
| spl3_2 ),
inference(forward_subsumption_resolution,[],[f190,f23]) ).
fof(f192,plain,
spl3_2,
inference(avatar_contradiction_clause,[],[f191]) ).
cnf(s2,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(sat_conversion,[],[f155]) ).
cnf(s3,plain,
spl3_1,
inference(sat_conversion,[],[f179]) ).
cnf(s4,plain,
spl3_2,
inference(sat_conversion,[],[f192]) ).
cnf(s5,plain,
$false,
inference(rat,[],[s2,s4,s3]) ).
fof(f193,plain,
$false,
inference(avatar_sat_refutation,[],[s5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ALG030+1 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n011.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 19:19:46 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running first-order theorem proving
% 0.08/0.22 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.45/1.16 % (3685980)Detected formulas, will run a generic FOF schedule.
% 3.45/1.16 % (3685985)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=2282885683:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.45/1.16 % (3685987)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=4065083175:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.45/1.16 % (3685990)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2289368556:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.45/1.16 % (3685989)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2178548347:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.45/1.16 % (3685986)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=1697031132:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.45/1.16 % (3685988)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3988661232:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.45/1.16 % (3685991)dis-21_1_sil=8000:lcm=predicate:random_seed=306846843: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.45/1.16 % (3685991)Refutation not found, incomplete strategy
% 3.45/1.16 % (3685991)------------------------------
% 3.45/1.16 % (3685991)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.45/1.16 % (3685991)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.45/1.16 % (3685991)CaDiCaL version: 2.1.3
% 3.45/1.16 % (3685991)Termination reason: Refutation not found, incomplete strategy
% 3.45/1.16 % (3685991)Time elapsed: 0.001 s
% 3.45/1.16 % (3685991)Peak memory usage: 88 MB
% 3.45/1.16 % (3685988)First to succeed.
% 3.45/1.16 % (3685988)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3685980"
% 3.45/1.16 % (3685989)Instruction limit reached!
% 3.45/1.16 % (3685989)------------------------------
% 3.45/1.16 % (3685989)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.45/1.16 % (3685989)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.45/1.16 % (3685989)CaDiCaL version: 2.1.3
% 3.45/1.16 % (3685989)Termination reason: Instruction limit
% 3.45/1.16 % (3685989)Termination phase: Saturation
% 3.45/1.16 % (3685989)Time elapsed: 0.067 s
% 3.45/1.16 % (3685989)Peak memory usage: 88 MB
% 3.45/1.16 % (3685989)Instructions burned: 120 (million)
% 3.45/1.16 % (3685990)Instruction limit reached!
% 3.45/1.16 % (3685990)------------------------------
% 3.45/1.16 % (3685990)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.45/1.16 % (3685990)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.45/1.16 % (3685990)CaDiCaL version: 2.1.3
% 3.45/1.16 % (3685990)Termination reason: Instruction limit
% 3.45/1.16 % (3685990)Termination phase: Saturation
% 3.45/1.16 % (3685990)Time elapsed: 0.084 s
% 3.45/1.16 % (3685990)Peak memory usage: 89 MB
% 3.45/1.16 % (3685990)Instructions burned: 140 (million)
% 3.45/1.16 % (3685999)lrs+10_1_sil=8000:sp=occurrence:random_seed=1384836400:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.45/1.16 % (3686000)lrs+10_1_sil=32000:urr=on:br=off:random_seed=202944620:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.45/1.16 % (3685999)Also succeeded, but the first one will report.
% 3.45/1.16 % (3685991)------------------------------
% 3.45/1.16 % (3685991)------------------------------
% 3.45/1.16 % (3685988)Refutation found. Thanks to Tanya!
% 3.45/1.16 % SZS status Theorem for theBenchmark
% 3.45/1.16 % SZS output start Proof for theBenchmark
% See solution above
% 3.45/1.16 % (3685988)------------------------------
% 3.45/1.16 % (3685988)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.45/1.16 % (3685988)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.45/1.16 % (3685988)CaDiCaL version: 2.1.3
% 3.45/1.16 % (3685988)Termination reason: Refutation
% 3.45/1.16 % (3685988)Time elapsed: 0.006 s
% 3.45/1.16 % (3685988)Peak memory usage: 89 MB
% 3.45/1.16 % (3685988)Instructions burned: 7 (million)
% 3.45/1.16 % (3685988)------------------------------
% 3.45/1.16 % (3685988)------------------------------
% 3.45/1.16 % (3685980)Success in time 0.412 s
% 3.45/1.16 % Vampire exiting
%------------------------------------------------------------------------------