↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n005.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:30:32 AM UTC 2026

% Result   : Theorem 0.21s 0.30s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU653^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19  % Computer : n005.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Tue Sep 29 14:02:46 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23  Running higher-order theorem proving
% 0.08/0.24  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.21/0.30  % (1718259)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.30  % (1718267)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=3256928179: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.21/0.30  % (1718264)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3262566474:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.30  % (1718266)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=3040448656:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.21/0.30  % (1718266)Instruction limit reached! 
% 0.21/0.30  % (1718266)------------------------------
% 0.21/0.30  % (1718266)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.30  % (1718266)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.30  % (1718266)CaDiCaL version: 2.1.3
% 0.21/0.30  % (1718266)Termination reason: Instruction limit
% 0.21/0.30  % (1718266)Termination phase: Saturation
% 0.21/0.30  % (1718266)Time elapsed: 0.002 s
% 0.21/0.30  % (1718266)Peak memory usage: 11 MB
% 0.21/0.30  % (1718266)Instructions burned: 4 (million)
% 0.21/0.30  % (1718268)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=1729724237:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.30  % (1718270)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.21/0.30  % (1718270)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.21/0.30  % (1718267) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1718259-1718267"...
% 0.21/0.30  % (1718270)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=230633229:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.21/0.30  % (1718267)...printing done.
% 0.21/0.30  % (1718267)Refutation found. Thanks to Tanya!
% 0.21/0.30  % SZS status Theorem for theBenchmark
% 0.21/0.30  % SZS output start Proof for theBenchmark
% 0.21/0.30  thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.21/0.30  thf(func_def_0, type, in: ($i > $i > $o)).
% 0.21/0.30  thf(func_def_2, type, setadjoin: ($i > $i > $i)).
% 0.21/0.30  thf(func_def_3, type, secondinupair: $o).
% 0.21/0.30  thf(func_def_5, type, upairset2E: $o).
% 0.21/0.30  thf(func_def_6, type, setukpairinjL2: $o).
% 0.21/0.30  thf(func_def_7, type, setukpairinjR1: $o).
% 0.21/0.30  thf(func_def_8, type, upairequniteq: $o).
% 0.21/0.30  thf(f1,axiom,(
% 0.21/0.30    (secondinupair = ! [X1 : $i,X0 : $i] : (in @ X1 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))))),
% 0.21/0.30    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',secondinupair)).
% 0.21/0.30  thf(f2,axiom,(
% 0.21/0.30    (upairset2E = ! [X2 : $i,X0 : $i,X1 : $i] : ((in @ X2 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))) => ((X2 = X1) | (X2 = X0))))),
% 0.21/0.30    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',upairset2E)).
% 0.21/0.30  thf(f3,axiom,(
% 0.21/0.30    (setukpairinjL2 = ! [X1 : $i,X0 : $i,X3 : $i,X2 : $i] : ((((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) = ((setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)))) => (X0 = X2)))),
% 0.21/0.30    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setukpairinjL2)).
% 0.21/0.30  thf(f6,conjecture,(
% 0.21/0.30    secondinupair => (upairset2E => (setukpairinjL2 => (setukpairinjR1 => (upairequniteq => ! [X1 : $i,X0 : $i,X3 : $i,X2 : $i] : ((((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) = ((setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)))) => (X1 = X3))))))),
% 0.21/0.30    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setukpairinjR2)).
% 0.21/0.30  thf(f7,negated_conjecture,(
% 0.21/0.30    ~(secondinupair => (upairset2E => (setukpairinjL2 => (setukpairinjR1 => (upairequniteq => ! [X1 : $i,X0 : $i,X3 : $i,X2 : $i] : ((((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) = ((setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)))) => (X1 = X3)))))))),
% 0.21/0.30    inference(negated_conjecture,[status(cth)],[f6])).
% 0.21/0.30  thf(f10,plain,(
% 0.21/0.30    ~(secondinupair => (upairset2E => (setukpairinjL2 => (setukpairinjR1 => (upairequniteq => ! [X0 : $i,X1 : $i,X2 : $i,X3 : $i] : ((((setadjoin @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X3 @ (setadjoin @ X2 @ emptyset)) @ emptyset))) = ((setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)) @ emptyset)))) => (X0 = X2)))))))),
% 0.21/0.30    inference(rectify,[],[f7])).
% 0.21/0.30  thf(f11,plain,(
% 0.21/0.30    ~((secondinupair = $true) => ((upairset2E = $true) => ((setukpairinjL2 = $true) => ((setukpairinjR1 = $true) => ((upairequniteq = $true) => ! [X2 : $i,X1 : $i,X3 : $i,X0 : $i] : ((((setadjoin @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X3 @ (setadjoin @ X2 @ emptyset)) @ emptyset))) = ((setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)) @ emptyset)))) => (X0 = X2)))))))),
% 0.21/0.30    inference(fool_elimination,[],[f10])).
% 0.21/0.30  thf(f12,plain,(
% 0.21/0.30    (secondinupair = ! [X0 : $i,X1 : $i] : (in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset))))),
% 0.21/0.30    inference(rectify,[],[f1])).
% 0.21/0.30  thf(f13,plain,(
% 0.21/0.30    ! [X0 : $i,X1 : $i] : ($true = ((in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset))))) <=> (secondinupair = $true)),
% 0.21/0.30    inference(fool_elimination,[],[f12])).
% 0.21/0.30  thf(f16,plain,(
% 0.21/0.30    (setukpairinjL2 = ! [X0 : $i,X1 : $i,X2 : $i,X3 : $i] : ((((setadjoin @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X3 @ (setadjoin @ X2 @ emptyset)) @ emptyset))) = ((setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)) @ emptyset)))) => (X1 = X3)))),
% 0.21/0.30    inference(rectify,[],[f3])).
% 0.21/0.30  thf(f17,plain,(
% 0.21/0.30    ! [X3 : $i,X1 : $i,X2 : $i,X0 : $i] : ((((setadjoin @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X3 @ (setadjoin @ X2 @ emptyset)) @ emptyset))) = ((setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)) @ emptyset)))) => (X1 = X3)) <=> (setukpairinjL2 = $true)),
% 0.21/0.30    inference(fool_elimination,[],[f16])).
% 0.21/0.30  thf(f18,plain,(
% 0.21/0.30    (upairset2E = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset))) => ((X0 = X2) | (X0 = X1))))),
% 0.21/0.30    inference(rectify,[],[f2])).
% 0.21/0.30  thf(f19,plain,(
% 0.21/0.30    (upairset2E = $true) <=> ! [X1 : $i,X2 : $i,X0 : $i] : ((((in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)))) = $true) => ((X0 = X2) | (X0 = X1)))),
% 0.21/0.30    inference(fool_elimination,[],[f18])).
% 0.21/0.30  thf(f20,plain,(
% 0.21/0.30    (upairset2E = $true) <=> ! [X1 : $i,X2 : $i,X0 : $i] : (((X0 = X2) | (X0 = X1)) | (((in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)))) != $true))),
% 0.21/0.30    inference(ennf_transformation,[],[f19])).
% 0.21/0.30  thf(f21,plain,(
% 0.21/0.30    ! [X2 : $i,X0 : $i,X1 : $i] : ((X0 = X2) | (((in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)))) != $true) | (X0 = X1)) <=> (upairset2E = $true)),
% 0.21/0.30    inference(flattening,[],[f20])).
% 0.21/0.30  thf(f22,plain,(
% 0.21/0.30    ((((? [X3 : $i,X1 : $i,X0 : $i,X2 : $i] : ((((setadjoin @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X3 @ (setadjoin @ X2 @ emptyset)) @ emptyset))) = ((setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)) @ emptyset)))) & (X0 != X2)) & (upairequniteq = $true)) & (setukpairinjR1 = $true)) & (setukpairinjL2 = $true)) & (upairset2E = $true)) & (secondinupair = $true)),
% 0.21/0.30    inference(ennf_transformation,[],[f11])).
% 0.21/0.30  thf(f23,plain,(
% 0.21/0.30    (setukpairinjL2 = $true) & (secondinupair = $true) & (upairset2E = $true) & (upairequniteq = $true) & ? [X3 : $i,X1 : $i,X0 : $i,X2 : $i] : ((((setadjoin @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X3 @ (setadjoin @ X2 @ emptyset)) @ emptyset))) = ((setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)) @ emptyset)))) & (X0 != X2)) & (setukpairinjR1 = $true)),
% 0.21/0.30    inference(flattening,[],[f22])).
% 0.21/0.30  thf(f25,plain,(
% 0.21/0.30    ! [X0 : $i,X2 : $i,X3 : $i,X1 : $i] : ((X1 = X3) | (((setadjoin @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X3 @ (setadjoin @ X2 @ emptyset)) @ emptyset))) != ((setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)) @ emptyset))))) <=> (setukpairinjL2 = $true)),
% 0.21/0.30    inference(ennf_transformation,[],[f17])).
% 0.21/0.30  thf(f28,plain,(
% 0.21/0.30    (! [X0 : $i,X2 : $i,X3 : $i,X1 : $i] : ((X1 = X3) | (((setadjoin @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X3 @ (setadjoin @ X2 @ emptyset)) @ emptyset))) != ((setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)) @ emptyset))))) | (setukpairinjL2 != $true)) & ((setukpairinjL2 = $true) | ? [X0 : $i,X2 : $i,X3 : $i,X1 : $i] : ((X1 != X3) & (((setadjoin @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X3 @ (setadjoin @ X2 @ emptyset)) @ emptyset))) = ((setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)) @ emptyset))))))),
% 0.21/0.30    inference(nnf_transformation,[],[f25])).
% 0.21/0.30  thf(f29,plain,(
% 0.21/0.30    (! [X0 : $i,X1 : $i,X2 : $i,X3 : $i] : ((X2 = X3) | (((setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) != ((setadjoin @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X3 @ (setadjoin @ X0 @ emptyset)) @ emptyset))))) | (setukpairinjL2 != $true)) & ((setukpairinjL2 = $true) | ? [X4 : $i,X5 : $i,X6 : $i,X7 : $i] : ((X6 != X7) & (((setadjoin @ (setadjoin @ X7 @ emptyset) @ (setadjoin @ (setadjoin @ X7 @ (setadjoin @ X4 @ emptyset)) @ emptyset))) = ((setadjoin @ (setadjoin @ X6 @ emptyset) @ (setadjoin @ (setadjoin @ X6 @ (setadjoin @ X5 @ emptyset)) @ emptyset))))))),
% 0.21/0.30    inference(rectify,[],[f28])).
% 0.21/0.30  thf(f30,plain,(
% 0.21/0.30    (! [X0 : $i,X1 : $i,X2 : $i,X3 : $i] : ((X2 = X3) | (((setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) != ((setadjoin @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X3 @ (setadjoin @ X0 @ emptyset)) @ emptyset))))) | (setukpairinjL2 != $true)) & ((setukpairinjL2 = $true) | ((sK3 != sK2) & (((setadjoin @ (setadjoin @ sK2 @ emptyset) @ (setadjoin @ (setadjoin @ sK2 @ (setadjoin @ sK1 @ emptyset)) @ emptyset))) = ((setadjoin @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ (setadjoin @ sK0 @ emptyset)) @ emptyset))))))),
% 0.21/0.30    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X4,sK0),skolemize(X5,sK1),skolemize(X6,sK2),skolemize(X7,sK3)],[f29])).
% 0.21/0.30  thf(f37,plain,(
% 0.21/0.30    (! [X2 : $i,X0 : $i,X1 : $i] : ((X0 = X2) | (((in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)))) != $true) | (X0 = X1)) | (upairset2E != $true)) & ((upairset2E = $true) | ? [X2 : $i,X0 : $i,X1 : $i] : ((X0 != X2) & (((in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)))) = $true) & (X0 != X1)))),
% 0.21/0.30    inference(nnf_transformation,[],[f21])).
% 0.21/0.30  thf(f38,plain,(
% 0.21/0.30    (! [X0 : $i,X1 : $i,X2 : $i] : ((X0 = X1) | (((in @ X1 @ (setadjoin @ X2 @ (setadjoin @ X0 @ emptyset)))) != $true) | (X1 = X2)) | (upairset2E != $true)) & ((upairset2E = $true) | ? [X3 : $i,X4 : $i,X5 : $i] : ((X3 != X4) & ($true = ((in @ X4 @ (setadjoin @ X5 @ (setadjoin @ X3 @ emptyset))))) & (X4 != X5)))),
% 0.21/0.30    inference(rectify,[],[f37])).
% 0.21/0.30  thf(f39,plain,(
% 0.21/0.30    (! [X0 : $i,X1 : $i,X2 : $i] : ((X0 = X1) | (((in @ X1 @ (setadjoin @ X2 @ (setadjoin @ X0 @ emptyset)))) != $true) | (X1 = X2)) | (upairset2E != $true)) & ((upairset2E = $true) | ((sK11 != sK12) & ($true = ((in @ sK12 @ (setadjoin @ sK13 @ (setadjoin @ sK11 @ emptyset))))) & (sK12 != sK13)))),
% 0.21/0.30    inference(skolemize,[status(esa),new_symbols(skolem,[sK11,sK12,sK13]),skolemize(X3,sK11),skolemize(X4,sK12),skolemize(X5,sK13)],[f38])).
% 0.21/0.30  thf(f40,plain,(
% 0.21/0.30    (setukpairinjL2 = $true) & (secondinupair = $true) & (upairset2E = $true) & (upairequniteq = $true) & ? [X0 : $i,X1 : $i,X2 : $i,X3 : $i] : ((((setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ emptyset))) = ((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X3 @ emptyset)) @ emptyset)))) & (X2 != X3)) & (setukpairinjR1 = $true)),
% 0.21/0.30    inference(rectify,[],[f23])).
% 0.21/0.30  thf(f41,plain,(
% 0.21/0.30    (setukpairinjL2 = $true) & (secondinupair = $true) & (upairset2E = $true) & (upairequniteq = $true) & ((((setadjoin @ (setadjoin @ sK15 @ emptyset) @ (setadjoin @ (setadjoin @ sK15 @ (setadjoin @ sK16 @ emptyset)) @ emptyset))) = ((setadjoin @ (setadjoin @ sK14 @ emptyset) @ (setadjoin @ (setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset)) @ emptyset)))) & (sK17 != sK16)) & (setukpairinjR1 = $true)),
% 0.21/0.30    inference(skolemize,[status(esa),new_symbols(skolem,[sK14,sK15,sK16,sK17]),skolemize(X0,sK14),skolemize(X1,sK15),skolemize(X2,sK16),skolemize(X3,sK17)],[f40])).
% 0.21/0.30  thf(f42,plain,(
% 0.21/0.30    (! [X0 : $i,X1 : $i] : ($true = ((in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset))))) | (secondinupair != $true)) & ((secondinupair = $true) | ? [X0 : $i,X1 : $i] : ($true != ((in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset))))))),
% 0.21/0.30    inference(nnf_transformation,[],[f13])).
% 0.21/0.30  thf(f43,plain,(
% 0.21/0.30    (! [X0 : $i,X1 : $i] : ($true = ((in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset))))) | (secondinupair != $true)) & ((secondinupair = $true) | ? [X2 : $i,X3 : $i] : (((in @ X2 @ (setadjoin @ X3 @ (setadjoin @ X2 @ emptyset)))) != $true))),
% 0.21/0.30    inference(rectify,[],[f42])).
% 0.21/0.30  thf(f44,plain,(
% 0.21/0.30    (! [X0 : $i,X1 : $i] : ($true = ((in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset))))) | (secondinupair != $true)) & ((secondinupair = $true) | ($true != ((in @ sK18 @ (setadjoin @ sK19 @ (setadjoin @ sK18 @ emptyset))))))),
% 0.21/0.30    inference(skolemize,[status(esa),new_symbols(skolem,[sK18,sK19]),skolemize(X2,sK18),skolemize(X3,sK19)],[f43])).
% 0.21/0.30  thf(f47,plain,(
% 0.21/0.30    ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : ((X2 = X3) | (((setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) != ((setadjoin @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X3 @ (setadjoin @ X0 @ emptyset)) @ emptyset)))) | (setukpairinjL2 != $true)) )),
% 0.21/0.30    inference(cnf_transformation,[],[f30])).
% 0.21/0.30  thf(f58,plain,(
% 0.21/0.30    ( ! [X2 : $i,X0 : $i,X1 : $i] : ((X1 = X2) | (((in @ X1 @ (setadjoin @ X2 @ (setadjoin @ X0 @ emptyset)))) != $true) | (upairset2E != $true) | (X0 = X1)) )),
% 0.21/0.30    inference(cnf_transformation,[],[f39])).
% 0.21/0.30  thf(f60,plain,(
% 0.21/0.30    (sK17 != sK16)),
% 0.21/0.30    inference(cnf_transformation,[],[f41])).
% 0.21/0.30  thf(f61,plain,(
% 0.21/0.30    (((setadjoin @ (setadjoin @ sK15 @ emptyset) @ (setadjoin @ (setadjoin @ sK15 @ (setadjoin @ sK16 @ emptyset)) @ emptyset))) = ((setadjoin @ (setadjoin @ sK14 @ emptyset) @ (setadjoin @ (setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset)) @ emptyset))))),
% 0.21/0.30    inference(cnf_transformation,[],[f41])).
% 0.21/0.30  thf(f63,plain,(
% 0.21/0.30    (upairset2E = $true)),
% 0.21/0.30    inference(cnf_transformation,[],[f41])).
% 0.21/0.30  thf(f64,plain,(
% 0.21/0.30    (secondinupair = $true)),
% 0.21/0.30    inference(cnf_transformation,[],[f41])).
% 0.21/0.30  thf(f65,plain,(
% 0.21/0.30    (setukpairinjL2 = $true)),
% 0.21/0.30    inference(cnf_transformation,[],[f41])).
% 0.21/0.30  thf(f67,plain,(
% 0.21/0.30    ( ! [X0 : $i,X1 : $i] : ((secondinupair != $true) | ($true = ((in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)))))) )),
% 0.21/0.30    inference(cnf_transformation,[],[f44])).
% 0.21/0.30  thf(f79,definition,(
% 0.21/0.30    spl20_3 <=> (secondinupair = $true)),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl20_3])],[avatar_definition])).
% 0.21/0.30  thf(f93,definition,(
% 0.21/0.30    spl20_6 <=> (sK17 = sK16)),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl20_6])],[avatar_definition])).
% 0.21/0.30  thf(f95,plain,(
% 0.21/0.30    (sK17 != sK16) | spl20_6),
% 0.21/0.30    inference(avatar_component_clause,[],[f93])).
% 0.21/0.30  thf(f96,plain,(
% 0.21/0.30    ~spl20_6),
% 0.21/0.30    inference(avatar_split_clause,[],[f60,f93])).
% 0.21/0.30  thf(f98,definition,(
% 0.21/0.30    spl20_7 <=> ! [X0 : $i,X3 : $i,X2 : $i,X1 : $i] : ((X2 = X3) | (((setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) != ((setadjoin @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X3 @ (setadjoin @ X0 @ emptyset)) @ emptyset)))))),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl20_7])],[avatar_definition])).
% 0.21/0.30  thf(f99,plain,(
% 0.21/0.30    ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : ((((setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) != ((setadjoin @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X3 @ (setadjoin @ X0 @ emptyset)) @ emptyset)))) | (X2 = X3)) ) | ~spl20_7),
% 0.21/0.30    inference(avatar_component_clause,[],[f98])).
% 0.21/0.30  thf(f101,definition,(
% 0.21/0.30    spl20_8 <=> (setukpairinjL2 = $true)),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl20_8])],[avatar_definition])).
% 0.21/0.30  thf(f104,plain,(
% 0.21/0.30    spl20_7 | ~spl20_8),
% 0.21/0.30    inference(avatar_split_clause,[],[f47,f101,f98])).
% 0.21/0.30  thf(f119,definition,(
% 0.21/0.30    spl20_12 <=> (upairset2E = $true)),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl20_12])],[avatar_definition])).
% 0.21/0.30  thf(f140,definition,(
% 0.21/0.30    spl20_16 <=> (((setadjoin @ (setadjoin @ sK15 @ emptyset) @ (setadjoin @ (setadjoin @ sK15 @ (setadjoin @ sK16 @ emptyset)) @ emptyset))) = ((setadjoin @ (setadjoin @ sK14 @ emptyset) @ (setadjoin @ (setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset)) @ emptyset))))),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl20_16])],[avatar_definition])).
% 0.21/0.30  thf(f142,plain,(
% 0.21/0.30    (((setadjoin @ (setadjoin @ sK15 @ emptyset) @ (setadjoin @ (setadjoin @ sK15 @ (setadjoin @ sK16 @ emptyset)) @ emptyset))) = ((setadjoin @ (setadjoin @ sK14 @ emptyset) @ (setadjoin @ (setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset)) @ emptyset)))) | ~spl20_16),
% 0.21/0.30    inference(avatar_component_clause,[],[f140])).
% 0.21/0.30  thf(f143,plain,(
% 0.21/0.30    spl20_16),
% 0.21/0.30    inference(avatar_split_clause,[],[f61,f140])).
% 0.21/0.30  thf(f145,definition,(
% 0.21/0.30    spl20_17 <=> ! [X0 : $i,X1 : $i] : ($true = ((in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)))))),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl20_17])],[avatar_definition])).
% 0.21/0.30  thf(f146,plain,(
% 0.21/0.30    ( ! [X0 : $i,X1 : $i] : (($true = ((in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)))))) ) | ~spl20_17),
% 0.21/0.30    inference(avatar_component_clause,[],[f145])).
% 0.21/0.30  thf(f147,plain,(
% 0.21/0.30    spl20_17 | ~spl20_3),
% 0.21/0.30    inference(avatar_split_clause,[],[f67,f79,f145])).
% 0.21/0.30  thf(f153,plain,(
% 0.21/0.30    spl20_8),
% 0.21/0.30    inference(avatar_split_clause,[],[f65,f101])).
% 0.21/0.30  thf(f165,definition,(
% 0.21/0.30    spl20_21 <=> ! [X2 : $i,X0 : $i,X1 : $i] : ((X1 = X2) | (X0 = X1) | (((in @ X1 @ (setadjoin @ X2 @ (setadjoin @ X0 @ emptyset)))) != $true))),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl20_21])],[avatar_definition])).
% 0.21/0.30  thf(f166,plain,(
% 0.21/0.30    ( ! [X2 : $i,X0 : $i,X1 : $i] : ((((in @ X1 @ (setadjoin @ X2 @ (setadjoin @ X0 @ emptyset)))) != $true) | (X0 = X1) | (X1 = X2)) ) | ~spl20_21),
% 0.21/0.30    inference(avatar_component_clause,[],[f165])).
% 0.21/0.30  thf(f167,plain,(
% 0.21/0.30    spl20_21 | ~spl20_12),
% 0.21/0.30    inference(avatar_split_clause,[],[f58,f119,f165])).
% 0.21/0.30  thf(f173,plain,(
% 0.21/0.30    spl20_12),
% 0.21/0.30    inference(avatar_split_clause,[],[f63,f119])).
% 0.21/0.30  thf(f179,plain,(
% 0.21/0.30    spl20_3),
% 0.21/0.30    inference(avatar_split_clause,[],[f64,f79])).
% 0.21/0.30  thf(f185,plain,(
% 0.21/0.30    ($true = ((in @ (setadjoin @ sK15 @ (setadjoin @ sK16 @ emptyset)) @ (setadjoin @ (setadjoin @ sK14 @ emptyset) @ (setadjoin @ (setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset)) @ emptyset))))) | (~spl20_16 | ~spl20_17)),
% 0.21/0.30    inference(superposition,[],[f146,f142])).
% 0.21/0.30  thf(f187,definition,(
% 0.21/0.30    spl20_24 <=> ($true = ((in @ (setadjoin @ sK15 @ (setadjoin @ sK16 @ emptyset)) @ (setadjoin @ (setadjoin @ sK14 @ emptyset) @ (setadjoin @ (setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset)) @ emptyset)))))),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl20_24])],[avatar_definition])).
% 0.21/0.30  thf(f189,plain,(
% 0.21/0.30    ($true = ((in @ (setadjoin @ sK15 @ (setadjoin @ sK16 @ emptyset)) @ (setadjoin @ (setadjoin @ sK14 @ emptyset) @ (setadjoin @ (setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset)) @ emptyset))))) | ~spl20_24),
% 0.21/0.30    inference(avatar_component_clause,[],[f187])).
% 0.21/0.30  thf(f190,plain,(
% 0.21/0.30    spl20_24 | ~spl20_16 | ~spl20_17),
% 0.21/0.30    inference(avatar_split_clause,[],[f185,f145,f140,f187])).
% 0.21/0.30  thf(f200,plain,(
% 0.21/0.30    ( ! [X0 : $i] : ((((in @ X0 @ (setadjoin @ (setadjoin @ sK14 @ emptyset) @ (setadjoin @ (setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset)) @ emptyset)))) != $true) | (((setadjoin @ sK15 @ (setadjoin @ sK16 @ emptyset))) = X0) | (((setadjoin @ sK15 @ emptyset)) = X0)) ) | (~spl20_16 | ~spl20_21)),
% 0.21/0.30    inference(superposition,[],[f166,f142])).
% 0.21/0.30  thf(f201,plain,(
% 0.21/0.30    (((setadjoin @ sK15 @ (setadjoin @ sK16 @ emptyset))) = ((setadjoin @ sK14 @ emptyset))) | ($true != $true) | (((setadjoin @ sK15 @ (setadjoin @ sK16 @ emptyset))) = ((setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset)))) | (~spl20_21 | ~spl20_24)),
% 0.21/0.30    inference(superposition,[],[f166,f189])).
% 0.21/0.30  thf(f202,plain,(
% 0.21/0.30    (((setadjoin @ sK15 @ (setadjoin @ sK16 @ emptyset))) = ((setadjoin @ sK14 @ emptyset))) | (((setadjoin @ sK15 @ (setadjoin @ sK16 @ emptyset))) = ((setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset)))) | (~spl20_21 | ~spl20_24)),
% 0.21/0.30    inference(trivial_inequality_removal,[],[f201])).
% 0.21/0.30  thf(f204,definition,(
% 0.21/0.30    spl20_27 <=> (((setadjoin @ sK15 @ (setadjoin @ sK16 @ emptyset))) = ((setadjoin @ sK14 @ emptyset)))),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl20_27])],[avatar_definition])).
% 0.21/0.30  thf(f208,definition,(
% 0.21/0.30    spl20_28 <=> (((setadjoin @ sK15 @ (setadjoin @ sK16 @ emptyset))) = ((setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset))))),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl20_28])],[avatar_definition])).
% 0.21/0.30  thf(f210,plain,(
% 0.21/0.30    (((setadjoin @ sK15 @ (setadjoin @ sK16 @ emptyset))) = ((setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset)))) | ~spl20_28),
% 0.21/0.30    inference(avatar_component_clause,[],[f208])).
% 0.21/0.30  thf(f211,plain,(
% 0.21/0.30    spl20_27 | spl20_28 | ~spl20_21 | ~spl20_24),
% 0.21/0.30    inference(avatar_split_clause,[],[f202,f187,f165,f208,f204])).
% 0.21/0.30  thf(f245,plain,(
% 0.21/0.30    ( ! [X0 : $i,X1 : $i] : ((((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) != ((setadjoin @ (setadjoin @ sK14 @ emptyset) @ (setadjoin @ (setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset)) @ emptyset)))) | (sK15 = X0)) ) | (~spl20_7 | ~spl20_16)),
% 0.21/0.30    inference(superposition,[],[f99,f142])).
% 0.21/0.30  thf(f256,plain,(
% 0.21/0.30    (((in @ sK16 @ (setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset)))) = $true) | (~spl20_17 | ~spl20_28)),
% 0.21/0.30    inference(superposition,[],[f146,f210])).
% 0.21/0.30  thf(f263,definition,(
% 0.21/0.30    spl20_35 <=> (((in @ sK16 @ (setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset)))) = $true)),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl20_35])],[avatar_definition])).
% 0.21/0.30  thf(f265,plain,(
% 0.21/0.30    (((in @ sK16 @ (setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset)))) = $true) | ~spl20_35),
% 0.21/0.30    inference(avatar_component_clause,[],[f263])).
% 0.21/0.30  thf(f266,plain,(
% 0.21/0.30    spl20_35 | ~spl20_17 | ~spl20_28),
% 0.21/0.30    inference(avatar_split_clause,[],[f256,f208,f145,f263])).
% 0.21/0.30  thf(f271,plain,(
% 0.21/0.30    (((setadjoin @ sK15 @ emptyset)) = ((setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset)))) | ($true != $true) | (((setadjoin @ sK15 @ (setadjoin @ sK16 @ emptyset))) = ((setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset)))) | (~spl20_16 | ~spl20_17 | ~spl20_21)),
% 0.21/0.30    inference(superposition,[],[f200,f146])).
% 0.21/0.30  thf(f272,plain,(
% 0.21/0.30    (((setadjoin @ sK15 @ (setadjoin @ sK16 @ emptyset))) = ((setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset)))) | (((setadjoin @ sK15 @ emptyset)) = ((setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset)))) | (~spl20_16 | ~spl20_17 | ~spl20_21)),
% 0.21/0.30    inference(trivial_inequality_removal,[],[f271])).
% 0.21/0.30  thf(f274,definition,(
% 0.21/0.30    spl20_37 <=> (((setadjoin @ sK15 @ emptyset)) = ((setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset))))),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl20_37])],[avatar_definition])).
% 0.21/0.30  thf(f277,plain,(
% 0.21/0.30    spl20_37 | spl20_28 | ~spl20_16 | ~spl20_17 | ~spl20_21),
% 0.21/0.30    inference(avatar_split_clause,[],[f272,f165,f145,f140,f208,f274])).
% 0.21/0.30  thf(f297,plain,(
% 0.21/0.30    (sK15 = sK14) | (~spl20_7 | ~spl20_16)),
% 0.21/0.30    inference(equality_resolution,[],[f245])).
% 0.21/0.30  thf(f308,definition,(
% 0.21/0.30    spl20_43 <=> (sK15 = sK14)),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl20_43])],[avatar_definition])).
% 0.21/0.30  thf(f310,plain,(
% 0.21/0.30    (sK15 = sK14) | ~spl20_43),
% 0.21/0.30    inference(avatar_component_clause,[],[f308])).
% 0.21/0.30  thf(f311,plain,(
% 0.21/0.30    spl20_43 | ~spl20_7 | ~spl20_16),
% 0.21/0.30    inference(avatar_split_clause,[],[f297,f140,f98,f308])).
% 0.21/0.30  thf(f334,plain,(
% 0.21/0.30    (((setadjoin @ sK14 @ (setadjoin @ sK16 @ emptyset))) = ((setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset)))) | (~spl20_28 | ~spl20_43)),
% 0.21/0.30    inference(forward_demodulation,[],[f210,f310])).
% 0.21/0.30  thf(f336,definition,(
% 0.21/0.30    spl20_47 <=> (((setadjoin @ sK14 @ (setadjoin @ sK16 @ emptyset))) = ((setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset))))),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl20_47])],[avatar_definition])).
% 0.21/0.30  thf(f338,plain,(
% 0.21/0.30    (((setadjoin @ sK14 @ (setadjoin @ sK16 @ emptyset))) = ((setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset)))) | ~spl20_47),
% 0.21/0.30    inference(avatar_component_clause,[],[f336])).
% 0.21/0.30  thf(f339,plain,(
% 0.21/0.30    spl20_47 | ~spl20_28 | ~spl20_43),
% 0.21/0.30    inference(avatar_split_clause,[],[f334,f308,f208,f336])).
% 0.21/0.30  thf(f340,definition,(
% 0.21/0.30    (sK15 != sK14) | (((setadjoin @ sK15 @ (setadjoin @ sK16 @ emptyset))) != ((setadjoin @ sK14 @ emptyset))) | (((setadjoin @ sK15 @ emptyset)) != ((setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset)))) | (((setadjoin @ sK15 @ (setadjoin @ sK16 @ emptyset))) = ((setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset))))),
% 0.21/0.30    introduced(theory,[theory_tautology_sat_conflict])).
% 0.21/0.30  thf(f356,definition,(
% 0.21/0.30    spl20_49 <=> (sK16 = sK14)),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl20_49])],[avatar_definition])).
% 0.21/0.30  thf(f358,plain,(
% 0.21/0.30    (sK16 = sK14) | ~spl20_49),
% 0.21/0.30    inference(avatar_component_clause,[],[f356])).
% 0.21/0.30  thf(f389,definition,(
% 0.21/0.30    spl20_51 <=> (sK17 = sK14)),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl20_51])],[avatar_definition])).
% 0.21/0.30  thf(f502,plain,(
% 0.21/0.30    ( ! [X0 : $i] : (($true != ((in @ X0 @ (setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset))))) | (sK16 = X0) | (sK14 = X0)) ) | (~spl20_21 | ~spl20_47)),
% 0.21/0.30    inference(superposition,[],[f166,f338])).
% 0.21/0.30  thf(f512,plain,(
% 0.21/0.30    (sK17 != sK14) | (spl20_6 | ~spl20_49)),
% 0.21/0.30    inference(superposition,[],[f95,f358])).
% 0.21/0.30  thf(f522,plain,(
% 0.21/0.30    ~spl20_51 | spl20_6 | ~spl20_49),
% 0.21/0.30    inference(avatar_split_clause,[],[f512,f356,f93,f389])).
% 0.21/0.30  thf(f531,plain,(
% 0.21/0.30    ( ! [X0 : $i] : (($true != ((in @ X0 @ (setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset))))) | (sK14 = X0) | (sK14 = X0)) ) | (~spl20_21 | ~spl20_47 | ~spl20_49)),
% 0.21/0.30    inference(forward_demodulation,[],[f502,f358])).
% 0.21/0.30  thf(f532,plain,(
% 0.21/0.30    ( ! [X0 : $i] : (($true != ((in @ X0 @ (setadjoin @ sK14 @ (setadjoin @ sK17 @ emptyset))))) | (sK14 = X0)) ) | (~spl20_21 | ~spl20_47 | ~spl20_49)),
% 0.21/0.30    inference(duplicate_literal_removal,[],[f531])).
% 0.21/0.30  thf(f533,plain,(
% 0.21/0.30    (sK17 = sK14) | ($true != $true) | (~spl20_17 | ~spl20_21 | ~spl20_47 | ~spl20_49)),
% 0.21/0.30    inference(superposition,[],[f532,f146])).
% 0.21/0.30  thf(f534,plain,(
% 0.21/0.30    (sK17 = sK14) | (~spl20_17 | ~spl20_21 | ~spl20_47 | ~spl20_49)),
% 0.21/0.30    inference(trivial_inequality_removal,[],[f533])).
% 0.21/0.30  thf(f535,plain,(
% 0.21/0.30    spl20_51 | ~spl20_17 | ~spl20_21 | ~spl20_47 | ~spl20_49),
% 0.21/0.30    inference(avatar_split_clause,[],[f534,f356,f336,f165,f145,f389])).
% 0.21/0.30  thf(f576,plain,(
% 0.21/0.30    (sK17 = sK16) | (sK16 = sK14) | ($true != $true) | (~spl20_21 | ~spl20_35)),
% 0.21/0.30    inference(superposition,[],[f166,f265])).
% 0.21/0.30  thf(f577,plain,(
% 0.21/0.30    (sK16 = sK14) | (sK17 = sK16) | (~spl20_21 | ~spl20_35)),
% 0.21/0.30    inference(trivial_inequality_removal,[],[f576])).
% 0.21/0.30  thf(f578,plain,(
% 0.21/0.30    (sK16 = sK14) | (spl20_6 | ~spl20_21 | ~spl20_35)),
% 0.21/0.30    inference(forward_subsumption_resolution,[],[f577,f95])).
% 0.21/0.30  thf(f579,plain,(
% 0.21/0.30    spl20_49 | spl20_6 | ~spl20_21 | ~spl20_35),
% 0.21/0.30    inference(avatar_split_clause,[],[f578,f263,f165,f93,f356])).
% 0.21/0.30  cnf(s4, plain, ~spl20_6, inference(sat_conversion,[],[f96])).
% 0.21/0.30  cnf(s5, plain, spl20_7 | ~spl20_8, inference(sat_conversion,[],[f104])).
% 0.21/0.30  cnf(s12, plain, spl20_16, inference(sat_conversion,[],[f143])).
% 0.21/0.30  cnf(s13, plain, ~spl20_3 | spl20_17, inference(sat_conversion,[],[f147])).
% 0.21/0.30  cnf(s15, plain, spl20_8, inference(sat_conversion,[],[f153])).
% 0.21/0.30  cnf(s19, plain, ~spl20_12 | spl20_21, inference(sat_conversion,[],[f167])).
% 0.21/0.30  cnf(s21, plain, spl20_12, inference(sat_conversion,[],[f173])).
% 0.21/0.30  cnf(s23, plain, spl20_3, inference(sat_conversion,[],[f179])).
% 0.21/0.30  cnf(s24, plain, ~spl20_16 | ~spl20_17 | spl20_24, inference(sat_conversion,[],[f190])).
% 0.21/0.30  cnf(s26, plain, ~spl20_21 | ~spl20_24 | spl20_27 | spl20_28, inference(sat_conversion,[],[f211])).
% 0.21/0.30  cnf(s32, plain, ~spl20_17 | ~spl20_28 | spl20_35, inference(sat_conversion,[],[f266])).
% 0.21/0.30  cnf(s34, plain, ~spl20_16 | ~spl20_17 | ~spl20_21 | spl20_28 | spl20_37, inference(sat_conversion,[],[f277])).
% 0.21/0.30  cnf(s39, plain, ~spl20_7 | ~spl20_16 | spl20_43, inference(sat_conversion,[],[f311])).
% 0.21/0.30  cnf(s44, plain, ~spl20_28 | ~spl20_43 | spl20_47, inference(sat_conversion,[],[f339])).
% 0.21/0.30  cnf(s45, plain, ~spl20_27 | spl20_28 | ~spl20_37 | ~spl20_43, inference(sat_conversion,[],[f340])).
% 0.21/0.30  cnf(s80, plain, spl20_6 | ~spl20_49 | ~spl20_51, inference(sat_conversion,[],[f522])).
% 0.21/0.30  cnf(s84, plain, ~spl20_17 | ~spl20_21 | ~spl20_47 | ~spl20_49 | spl20_51, inference(sat_conversion,[],[f535])).
% 0.21/0.30  cnf(s93, plain, spl20_6 | ~spl20_21 | ~spl20_35 | spl20_49, inference(sat_conversion,[],[f579])).
% 0.21/0.30  cnf(s94, plain, spl20_21, inference(rat,[],[s19,s21])).
% 0.21/0.30  cnf(s96, plain, spl20_17, inference(rat,[],[s13,s23])).
% 0.21/0.30  cnf(s97, plain, spl20_24, inference(rat,[],[s24,s96,s12])).
% 0.21/0.30  cnf(s98, plain, spl20_7, inference(rat,[],[s5,s15])).
% 0.21/0.30  cnf(s99, plain, spl20_43, inference(rat,[],[s39,s12,s98])).
% 0.21/0.30  cnf(s103, plain, ~spl20_28, inference(rat,[],[s84,s80,s93,s32,s44,s94,s96,s4,s99])).
% 0.21/0.30  cnf(s104, plain, spl20_37, inference(rat,[],[s34,s12,s96,s94,s103])).
% 0.21/0.30  cnf(s105, plain, spl20_27, inference(rat,[],[s26,s97,s94,s103])).
% 0.21/0.30  cnf(s107, plain, $false, inference(rat,[],[s45,s99,s103,s105,s104])).
% 0.21/0.30  thf(f580,plain,(
% 0.21/0.30    $false),
% 0.21/0.30    inference(avatar_sat_refutation,[],[s107])).
% 0.21/0.30  % SZS output end Proof for theBenchmark
% 0.21/0.30  % (1718267)------------------------------
% 0.21/0.30  % (1718267)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.30  % (1718267)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.30  % (1718267)CaDiCaL version: 2.1.3
% 0.21/0.30  % (1718267)Termination reason: Refutation
% 0.21/0.30  % (1718267)Time elapsed: 0.020 s
% 0.21/0.30  % (1718267)Peak memory usage: 13 MB
% 0.21/0.30  % (1718267)Instructions burned: 46 (million)
% 0.21/0.30  % (1718259)Success in time 0.048 s
% 0.21/0.30  % Vampire exiting
%------------------------------------------------------------------------------