%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : COL029-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:37:40 AM UTC 2026
% Result : Unsatisfiable 2.69s 1.08s
% Output : Refutation 2.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 28 ( 28 unt; 7 def)
% Number of atoms : 28 ( 27 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 1 con; 0-2 aty)
% Number of variables : 39 ( 39 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
! [X0,X1] : apply(apply(u,X0),X1) = apply(X1,apply(apply(X0,X0),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_definition) ).
fof(f2,negated_conjecture,
! [X0] : apply(X0,f(X0)) != apply(f(X0),apply(X0,f(X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_fixed_point) ).
fof(f3,definition,
! [X0] : sF0(X0) = apply(u,X0),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f4,plain,
! [X0] : apply(u,X0) = sF0(X0),
inference(reorient_equations,[],[f3]) ).
fof(f5,definition,
! [X0,X1] : sF1(X0,X1) = apply(sF0(X0),X1),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f6,plain,
! [X0,X1] : apply(sF0(X0),X1) = sF1(X0,X1),
inference(reorient_equations,[],[f5]) ).
fof(f7,definition,
! [X0] : sF2(X0) = apply(X0,X0),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f8,plain,
! [X0] : apply(X0,X0) = sF2(X0),
inference(reorient_equations,[],[f7]) ).
fof(f9,definition,
! [X0,X1] : sF3(X0,X1) = apply(sF2(X0),X1),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f10,plain,
! [X0,X1] : apply(sF2(X0),X1) = sF3(X0,X1),
inference(reorient_equations,[],[f9]) ).
fof(f11,definition,
! [X0,X1] : sF4(X1,X0) = apply(X1,sF3(X0,X1)),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f12,plain,
! [X0,X1] : apply(X1,sF3(X0,X1)) = sF4(X1,X0),
inference(reorient_equations,[],[f11]) ).
fof(f13,plain,
! [X0,X1] : sF1(X0,X1) = sF4(X1,X0),
inference(definition_folding,[],[f1,f12,f10,f8,f6,f4]) ).
fof(f14,definition,
! [X0] : sF5(X0) = apply(X0,f(X0)),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f15,plain,
! [X0] : apply(X0,f(X0)) = sF5(X0),
inference(reorient_equations,[],[f14]) ).
fof(f16,definition,
! [X0] : sF6(X0) = apply(f(X0),sF5(X0)),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f17,plain,
! [X0] : apply(f(X0),sF5(X0)) = sF6(X0),
inference(reorient_equations,[],[f16]) ).
fof(f18,plain,
! [X0] : sF5(X0) != sF6(X0),
inference(definition_folding,[],[f2,f17,f15,f15]) ).
fof(f19,plain,
! [X0] : sF5(X0) != apply(f(X0),sF5(X0)),
inference(forward_demodulation,[],[f18,f17]) ).
fof(f20,plain,
! [X0,X1] : sF1(X0,X1) = apply(X1,sF3(X0,X1)),
inference(forward_demodulation,[],[f13,f12]) ).
fof(f21,plain,
! [X0,X1] : sF1(X0,X1) = apply(X1,apply(sF2(X0),X1)),
inference(forward_demodulation,[],[f20,f10]) ).
fof(f22,plain,
! [X0,X1] : apply(X1,apply(apply(X0,X0),X1)) = sF1(X0,X1),
inference(forward_demodulation,[],[f21,f8]) ).
fof(f23,plain,
! [X0,X1] : apply(X1,apply(apply(X0,X0),X1)) = apply(sF0(X0),X1),
inference(forward_demodulation,[],[f22,f6]) ).
fof(f24,plain,
! [X0,X1] : apply(apply(u,X0),X1) = apply(X1,apply(apply(X0,X0),X1)),
inference(forward_demodulation,[],[f23,f4]) ).
fof(f25,plain,
! [X0] : apply(apply(u,X0),f(apply(X0,X0))) = apply(f(apply(X0,X0)),sF5(apply(X0,X0))),
inference(superposition,[],[f24,f15]) ).
fof(f27,plain,
! [X0] : sF5(apply(X0,X0)) != apply(apply(u,X0),f(apply(X0,X0))),
inference(superposition,[],[f19,f25]) ).
fof(f30,plain,
sF5(apply(u,u)) != sF5(apply(u,u)),
inference(superposition,[],[f27,f15]) ).
fof(f31,plain,
$false,
inference(trivial_inequality_removal,[],[f30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL029-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n019.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 21:30:18 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running first-order theorem proving
% 0.08/0.22 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.69/1.08 % (296103)Detected a unit-equality problem, will run specialized UEQ schedule.
% 2.69/1.08 % (296112)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=2103862000:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 2.69/1.08 % (296112)First to succeed.
% 2.69/1.08 % (296112)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-296103"
% 2.69/1.08 % (296114)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=3084972778:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 2.69/1.08 % (296109)lrs+11_1_ncem=casc2026/models/loop6.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3435304970:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 2.69/1.08 % (296113)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=3117972728:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 2.69/1.08 % (296111)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=1090682196:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 2.69/1.08 % (296110)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=964793396:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 2.69/1.08 % (296108)lrs+1002_1_ncem=casc2026/models/loop7.pt:sil=128000:tgt=ground:npcc=on:drc=off:sp=reverse_frequency:spb=goal:acc=on:s2agt=16:kmz=on:sac=on:random_seed=2620617909:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 2.69/1.08 % (296114)Also succeeded, but the first one will report.
% 2.69/1.08 % (296111)Also succeeded, but the first one will report.
% 2.69/1.08 % (296113)Also succeeded, but the first one will report.
% 2.69/1.08 % (296112)Refutation found. Thanks to Tanya!
% 2.69/1.08 % SZS status Unsatisfiable for theBenchmark
% 2.69/1.08 % SZS output start Proof for theBenchmark
% See solution above
% 2.69/1.08 % (296112)------------------------------
% 2.69/1.08 % (296112)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.69/1.08 % (296112)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.69/1.08 % (296112)CaDiCaL version: 2.1.3
% 2.69/1.08 % (296112)Termination reason: Refutation
% 2.69/1.08 % (296112)Time elapsed: 0.002 s
% 2.69/1.08 % (296112)Peak memory usage: 88 MB
% 2.69/1.08 % (296112)Instructions burned: 2 (million)
% 2.69/1.08 % (296112)------------------------------
% 2.69/1.08 % (296112)------------------------------
% 2.69/1.08 % (296103)Success in time 0.307 s
% 2.69/1.08 % Vampire exiting
%------------------------------------------------------------------------------