%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ALG203+1 : TPTP v9.3.1. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:19:07 AM UTC 2026
% Result : Theorem 2.85s 1.19s
% Output : Refutation 2.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 3
% Syntax : Number of formulae : 34 ( 6 unt; 0 def)
% Number of atoms : 153 ( 53 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 198 ( 79 ~; 69 |; 32 &)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 72 ( 68 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
( ? [X0] :
( sorti1(X0)
& op1(X0,X0) = X0 )
& ? [X1] :
( sorti1(X1)
& op1(X1,X1) != X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
fof(f4,axiom,
~ ( ? [X0] :
( sorti2(X0)
& op2(X0,X0) = X0 )
& ? [X1] :
( sorti2(X1)
& op2(X1,X1) != X1 ) ),
file('/export/starexec/sandbox/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/sandbox/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,
( ! [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(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(flattening,[],[f7]) ).
fof(f9,plain,
( ! [X0] :
( ~ sorti2(X0)
| op2(X0,X0) != X0 )
| ! [X1] :
( ~ sorti2(X1)
| op2(X1,X1) = X1 ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f12,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,[],[f8]) ).
fof(f13,plain,
( sorti1(sK0)
& sK0 = op1(sK0,sK0)
& sorti1(sK1)
& sK1 != op1(sK1,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f3]) ).
fof(f15,plain,
! [X6] :
( sorti2(h(X6))
| ~ sorti1(X6) ),
inference(cnf_transformation,[],[f12]) ).
fof(f16,plain,
! [X5] :
( j(h(X5)) = X5
| ~ sorti1(X5) ),
inference(cnf_transformation,[],[f12]) ).
fof(f18,plain,
! [X2,X3] :
( j(op2(X2,X3)) = op1(j(X2),j(X3))
| ~ sorti2(X3)
| ~ sorti2(X2) ),
inference(cnf_transformation,[],[f12]) ).
fof(f19,plain,
! [X0,X1] :
( h(op1(X0,X1)) = op2(h(X0),h(X1))
| ~ sorti1(X1)
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f20,plain,
! [X0,X1] :
( op2(X0,X0) != X0
| ~ sorti2(X0)
| ~ sorti2(X1)
| op2(X1,X1) = X1 ),
inference(cnf_transformation,[],[f9]) ).
fof(f21,plain,
sK1 != op1(sK1,sK1),
inference(cnf_transformation,[],[f13]) ).
fof(f22,plain,
sorti1(sK1),
inference(cnf_transformation,[],[f13]) ).
fof(f23,plain,
sK0 = op1(sK0,sK0),
inference(cnf_transformation,[],[f13]) ).
fof(f24,plain,
sorti1(sK0),
inference(cnf_transformation,[],[f13]) ).
fof(f29,plain,
! [X0,X1] :
( j(op2(h(X0),X1)) = op1(X0,j(X1))
| ~ sorti2(X1)
| ~ sorti2(h(X0))
| ~ sorti1(X0) ),
inference(superposition,[],[f18,f16]) ).
fof(f32,plain,
! [X0,X1] :
( j(op2(h(X0),X1)) = op1(X0,j(X1))
| ~ sorti2(X1)
| ~ sorti1(X0) ),
inference(forward_subsumption_resolution,[],[f29,f15]) ).
fof(f137,plain,
! [X0,X1] :
( h(X0) != h(op1(X0,X0))
| ~ sorti2(h(X0))
| ~ sorti2(X1)
| op2(X1,X1) = X1
| ~ sorti1(X0)
| ~ sorti1(X0) ),
inference(superposition,[],[f20,f19]) ).
fof(f138,plain,
! [X0,X1] :
( h(X0) != h(op1(X0,X0))
| ~ sorti2(h(X0))
| ~ sorti2(X1)
| op2(X1,X1) = X1
| ~ sorti1(X0) ),
inference(duplicate_literal_removal,[],[f137]) ).
fof(f139,plain,
! [X0,X1] :
( h(X0) != h(op1(X0,X0))
| ~ sorti2(X1)
| op2(X1,X1) = X1
| ~ sorti1(X0) ),
inference(forward_subsumption_resolution,[],[f138,f15]) ).
fof(f147,plain,
! [X0] :
( h(sK0) != h(sK0)
| ~ sorti2(X0)
| op2(X0,X0) = X0
| ~ sorti1(sK0) ),
inference(superposition,[],[f139,f23]) ).
fof(f152,plain,
! [X0] :
( ~ sorti2(X0)
| op2(X0,X0) = X0
| ~ sorti1(sK0) ),
inference(trivial_inequality_removal,[],[f147]) ).
fof(f156,plain,
! [X0] :
( op2(X0,X0) = X0
| ~ sorti2(X0) ),
inference(forward_subsumption_resolution,[],[f152,f24]) ).
fof(f161,plain,
! [X0] :
( j(h(X0)) = op1(X0,j(h(X0)))
| ~ sorti2(h(X0))
| ~ sorti1(X0)
| ~ sorti2(h(X0)) ),
inference(superposition,[],[f32,f156]) ).
fof(f169,plain,
! [X0] :
( j(h(X0)) = op1(X0,j(h(X0)))
| ~ sorti2(h(X0))
| ~ sorti1(X0) ),
inference(duplicate_literal_removal,[],[f161]) ).
fof(f173,plain,
! [X0] :
( j(h(X0)) = op1(X0,j(h(X0)))
| ~ sorti1(X0) ),
inference(forward_subsumption_resolution,[],[f169,f15]) ).
fof(f988,plain,
! [X0] :
( op1(X0,X0) = X0
| ~ sorti1(X0)
| ~ sorti1(X0) ),
inference(superposition,[],[f173,f16]) ).
fof(f1020,plain,
! [X0] :
( op1(X0,X0) = X0
| ~ sorti1(X0) ),
inference(duplicate_literal_removal,[],[f988]) ).
fof(f1061,plain,
( sK1 != sK1
| ~ sorti1(sK1) ),
inference(superposition,[],[f21,f1020]) ).
fof(f1062,plain,
~ sorti1(sK1),
inference(trivial_inequality_removal,[],[f1061]) ).
fof(f1084,plain,
$false,
inference(forward_subsumption_resolution,[],[f1062,f22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ALG203+1 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.20 % Computer : n004.cluster.edu
% 0.07/0.20 % Model : x86_64 x86_64
% 0.07/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.20 % Memory : 8046.5625MB
% 0.07/0.20 % OS : Linux 6.8.0-71-generic
% 0.07/0.20 % CPULimit : 300
% 0.07/0.20 % WCLimit : 300
% 0.07/0.20 % DateTime : Mon Sep 28 19:41:52 UTC 2026
% 0.07/0.20 % CPUTime :
% 0.07/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.24 Running first-order theorem proving
% 0.07/0.24 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
% 2.85/1.19 % (681231)Detected formulas, will run a generic FOF schedule.
% 2.85/1.19 % (681240)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1837828757:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.85/1.19 % (681240)First to succeed.
% 2.85/1.19 % (681240)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-681231"
% 2.85/1.19 % (681238)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=2688006438:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.85/1.19 % (681237)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=4217208853:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.85/1.19 % (681239)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4167448853:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.85/1.19 % (681236)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=2250692329:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.85/1.19 % (681239)Also succeeded, but the first one will report.
% 2.85/1.19 % (681242)dis-21_1_sil=8000:lcm=predicate:random_seed=455826310: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)
% 2.85/1.19 % (681241)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3687621577:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.85/1.19 % (681242)Refutation not found, incomplete strategy
% 2.85/1.19 % (681242)------------------------------
% 2.85/1.19 % (681242)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.85/1.19 % (681242)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.85/1.19 % (681242)CaDiCaL version: 2.1.3
% 2.85/1.19 % (681242)Termination reason: Refutation not found, incomplete strategy
% 2.85/1.19 % (681242)Time elapsed: 0.002 s
% 2.85/1.19 % (681242)Peak memory usage: 88 MB
% 2.85/1.19 % (681242)Instructions burned: 1 (million)
% 2.85/1.19 % (681241)Also succeeded, but the first one will report.
% 2.85/1.19 % (681240)Refutation found. Thanks to Tanya!
% 2.85/1.19 % SZS status Theorem for theBenchmark
% 2.85/1.19 % SZS output start Proof for theBenchmark
% See solution above
% 2.85/1.19 % (681240)------------------------------
% 2.85/1.19 % (681240)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.85/1.19 % (681240)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.85/1.19 % (681240)CaDiCaL version: 2.1.3
% 2.85/1.19 % (681240)Termination reason: Refutation
% 2.85/1.19 % (681240)Time elapsed: 0.011 s
% 2.85/1.19 % (681240)Peak memory usage: 88 MB
% 2.85/1.19 % (681240)Instructions burned: 31 (million)
% 2.85/1.19 % (681240)------------------------------
% 2.85/1.19 % (681240)------------------------------
% 2.85/1.19 % (681231)Success in time 0.311 s
% 2.85/1.19 % Vampire exiting
%------------------------------------------------------------------------------