↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SEV158^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n010.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 : Wed Sep 30 08:37:55 AM UTC 2026

% Result   : Theorem 0.36s 0.46s
% Output   : Refutation 0.36s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SEV158^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.09  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.30  % Computer : n010.cluster.edu
% 0.11/0.30  % Model    : x86_64 x86_64
% 0.11/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30  % Memory   : 8046.5625MB
% 0.11/0.30  % OS       : Linux 6.8.0-71-generic
% 0.11/0.30  % CPULimit : 300
% 0.11/0.30  % WCLimit  : 300
% 0.11/0.30  % DateTime : Tue Sep 29 15:17:33 UTC 2026
% 0.11/0.31  % CPUTime  : 
% 0.11/0.31  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.30/0.36  Running higher-order theorem proving
% 0.30/0.38  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.36/0.46  % (2982888)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.36/0.46  % (2982898)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=704303681:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.36/0.46  % (2982894)lrs+10_16_si=on:nwc=1.5:random_seed=2421245983:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.36/0.46  % (2982893)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3911434579:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.36/0.46  % (2982895)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2409893509:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.36/0.46  % (2982897)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2880724503:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.36/0.46  % (2982896)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=2043209511:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.36/0.46  % (2982899)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.36/0.46  % (2982899)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.36/0.46  % (2982895)Instruction limit reached! 
% 0.36/0.46  % (2982895)------------------------------
% 0.36/0.46  % (2982895)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.46  % (2982895)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.46  % (2982895)CaDiCaL version: 2.1.3
% 0.36/0.46  % (2982895)Termination reason: Instruction limit
% 0.36/0.46  % (2982895)Termination phase: Saturation
% 0.36/0.46  % (2982895)Time elapsed: 0.004 s
% 0.36/0.46  % (2982895)Peak memory usage: 11 MB
% 0.36/0.46  % (2982895)Instructions burned: 3 (million)
% 0.36/0.46  % (2982899)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=1364651904:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.36/0.46  % (2982893) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2982888-2982893"...
% 0.36/0.46  % (2982894)Instruction limit reached! 
% 0.36/0.46  % (2982894)------------------------------
% 0.36/0.46  % (2982894)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.46  % (2982894)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.46  % (2982894)CaDiCaL version: 2.1.3
% 0.36/0.46  % (2982894)Termination reason: Instruction limit
% 0.36/0.46  % (2982894)Termination phase: Saturation
% 0.36/0.46  % (2982894)Time elapsed: 0.017 s
% 0.36/0.46  % (2982894)Peak memory usage: 12 MB
% 0.36/0.46  % (2982894)Instructions burned: 18 (million)
% 0.36/0.46  % (2982899)Refutation not found, incomplete strategy
% 0.36/0.46  % (2982899)------------------------------
% 0.36/0.46  % (2982899)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.46  % (2982899)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.46  % (2982899)CaDiCaL version: 2.1.3
% 0.36/0.46  % (2982899)Termination reason: Refutation not found, incomplete strategy
% 0.36/0.46  % (2982899)Time elapsed: 0.008 s
% 0.36/0.46  % (2982899)Peak memory usage: 12 MB
% 0.36/0.46  % (2982899)Instructions burned: 7 (million)
% 0.36/0.46  % (2982897) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2982888-2982897"...
% 0.36/0.46  % (2982899)------------------------------
% 0.36/0.46  % (2982899)------------------------------
% 0.36/0.46  % (2982898)Instruction limit reached! 
% 0.36/0.46  % (2982898)------------------------------
% 0.36/0.46  % (2982898)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.46  % (2982898)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.46  % (2982898)CaDiCaL version: 2.1.3
% 0.36/0.46  % (2982898)Termination reason: Instruction limit
% 0.36/0.46  % (2982898)Termination phase: Saturation
% 0.36/0.46  % (2982898)Time elapsed: 0.033 s
% 0.36/0.46  % (2982898)Peak memory usage: 13 MB
% 0.36/0.46  % (2982898)Instructions burned: 75 (million)
% 0.36/0.46  % (2982893)...printing done.
% 0.36/0.46  % (2982897)...printing done.
% 0.36/0.46  % (2982893)Refutation found. Thanks to Tanya!
% 0.36/0.46  % SZS status Theorem for theBenchmark
% 0.36/0.46  % SZS output start Proof for theBenchmark
% 0.36/0.46  thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.36/0.46  thf(func_def_3, type, sP0: ((($i > $o) > ($i > $o) > $o) > $o)).
% 0.36/0.46  thf(func_def_4, type, sK1: ((($i > $o) > ($i > $o) > $o) > $i > $o)).
% 0.36/0.46  thf(func_def_5, type, sK2: ((($i > $o) > ($i > $o) > $o) > $i > $o)).
% 0.36/0.46  thf(func_def_6, type, sK3: ((($i > $o) > ($i > $o) > $o) > $i)).
% 0.36/0.46  thf(func_def_7, type, sK4: ((($i > $o) > ($i > $o) > $o) > $i > $o)).
% 0.36/0.46  thf(func_def_8, type, sK5: ((($i > $o) > ($i > $o) > $o) > $i > $o)).
% 0.36/0.46  thf(func_def_9, type, sK6: ((($i > $o) > ($i > $o) > $o) > $i > $o)).
% 0.36/0.46  thf(func_def_10, type, sK7: ((($i > $o) > ($i > $o) > $o) > $i > $o)).
% 0.36/0.46  thf(func_def_11, type, vNOT: ($o > $o)).
% 0.36/0.46  thf(func_def_12, type, db0: !>[X0: $tType]:(X0)).
% 0.36/0.46  thf(func_def_13, type, db1: !>[X0: $tType]:(X0)).
% 0.36/0.46  thf(func_def_14, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.36/0.46  thf(func_def_15, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.36/0.46  thf(func_def_17, type, db2: !>[X0: $tType]:(X0)).
% 0.36/0.46  thf(f1,conjecture,(
% 0.36/0.46    ? [X0 : (($i > $o) > ($i > $o) > $o)] : (! [X2 : ($i > $o),X3 : ($i > $o),X1 : ($i > $o)] : (((X0 @ X1 @ X2) & (X0 @ X2 @ X3)) => (X0 @ X1 @ X3)) & ! [X1 : ($i > $o)] : (X0 @ X1 @ X1) & ! [X5 : ($i > $o),X4 : ($i > $o)] : (((X0 @ X5 @ X4) & (X0 @ X4 @ X5)) => ! [X1 : $i] : (((X4 @ X1)) = ((X5 @ X1)))))),
% 0.36/0.46    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM120I_1_pme)).
% 0.36/0.46  thf(f2,negated_conjecture,(
% 0.36/0.46    ~ ? [X0 : (($i > $o) > ($i > $o) > $o)] : (! [X2 : ($i > $o),X3 : ($i > $o),X1 : ($i > $o)] : (((X0 @ X1 @ X2) & (X0 @ X2 @ X3)) => (X0 @ X1 @ X3)) & ! [X1 : ($i > $o)] : (X0 @ X1 @ X1) & ! [X5 : ($i > $o),X4 : ($i > $o)] : (((X0 @ X5 @ X4) & (X0 @ X4 @ X5)) => ! [X1 : $i] : (((X4 @ X1)) = ((X5 @ X1)))))),
% 0.36/0.46    inference(negated_conjecture,[status(cth)],[f1])).
% 0.36/0.46  thf(f3,plain,(
% 0.36/0.46    ~ ? [X0 : (($i > $o) > ($i > $o) > $o)] : (! [X1 : ($i > $o),X2 : ($i > $o),X3 : ($i > $o)] : (((X0 @ X3 @ X1) & (X0 @ X1 @ X2)) => (X0 @ X3 @ X2)) & ! [X4 : ($i > $o)] : (X0 @ X4 @ X4) & ! [X5 : ($i > $o),X6 : ($i > $o)] : (((X0 @ X5 @ X6) & (X0 @ X6 @ X5)) => ! [X7 : $i] : (((X6 @ X7)) = ((X5 @ X7)))))),
% 0.36/0.46    inference(rectify,[],[f2])).
% 0.36/0.46  thf(f4,plain,(
% 0.36/0.46    ~ ? [X0 : (($i > $o) > ($i > $o) > $o)] : (! [X3 : ($i > $o),X2 : ($i > $o),X1 : ($i > $o)] : (((((X0 @ X1 @ X2)) = $true) & (((X0 @ X3 @ X1)) = $true)) => (((X0 @ X3 @ X2)) = $true)) & ! [X5 : ($i > $o),X6 : ($i > $o)] : ((($true = ((X0 @ X5 @ X6))) & (((X0 @ X6 @ X5)) = $true)) => ! [X7 : $i] : (((X6 @ X7)) = ((X5 @ X7)))) & ! [X4 : ($i > $o)] : ($true = ((X0 @ X4 @ X4))))),
% 0.36/0.46    inference(fool_elimination,[],[f3])).
% 0.36/0.46  thf(f5,plain,(
% 0.36/0.46    ! [X0 : (($i > $o) > ($i > $o) > $o)] : (? [X3 : ($i > $o),X2 : ($i > $o),X1 : ($i > $o)] : ((((X0 @ X3 @ X2)) != $true) & ((((X0 @ X1 @ X2)) = $true) & (((X0 @ X3 @ X1)) = $true))) | ? [X5 : ($i > $o),X6 : ($i > $o)] : (? [X7 : $i] : (((X6 @ X7)) != ((X5 @ X7))) & (($true = ((X0 @ X5 @ X6))) & (((X0 @ X6 @ X5)) = $true))) | ? [X4 : ($i > $o)] : ($true != ((X0 @ X4 @ X4))))),
% 0.36/0.46    inference(ennf_transformation,[],[f4])).
% 0.36/0.46  thf(f6,plain,(
% 0.36/0.46    ! [X0 : (($i > $o) > ($i > $o) > $o)] : (? [X4 : ($i > $o)] : ($true != ((X0 @ X4 @ X4))) | ? [X3 : ($i > $o),X2 : ($i > $o),X1 : ($i > $o)] : ((((X0 @ X3 @ X2)) != $true) & (((X0 @ X3 @ X1)) = $true) & (((X0 @ X1 @ X2)) = $true)) | ? [X5 : ($i > $o),X6 : ($i > $o)] : (($true = ((X0 @ X5 @ X6))) & ? [X7 : $i] : (((X6 @ X7)) != ((X5 @ X7))) & (((X0 @ X6 @ X5)) = $true)))),
% 0.36/0.46    inference(flattening,[],[f5])).
% 0.36/0.46  thf(f7,definition,(
% 0.36/0.46    ! [X0 : (($i > $o) > ($i > $o) > $o)] : (? [X5 : ($i > $o),X6 : ($i > $o)] : (($true = ((X0 @ X5 @ X6))) & ? [X7 : $i] : (((X6 @ X7)) != ((X5 @ X7))) & (((X0 @ X6 @ X5)) = $true)) | ~ (((sP0 @ X0)) = $true))),
% 0.36/0.46    introduced(definition,[new_symbols(definition,[=])],[predicate_definition_introduction])).
% 0.36/0.46  thf(f8,plain,(
% 0.36/0.46    ! [X0 : (($i > $o) > ($i > $o) > $o)] : (? [X4 : ($i > $o)] : ($true != ((X0 @ X4 @ X4))) | ? [X3 : ($i > $o),X2 : ($i > $o),X1 : ($i > $o)] : ((((X0 @ X3 @ X2)) != $true) & (((X0 @ X3 @ X1)) = $true) & (((X0 @ X1 @ X2)) = $true)) | (((sP0 @ X0)) = $true))),
% 0.36/0.46    inference(definition_folding,[],[f6,f7])).
% 0.36/0.46  thf(f9,plain,(
% 0.36/0.46    ! [X0 : (($i > $o) > ($i > $o) > $o)] : (? [X5 : ($i > $o),X6 : ($i > $o)] : (($true = ((X0 @ X5 @ X6))) & ? [X7 : $i] : (((X6 @ X7)) != ((X5 @ X7))) & (((X0 @ X6 @ X5)) = $true)) | (((sP0 @ X0)) != $true))),
% 0.36/0.46    inference(nnf_transformation,[],[f7])).
% 0.36/0.46  thf(f10,plain,(
% 0.36/0.46    ! [X0 : (($i > $o) > ($i > $o) > $o)] : (? [X1 : ($i > $o),X2 : ($i > $o)] : ((((X0 @ X1 @ X2)) = $true) & ? [X3 : $i] : (((X2 @ X3)) != ((X1 @ X3))) & (((X0 @ X2 @ X1)) = $true)) | (((sP0 @ X0)) != $true))),
% 0.36/0.46    inference(rectify,[],[f9])).
% 0.36/0.46  thf(f11,plain,(
% 0.36/0.46    ! [X0 : (($i > $o) > ($i > $o) > $o)] : ((($true = ((X0 @ (sK1 @ X0) @ (sK2 @ X0)))) & (((sK1 @ X0 @ (sK3 @ X0))) != ((sK2 @ X0 @ (sK3 @ X0)))) & (((X0 @ (sK2 @ X0) @ (sK1 @ X0))) = $true)) | (((sP0 @ X0)) != $true))),
% 0.36/0.46    inference(skolemize,[status(esa),new_symbols(skolem,[vAPP,vAPP,vAPP]),skolemize(X3,sK3 @ X0),skolemize(X3,sK3 @ X0),skolemize(X3,sK3 @ X0)],[f10])).
% 0.36/0.46  thf(f12,plain,(
% 0.36/0.46    ! [X0 : (($i > $o) > ($i > $o) > $o)] : (? [X1 : ($i > $o)] : (((X0 @ X1 @ X1)) != $true) | ? [X2 : ($i > $o),X3 : ($i > $o),X4 : ($i > $o)] : ((((X0 @ X2 @ X3)) != $true) & ($true = ((X0 @ X2 @ X4))) & ($true = ((X0 @ X4 @ X3)))) | (((sP0 @ X0)) = $true))),
% 0.36/0.46    inference(rectify,[],[f8])).
% 0.36/0.46  thf(f13,plain,(
% 0.36/0.46    ! [X0 : (($i > $o) > ($i > $o) > $o)] : ((((X0 @ (sK4 @ X0) @ (sK4 @ X0))) != $true) | ((((X0 @ (sK5 @ X0) @ (sK6 @ X0))) != $true) & (((X0 @ (sK5 @ X0) @ (sK7 @ X0))) = $true) & ($true = ((X0 @ (sK7 @ X0) @ (sK6 @ X0))))) | (((sP0 @ X0)) = $true))),
% 0.36/0.46    inference(skolemize,[status(esa),new_symbols(skolem,[vAPP,vAPP,vAPP,vAPP]),skolemize(X3,sK3 @ X0),skolemize(X3,sK3 @ X0),skolemize(X3,sK3 @ X0),skolemize(X3,sK3 @ X0)],[f12])).
% 0.36/0.46  thf(f14,plain,(
% 0.36/0.46    ( ! [X0 : (($i > $o) > ($i > $o) > $o)] : ((((sP0 @ X0)) != $true) | (((X0 @ (sK2 @ X0) @ (sK1 @ X0))) = $true)) )),
% 0.36/0.46    inference(cnf_transformation,[],[f11])).
% 0.36/0.46  thf(f15,plain,(
% 0.36/0.46    ( ! [X0 : (($i > $o) > ($i > $o) > $o)] : ((((sP0 @ X0)) != $true) | (((sK1 @ X0 @ (sK3 @ X0))) != ((sK2 @ X0 @ (sK3 @ X0))))) )),
% 0.36/0.46    inference(cnf_transformation,[],[f11])).
% 0.36/0.46  thf(f17,plain,(
% 0.36/0.46    ( ! [X0 : (($i > $o) > ($i > $o) > $o)] : ((((X0 @ (sK4 @ X0) @ (sK4 @ X0))) != $true) | ($true = ((X0 @ (sK7 @ X0) @ (sK6 @ X0)))) | (((sP0 @ X0)) = $true)) )),
% 0.36/0.46    inference(cnf_transformation,[],[f13])).
% 0.36/0.46  thf(f18,plain,(
% 0.36/0.46    ( ! [X0 : (($i > $o) > ($i > $o) > $o)] : ((((X0 @ (sK4 @ X0) @ (sK4 @ X0))) != $true) | (((X0 @ (sK5 @ X0) @ (sK7 @ X0))) = $true) | (((sP0 @ X0)) = $true)) )),
% 0.36/0.46    inference(cnf_transformation,[],[f13])).
% 0.36/0.46  thf(f19,plain,(
% 0.36/0.46    ( ! [X0 : (($i > $o) > ($i > $o) > $o)] : ((((X0 @ (sK5 @ X0) @ (sK6 @ X0))) != $true) | (((sP0 @ X0)) = $true) | (((X0 @ (sK4 @ X0) @ (sK4 @ X0))) != $true)) )),
% 0.36/0.46    inference(cnf_transformation,[],[f13])).
% 0.36/0.46  thf(f22,plain,(
% 0.36/0.46    ( ! [X0 : (($i > $o) > ($i > $o) > $o)] : ((((sP0 @ X0)) != $true) | (((sK1 @ X0 @ (sK3 @ X0))) = $true) | (((sK2 @ X0 @ (sK3 @ X0))) = $true)) )),
% 0.36/0.46    inference(xor_proxy_clausification,[],[f15])).
% 0.36/0.46  thf(f23,plain,(
% 0.36/0.46    ( ! [X0 : (($i > $o) > ($i > $o) > $o)] : ((((sP0 @ X0)) != $true) | (((sK1 @ X0 @ (sK3 @ X0))) = $false) | (((sK2 @ X0 @ (sK3 @ X0))) = $false)) )),
% 0.36/0.46    inference(xor_proxy_clausification,[],[f15])).
% 0.36/0.46  thf(f24,plain,(
% 0.36/0.46    ($true = ((sP0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y0 = Y1))))))) | ($true != (((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y0 = Y1)))) @ (sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y0 = Y1))))) @ (sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y0 = Y1)))))))) | ((((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y0 = Y1)))) @ (sK7 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y0 = Y1))))) @ (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y0 = Y1))))))) = $true)),
% 0.36/0.46    inference(primitive_instantiation,[],[f17])).
% 0.36/0.46  thf(f38,plain,(
% 0.36/0.46    (((sP0 @ =)) = $true) | ((((sK7 @ =) = (sK6 @ =))) = $true) | ($true != (((sK4 @ =) = (sK4 @ =))))),
% 0.36/0.46    inference(beta-eta_normalization,[],[f24])).
% 0.36/0.46  thf(f39,plain,(
% 0.36/0.46    (((sP0 @ =)) = $true) | ($true != (((sK4 @ =) = (sK4 @ =)))) | (((sK7 @ =)) = ((sK6 @ =)))),
% 0.36/0.46    inference(equality_proxy_clausification,[],[f38])).
% 0.36/0.46  thf(f40,plain,(
% 0.36/0.46    (((sK7 @ =)) = ((sK6 @ =))) | (((sK4 @ =)) != ((sK4 @ =))) | (((sP0 @ =)) = $true)),
% 0.36/0.46    inference(equality_proxy_clausification,[],[f39])).
% 0.36/0.46  thf(f41,plain,(
% 0.36/0.46    (((sP0 @ =)) = $true) | (((sK7 @ =)) = ((sK6 @ =)))),
% 0.36/0.46    inference(trivial_inequality_removal,[],[f40])).
% 0.36/0.46  thf(f46,definition,(
% 0.36/0.46    spl8_1 <=> (((sK7 @ =)) = ((sK6 @ =)))),
% 0.36/0.46    introduced(definition,[new_symbols(definition,[spl8_1])],[avatar_definition])).
% 0.36/0.46  thf(f48,plain,(
% 0.36/0.46    (((sK7 @ =)) = ((sK6 @ =))) | ~spl8_1),
% 0.36/0.46    inference(avatar_component_clause,[],[f46])).
% 0.36/0.46  thf(f50,definition,(
% 0.36/0.46    spl8_2 <=> (((sP0 @ =)) = $true)),
% 0.36/0.46    introduced(definition,[new_symbols(definition,[spl8_2])],[avatar_definition])).
% 0.36/0.46  thf(f51,plain,(
% 0.36/0.46    (((sP0 @ =)) != $true) | spl8_2),
% 0.36/0.46    inference(avatar_component_clause,[],[f50])).
% 0.36/0.46  thf(f52,plain,(
% 0.36/0.46    (((sP0 @ =)) = $true) | ~spl8_2),
% 0.36/0.46    inference(avatar_component_clause,[],[f50])).
% 0.36/0.46  thf(f53,plain,(
% 0.36/0.46    spl8_1 | spl8_2),
% 0.36/0.46    inference(avatar_split_clause,[],[f41,f50,f46])).
% 0.36/0.46  thf(f54,plain,(
% 0.36/0.46    ($true = ((sP0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y0 = Y1))))))) | ($true != (((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y0 = Y1)))) @ (sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y0 = Y1))))) @ (sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y0 = Y1)))))))) | ($true = (((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y0 = Y1)))) @ (sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y0 = Y1))))) @ (sK7 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y0 = Y1))))))))),
% 0.36/0.46    inference(primitive_instantiation,[],[f18])).
% 0.36/0.46  thf(f65,plain,(
% 0.36/0.46    (((sP0 @ =)) = $true) | ((((sK5 @ =) = (sK7 @ =))) = $true) | ($true != (((sK4 @ =) = (sK4 @ =))))),
% 0.36/0.46    inference(beta-eta_normalization,[],[f54])).
% 0.36/0.46  thf(f66,plain,(
% 0.36/0.46    ($true != (((sK4 @ =) = (sK4 @ =)))) | (((sK5 @ =)) = ((sK7 @ =))) | (((sP0 @ =)) = $true)),
% 0.36/0.46    inference(equality_proxy_clausification,[],[f65])).
% 0.36/0.46  thf(f67,plain,(
% 0.36/0.46    (((sK5 @ =)) = ((sK7 @ =))) | (((sP0 @ =)) = $true) | (((sK4 @ =)) != ((sK4 @ =)))),
% 0.36/0.46    inference(equality_proxy_clausification,[],[f66])).
% 0.36/0.46  thf(f68,plain,(
% 0.36/0.46    (((sP0 @ =)) = $true) | (((sK5 @ =)) = ((sK7 @ =)))),
% 0.36/0.46    inference(trivial_inequality_removal,[],[f67])).
% 0.36/0.46  thf(f79,plain,(
% 0.36/0.46    ( ! [X1 : (($i > $o) > ($i > $o) > $o)] : (($true != (((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (X1 @ Y0 @ Y1))))) @ (sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (X1 @ Y0 @ Y1)))))) @ (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (X1 @ Y0 @ Y1))))))))) | ((((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (X1 @ Y0 @ Y1))))) @ (sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (X1 @ Y0 @ Y1)))))) @ (sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (X1 @ Y0 @ Y1)))))))) != $true) | ($true = ((sP0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (X1 @ Y0 @ Y1))))))))) )),
% 0.36/0.46    inference(primitive_instantiation,[],[f19])).
% 0.36/0.46  thf(f84,plain,(
% 0.36/0.46    ( ! [X1 : (($i > $o) > ($i > $o) > $o)] : ((((~ (X1 @ (sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (X1 @ Y0 @ Y1)))))) @ (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (X1 @ Y0 @ Y1))))))))) != $true) | ($true = ((sP0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (X1 @ Y0 @ Y1)))))))) | (((~ (X1 @ (sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (X1 @ Y0 @ Y1)))))) @ (sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (X1 @ Y0 @ Y1))))))))) != $true)) )),
% 0.36/0.46    inference(beta-eta_normalization,[],[f79])).
% 0.36/0.46  thf(f85,plain,(
% 0.36/0.46    ( ! [X1 : (($i > $o) > ($i > $o) > $o)] : (($true = ((sP0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (X1 @ Y0 @ Y1)))))))) | (((~ (X1 @ (sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (X1 @ Y0 @ Y1)))))) @ (sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (X1 @ Y0 @ Y1))))))))) != $true) | (((X1 @ (sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (X1 @ Y0 @ Y1)))))) @ (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (X1 @ Y0 @ Y1)))))))) = $true)) )),
% 0.36/0.46    inference(not_proxy_clausification,[],[f84])).
% 0.36/0.46  thf(f86,plain,(
% 0.36/0.46    ( ! [X1 : (($i > $o) > ($i > $o) > $o)] : ((((X1 @ (sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (X1 @ Y0 @ Y1)))))) @ (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (X1 @ Y0 @ Y1)))))))) = $true) | (((X1 @ (sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (X1 @ Y0 @ Y1)))))) @ (sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (X1 @ Y0 @ Y1)))))))) = $true) | ($true = ((sP0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (X1 @ Y0 @ Y1))))))))) )),
% 0.36/0.46    inference(not_proxy_clausification,[],[f85])).
% 0.36/0.46  thf(f198,plain,(
% 0.36/0.46    ($true = (((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (Y0 = Y1))))) @ (sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: (~ (Y2 = Y3))))) @ Y0 @ Y1)))))) @ (sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: (~ (Y2 = Y3))))) @ Y0 @ Y1))))))))) | ($true = (((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (Y0 = Y1))))) @ (sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: (~ (Y2 = Y3))))) @ Y0 @ Y1)))))) @ (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: (~ (Y2 = Y3))))) @ Y0 @ Y1))))))))) | (((sP0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: (~ (Y2 = Y3))))) @ Y0 @ Y1))))))) = $true)),
% 0.36/0.46    inference(primitive_instantiation,[],[f86])).
% 0.36/0.46  thf(f211,plain,(
% 0.36/0.46    ($true = ((sP0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1))))))))) | ($true = ((~ ((sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1))))))) = (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1))))))))))) | (((~ ((sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1))))))) = (sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1)))))))))) = $true)),
% 0.36/0.46    inference(beta-eta_normalization,[],[f198])).
% 0.36/0.46  thf(f212,plain,(
% 0.36/0.46    (((~ ((sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1))))))) = (sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1)))))))))) = $true) | ((((sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1))))))) = (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1))))))))) = $false) | ($true = ((sP0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1)))))))))),
% 0.36/0.46    inference(not_proxy_clausification,[],[f211])).
% 0.36/0.46  thf(f213,plain,(
% 0.36/0.46    ((((sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1))))))) = (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1))))))))) = $false) | ((((sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1))))))) = (sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1))))))))) = $false) | ($true = ((sP0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1)))))))))),
% 0.36/0.46    inference(not_proxy_clausification,[],[f212])).
% 0.36/0.46  thf(f214,plain,(
% 0.36/0.46    ($true = ((sP0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1))))))))) | ((((sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1))))))) = (sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1))))))))) = $false) | (((sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1)))))))) != ((sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1)))))))))),
% 0.36/0.46    inference(equality_proxy_clausification,[],[f213])).
% 0.36/0.46  thf(f215,plain,(
% 0.36/0.46    (((sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1)))))))) != ((sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1))))))))) | ($true = ((sP0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1))))))))) | (((sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1)))))))) != ((sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1)))))))))),
% 0.36/0.46    inference(equality_proxy_clausification,[],[f214])).
% 0.36/0.46  thf(f216,plain,(
% 0.36/0.46    (((sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1)))))))) != ((sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1))))))))) | ($true = ((sP0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1)))))))))),
% 0.36/0.46    inference(trivial_inequality_removal,[],[f215])).
% 0.36/0.46  thf(f217,plain,(
% 0.36/0.46    ($true = ((sP0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1))))))))) | (((sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y0 = Y1)))))) != ((sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y0 = Y1)))))))),
% 0.36/0.46    inference(boolean_simplification,[],[f216])).
% 0.36/0.46  thf(f218,plain,(
% 0.36/0.46    (((sK5 @ =)) != ((sK6 @ =))) | ($true = ((sP0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (~ (Y0 = Y1)))))))))),
% 0.36/0.46    inference(beta-eta_normalization,[],[f217])).
% 0.36/0.46  thf(f219,plain,(
% 0.36/0.46    (((sK5 @ =)) != ((sK6 @ =))) | ($true = ((sP0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y0 = Y1)))))))),
% 0.36/0.46    inference(boolean_simplification,[],[f218])).
% 0.36/0.46  thf(f220,plain,(
% 0.36/0.46    (((sK5 @ =)) != ((sK6 @ =))) | (((sP0 @ =)) = $true)),
% 0.36/0.46    inference(beta-eta_normalization,[],[f219])).
% 0.36/0.46  thf(f254,plain,(
% 0.36/0.46    ($true != $true) | ((((sK2 @ =) = (sK1 @ =))) = $true) | ~spl8_2),
% 0.36/0.46    inference(constrained_superposition,[],[f14,f52])).
% 0.36/0.46  thf(f258,plain,(
% 0.36/0.46    (((sK1 @ =)) = ((sK2 @ =))) | ($true != $true) | ~spl8_2),
% 0.36/0.46    inference(equality_proxy_clausification,[],[f254])).
% 0.36/0.46  thf(f259,plain,(
% 0.36/0.46    (((sK1 @ =)) = ((sK2 @ =))) | ~spl8_2),
% 0.36/0.46    inference(trivial_inequality_removal,[],[f258])).
% 0.36/0.46  thf(f260,plain,(
% 0.36/0.46    ( ! [X1 : $i] : ((((sK1 @ = @ X1)) = ((sK2 @ = @ X1)))) ) | ~spl8_2),
% 0.36/0.46    inference(argument_congruence,[],[f259])).
% 0.36/0.46  thf(f261,plain,(
% 0.36/0.46    ( ! [X1 : $i] : ((((sK2 @ = @ X1)) = $false) | (((sK1 @ = @ X1)) = $true)) ) | ~spl8_2),
% 0.36/0.46    inference(iff_proxy_clausification,[],[f260])).
% 0.36/0.46  thf(f262,plain,(
% 0.36/0.46    ( ! [X1 : $i] : ((((sK2 @ = @ X1)) = $true) | (((sK1 @ = @ X1)) = $false)) ) | ~spl8_2),
% 0.36/0.46    inference(iff_proxy_clausification,[],[f260])).
% 0.36/0.46  thf(f271,plain,(
% 0.36/0.46    ($true = ((sK2 @ = @ (sK3 @ =)))) | ($true != $true) | ($true = ((sK1 @ = @ (sK3 @ =)))) | ~spl8_2),
% 0.36/0.46    inference(constrained_superposition,[],[f22,f52])).
% 0.36/0.46  thf(f274,plain,(
% 0.36/0.46    ($true = ((sK1 @ = @ (sK3 @ =)))) | ($true = ((sK2 @ = @ (sK3 @ =)))) | ~spl8_2),
% 0.36/0.46    inference(trivial_inequality_removal,[],[f271])).
% 0.36/0.46  thf(f285,definition,(
% 0.36/0.46    spl8_5 <=> ($true = ((sK1 @ = @ (sK3 @ =))))),
% 0.36/0.46    introduced(definition,[new_symbols(definition,[spl8_5])],[avatar_definition])).
% 0.36/0.46  thf(f286,plain,(
% 0.36/0.46    ($true != ((sK1 @ = @ (sK3 @ =)))) | spl8_5),
% 0.36/0.46    inference(avatar_component_clause,[],[f285])).
% 0.36/0.46  thf(f287,plain,(
% 0.36/0.46    ($true = ((sK1 @ = @ (sK3 @ =)))) | ~spl8_5),
% 0.36/0.46    inference(avatar_component_clause,[],[f285])).
% 0.36/0.46  thf(f289,definition,(
% 0.36/0.46    spl8_6 <=> ($true = ((sK2 @ = @ (sK3 @ =))))),
% 0.36/0.46    introduced(definition,[new_symbols(definition,[spl8_6])],[avatar_definition])).
% 0.36/0.46  thf(f291,plain,(
% 0.36/0.46    ($true = ((sK2 @ = @ (sK3 @ =)))) | ~spl8_6),
% 0.36/0.46    inference(avatar_component_clause,[],[f289])).
% 0.36/0.46  thf(f292,plain,(
% 0.36/0.46    spl8_5 | spl8_6 | ~spl8_2),
% 0.36/0.46    inference(avatar_split_clause,[],[f274,f50,f289,f285])).
% 0.36/0.46  thf(f293,plain,(
% 0.36/0.46    ($true != $true) | ($false = ((sK1 @ = @ (sK3 @ =)))) | (((sK2 @ = @ (sK3 @ =))) = $false) | ~spl8_2),
% 0.36/0.46    inference(constrained_superposition,[],[f23,f52])).
% 0.36/0.46  thf(f296,plain,(
% 0.36/0.46    (((sK2 @ = @ (sK3 @ =))) = $false) | ($false = ((sK1 @ = @ (sK3 @ =)))) | ~spl8_2),
% 0.36/0.46    inference(trivial_inequality_removal,[],[f293])).
% 0.36/0.46  thf(f299,plain,(
% 0.36/0.46    (((sK2 @ = @ (sK3 @ =))) = $false) | ($true = $false) | (~spl8_2 | ~spl8_5)),
% 0.36/0.46    inference(forward_demodulation,[],[f296,f287])).
% 0.36/0.46  thf(f300,plain,(
% 0.36/0.46    (((sK2 @ = @ (sK3 @ =))) = $false) | (~spl8_2 | ~spl8_5)),
% 0.36/0.46    inference(trivial_inequality_removal,[],[f299])).
% 0.36/0.46  thf(f302,plain,(
% 0.36/0.46    ($false = ((sK1 @ = @ (sK3 @ =)))) | ($true = $false) | (~spl8_2 | ~spl8_5)),
% 0.36/0.46    inference(constrained_superposition,[],[f262,f300])).
% 0.36/0.46  thf(f304,plain,(
% 0.36/0.46    ($false = ((sK1 @ = @ (sK3 @ =)))) | (~spl8_2 | ~spl8_5)),
% 0.36/0.46    inference(trivial_inequality_removal,[],[f302])).
% 0.36/0.46  thf(f308,plain,(
% 0.36/0.46    ($true = $false) | (~spl8_2 | ~spl8_5)),
% 0.36/0.46    inference(forward_demodulation,[],[f304,f287])).
% 0.36/0.46  thf(f309,plain,(
% 0.36/0.46    $false | (~spl8_2 | ~spl8_5)),
% 0.36/0.46    inference(trivial_inequality_removal,[],[f308])).
% 0.36/0.46  thf(f310,plain,(
% 0.36/0.46    ~spl8_2 | ~spl8_5),
% 0.36/0.46    inference(avatar_contradiction_clause,[],[f309])).
% 0.36/0.46  thf(f314,plain,(
% 0.36/0.46    ($true = $false) | ($true = ((sK1 @ = @ (sK3 @ =)))) | (~spl8_2 | ~spl8_6)),
% 0.36/0.46    inference(constrained_superposition,[],[f261,f291])).
% 0.36/0.46  thf(f316,plain,(
% 0.36/0.46    ($true = ((sK1 @ = @ (sK3 @ =)))) | (~spl8_2 | ~spl8_6)),
% 0.36/0.46    inference(trivial_inequality_removal,[],[f314])).
% 0.36/0.46  thf(f319,plain,(
% 0.36/0.46    $false | (~spl8_2 | spl8_5 | ~spl8_6)),
% 0.36/0.46    inference(forward_subsumption_resolution,[],[f316,f286])).
% 0.36/0.46  thf(f320,plain,(
% 0.36/0.46    ~spl8_2 | spl8_5 | ~spl8_6),
% 0.36/0.46    inference(avatar_contradiction_clause,[],[f319])).
% 0.36/0.46  thf(f328,plain,(
% 0.36/0.46    (((sK5 @ =)) != ((sK6 @ =))) | spl8_2),
% 0.36/0.46    inference(forward_subsumption_resolution,[],[f220,f51])).
% 0.36/0.46  thf(f329,plain,(
% 0.36/0.46    (((sK5 @ =)) = ((sK7 @ =))) | spl8_2),
% 0.36/0.46    inference(forward_subsumption_resolution,[],[f68,f51])).
% 0.36/0.46  thf(f333,plain,(
% 0.36/0.46    (((sK5 @ =)) = ((sK6 @ =))) | (~spl8_1 | spl8_2)),
% 0.36/0.46    inference(forward_demodulation,[],[f329,f48])).
% 0.36/0.46  thf(f336,plain,(
% 0.36/0.46    $false | (~spl8_1 | spl8_2)),
% 0.36/0.46    inference(forward_subsumption_resolution,[],[f333,f328])).
% 0.36/0.46  thf(f337,plain,(
% 0.36/0.46    ~spl8_1 | spl8_2),
% 0.36/0.46    inference(avatar_contradiction_clause,[],[f336])).
% 0.36/0.46  cnf(s1, plain, spl8_1 | spl8_2, inference(sat_conversion,[],[f53])).
% 0.36/0.46  cnf(s3, plain, ~spl8_2 | spl8_5 | spl8_6, inference(sat_conversion,[],[f292])).
% 0.36/0.46  cnf(s5, plain, ~spl8_2 | ~spl8_5, inference(sat_conversion,[],[f310])).
% 0.36/0.46  cnf(s7, plain, ~spl8_2 | spl8_5 | ~spl8_6, inference(sat_conversion,[],[f320])).
% 0.36/0.46  cnf(s10, plain, ~spl8_1 | spl8_2, inference(sat_conversion,[],[f337])).
% 0.36/0.46  cnf(s11, plain, spl8_5 | ~spl8_2, inference(rat,[],[s3,s7])).
% 0.36/0.46  cnf(s12, plain, ~spl8_2, inference(rat,[],[s11,s5])).
% 0.36/0.46  cnf(s13, plain, ~spl8_1, inference(rat,[],[s10,s12])).
% 0.36/0.46  cnf(s15, plain, $false, inference(rat,[],[s1,s12,s13])).
% 0.36/0.46  thf(f338,plain,(
% 0.36/0.46    $false),
% 0.36/0.46    inference(avatar_sat_refutation,[],[s15])).
% 0.36/0.46  % SZS output end Proof for theBenchmark
% 0.36/0.46  % (2982893)------------------------------
% 0.36/0.46  % (2982893)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.46  % (2982893)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.46  % (2982893)CaDiCaL version: 2.1.3
% 0.36/0.46  % (2982893)Termination reason: Refutation
% 0.36/0.46  % (2982893)Time elapsed: 0.022 s
% 0.36/0.46  % (2982893)Peak memory usage: 13 MB
% 0.36/0.46  % (2982893)Instructions burned: 22 (million)
% 0.36/0.46  % (2982888)Success in time 0.07 s
% 0.36/0.46  % Vampire exiting
%------------------------------------------------------------------------------