%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV449^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:38:39 AM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV449^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.17 % Computer : n009.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Tue Sep 29 15:48:29 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.21 Running higher-order theorem proving
% 0.07/0.22 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.20/0.28 % (4168963)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.28 % (4168971)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2566265590:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.20/0.28 % (4168971)Refutation not found, incomplete strategy
% 0.20/0.28 % (4168971)------------------------------
% 0.20/0.28 % (4168971)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (4168971)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (4168971)CaDiCaL version: 2.1.3
% 0.20/0.28 % (4168971)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.28 % (4168971)Time elapsed: 0.001 s
% 0.20/0.28 % (4168971)Peak memory usage: 12 MB
% 0.20/0.28 % (4168971)Instructions burned: 3 (million)
% 0.20/0.28 % (4168971)------------------------------
% 0.20/0.28 % (4168971)------------------------------
% 0.20/0.28 % (4168975)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.20/0.28 % (4168975)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.20/0.28 % (4168970)lrs+10_16_si=on:nwc=1.5:random_seed=3299321351:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.20/0.28 % (4168972)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=1283566552: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.20/0.28 % (4168969)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1615019981:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.28 % (4168973)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=1404123383:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.20/0.28 % (4168974)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2808803626:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.20/0.28 % (4168975)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=4017524923:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.20/0.28 % (4168977)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=3017121433:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.20/0.28 % (4168977)Instruction limit reached!
% 0.20/0.28 % (4168977)------------------------------
% 0.20/0.28 % (4168977)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (4168977)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (4168977)CaDiCaL version: 2.1.3
% 0.20/0.28 % (4168977)Termination reason: Instruction limit
% 0.20/0.28 % (4168977)Termination phase: Saturation
% 0.20/0.28 % (4168977)Time elapsed: 0.001 s
% 0.20/0.28 % (4168977)Peak memory usage: 12 MB
% 0.20/0.28 % (4168977)Instructions burned: 2 (million)
% 0.20/0.28 % (4168970)Instruction limit reached!
% 0.20/0.28 % (4168970)------------------------------
% 0.20/0.28 % (4168970)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (4168970)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (4168970)CaDiCaL version: 2.1.3
% 0.20/0.28 % (4168970)Termination reason: Instruction limit
% 0.20/0.28 % (4168970)Termination phase: Saturation
% 0.20/0.28 % (4168970)Time elapsed: 0.012 s
% 0.20/0.28 % (4168970)Peak memory usage: 12 MB
% 0.20/0.28 % (4168970)Instructions burned: 20 (million)
% 0.20/0.28 % (4168972) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4168963-4168972"...
% 0.20/0.28 % (4168973)Instruction limit reached!
% 0.20/0.28 % (4168973)------------------------------
% 0.20/0.28 % (4168973)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (4168973)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (4168973)CaDiCaL version: 2.1.3
% 0.20/0.28 % (4168973)Termination reason: Instruction limit
% 0.20/0.28 % (4168973)Termination phase: Saturation
% 0.20/0.28 % (4168973)Time elapsed: 0.015 s
% 0.20/0.28 % (4168973)Peak memory usage: 12 MB
% 0.20/0.28 % (4168973)Instructions burned: 24 (million)
% 0.20/0.28 % (4168985)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=1529232575:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.20/0.28 % (4168972)...printing done.
% 0.20/0.28 % (4168972)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Theorem for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% 0.20/0.28 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.20/0.28 thf(type_def_6, type, sK2: $tType).
% 0.20/0.28 thf(func_def_0, type, 'const/sets/SUBSET': !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > $o))).
% 0.20/0.28 thf(func_def_1, type, 'const/sets/PSUBSET': !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > $o))).
% 0.20/0.28 thf(func_def_2, type, 'const/sets/IN': !>[X0: $tType]:((X0 > (X0 > $o) > $o))).
% 0.20/0.28 thf(func_def_6, type, sK0: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.20/0.28 thf(func_def_7, type, sK1: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.20/0.28 thf(func_def_8, type, sK3: (sK2 > $o)).
% 0.20/0.28 thf(func_def_9, type, sK4: (sK2 > $o)).
% 0.20/0.28 thf(func_def_10, type, sK5: (sK2 > $o)).
% 0.20/0.28 thf(func_def_11, type, vNOT: ($o > $o)).
% 0.20/0.28 thf(f2,axiom,(
% 0.20/0.28 ! [X0 : $tType,X2 : (X0 > $o),X1 : (X0 > $o)] : (! [X3 : X0] : ((('const/sets/IN' @ X0 @ X3 @ X1)) = (('const/sets/IN' @ X0 @ X3 @ X2))) = (X1 = X2))),
% 0.20/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/EXTENSION_')).
% 0.20/0.28 thf(f3,axiom,(
% 0.20/0.28 ! [X0 : $tType,X1 : (X0 > $o),X2 : (X0 > $o)] : (! [X3 : X0] : (('const/sets/IN' @ X0 @ X3 @ X1) => ('const/sets/IN' @ X0 @ X3 @ X2)) = (('const/sets/SUBSET' @ X0 @ X1 @ X2)))),
% 0.20/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/SUBSET_')).
% 0.20/0.28 thf(f4,axiom,(
% 0.20/0.28 ! [X0 : $tType,X2 : (X0 > $o),X1 : (X0 > $o)] : (('const/sets/SUBSET' @ X0 @ X1 @ X2) & (X1 != X2) = (('const/sets/PSUBSET' @ X0 @ X1 @ X2)))),
% 0.20/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/PSUBSET_')).
% 0.20/0.28 thf(f5,conjecture,(
% 0.20/0.28 ! [X0 : $tType,X2 : (X0 > $o),X1 : (X0 > $o),X3 : (X0 > $o)] : ((('const/sets/SUBSET' @ X0 @ X2 @ X3) & ('const/sets/PSUBSET' @ X0 @ X1 @ X2)) => ('const/sets/PSUBSET' @ X0 @ X1 @ X3))),
% 0.20/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/PSUBSET_SUBSET_TRANS_')).
% 0.20/0.28 thf(f6,negated_conjecture,(
% 0.20/0.28 ~ ! [X0 : $tType,X2 : (X0 > $o),X1 : (X0 > $o),X3 : (X0 > $o)] : ((('const/sets/SUBSET' @ X0 @ X2 @ X3) & ('const/sets/PSUBSET' @ X0 @ X1 @ X2)) => ('const/sets/PSUBSET' @ X0 @ X1 @ X3))),
% 0.20/0.28 inference(negated_conjecture,[status(cth)],[f5])).
% 0.20/0.28 thf(f7,plain,(
% 0.20/0.28 ! [X0 : $tType,X1 : (X0 > $o),X2 : (X0 > $o)] : (! [X3 : X0] : ((('const/sets/IN' @ X0 @ X3 @ X1)) = (('const/sets/IN' @ X0 @ X3 @ X2))) = (X1 = X2))),
% 0.20/0.28 inference(rectify,[],[f2])).
% 0.20/0.28 thf(f8,plain,(
% 0.20/0.28 ! [X0 : $tType,X1 : (X0 > $o),X2 : (X0 > $o)] : (! [X3 : X0] : ((('const/sets/IN' @ X0 @ X3 @ X1)) = (('const/sets/IN' @ X0 @ X3 @ X2))) <=> (X1 = X2))),
% 0.20/0.28 inference(fool_elimination,[],[f7])).
% 0.20/0.28 thf(f9,plain,(
% 0.20/0.28 ~ ! [X0 : $tType,X1 : (X0 > $o),X2 : (X0 > $o),X3 : (X0 > $o)] : ((('const/sets/SUBSET' @ X0 @ X1 @ X3) & ('const/sets/PSUBSET' @ X0 @ X2 @ X1)) => ('const/sets/PSUBSET' @ X0 @ X2 @ X3))),
% 0.20/0.28 inference(rectify,[],[f6])).
% 0.20/0.28 thf(f10,plain,(
% 0.20/0.28 ~ ! [X0 : $tType,X2 : (X0 > $o),X3 : (X0 > $o),X1 : (X0 > $o)] : ((($true = (('const/sets/PSUBSET' @ X0 @ X2 @ X1))) & ($true = (('const/sets/SUBSET' @ X0 @ X1 @ X3)))) => ($true = (('const/sets/PSUBSET' @ X0 @ X2 @ X3))))),
% 0.20/0.28 inference(fool_elimination,[],[f9])).
% 0.20/0.28 thf(f11,plain,(
% 0.20/0.28 ! [X0 : $tType,X1 : (X0 > $o),X2 : (X0 > $o)] : (! [X3 : X0] : (('const/sets/IN' @ X0 @ X3 @ X1) => ('const/sets/IN' @ X0 @ X3 @ X2)) = (('const/sets/SUBSET' @ X0 @ X1 @ X2)))),
% 0.20/0.28 inference(rectify,[],[f3])).
% 0.20/0.28 thf(f12,plain,(
% 0.20/0.28 ! [X0 : $tType,X2 : (X0 > $o),X1 : (X0 > $o)] : (((('const/sets/SUBSET' @ X0 @ X1 @ X2)) = $true) <=> ! [X3 : X0] : (((('const/sets/IN' @ X0 @ X3 @ X1)) = $true) => ((('const/sets/IN' @ X0 @ X3 @ X2)) = $true)))),
% 0.20/0.28 inference(fool_elimination,[],[f11])).
% 0.20/0.28 thf(f13,plain,(
% 0.20/0.28 ! [X0 : $tType,X1 : (X0 > $o),X2 : (X0 > $o)] : (('const/sets/SUBSET' @ X0 @ X2 @ X1) & (X1 != X2) = (('const/sets/PSUBSET' @ X0 @ X2 @ X1)))),
% 0.20/0.28 inference(rectify,[],[f4])).
% 0.20/0.28 thf(f14,plain,(
% 0.20/0.28 ! [X0 : $tType,X1 : (X0 > $o),X2 : (X0 > $o)] : (((X1 != X2) & ($true = (('const/sets/SUBSET' @ X0 @ X2 @ X1)))) <=> ($true = (('const/sets/PSUBSET' @ X0 @ X2 @ X1))))),
% 0.20/0.28 inference(fool_elimination,[],[f13])).
% 0.20/0.28 thf(f16,plain,(
% 0.20/0.28 ! [X0 : $tType,X1 : (X0 > $o),X2 : (X0 > $o)] : (! [X3 : X0] : (((('const/sets/IN' @ X0 @ X3 @ X2)) = $true) | ((('const/sets/IN' @ X0 @ X3 @ X1)) != $true)) <=> ((('const/sets/SUBSET' @ X0 @ X1 @ X2)) = $true))),
% 0.20/0.28 inference(ennf_transformation,[],[f12])).
% 0.20/0.28 thf(f17,plain,(
% 0.20/0.28 ? [X0 : $tType,X2 : (X0 > $o),X3 : (X0 > $o),X1 : (X0 > $o)] : (($true != (('const/sets/PSUBSET' @ X0 @ X2 @ X3))) & (($true = (('const/sets/PSUBSET' @ X0 @ X2 @ X1))) & ($true = (('const/sets/SUBSET' @ X0 @ X1 @ X3)))))),
% 0.20/0.28 inference(ennf_transformation,[],[f10])).
% 0.20/0.28 thf(f18,plain,(
% 0.20/0.28 ? [X0 : $tType,X1 : (X0 > $o),X3 : (X0 > $o),X2 : (X0 > $o)] : (($true = (('const/sets/PSUBSET' @ X0 @ X2 @ X1))) & ($true != (('const/sets/PSUBSET' @ X0 @ X2 @ X3))) & ($true = (('const/sets/SUBSET' @ X0 @ X1 @ X3))))),
% 0.20/0.28 inference(flattening,[],[f17])).
% 0.20/0.28 thf(f19,plain,(
% 0.20/0.28 ! [X0 : $tType,X1 : (X0 > $o),X2 : (X0 > $o)] : ((! [X3 : X0] : (((('const/sets/IN' @ X0 @ X3 @ X2)) = $true) | ((('const/sets/IN' @ X0 @ X3 @ X1)) != $true)) | ((('const/sets/SUBSET' @ X0 @ X1 @ X2)) != $true)) & (((('const/sets/SUBSET' @ X0 @ X1 @ X2)) = $true) | ? [X3 : X0] : (((('const/sets/IN' @ X0 @ X3 @ X2)) != $true) & ((('const/sets/IN' @ X0 @ X3 @ X1)) = $true))))),
% 0.20/0.28 inference(nnf_transformation,[],[f16])).
% 0.20/0.28 thf(f20,plain,(
% 0.20/0.28 ! [X0 : $tType,X1 : (X0 > $o),X2 : (X0 > $o)] : ((! [X3 : X0] : (((('const/sets/IN' @ X0 @ X3 @ X2)) = $true) | ((('const/sets/IN' @ X0 @ X3 @ X1)) != $true)) | ((('const/sets/SUBSET' @ X0 @ X1 @ X2)) != $true)) & (((('const/sets/SUBSET' @ X0 @ X1 @ X2)) = $true) | ? [X4 : X0] : (($true != (('const/sets/IN' @ X0 @ X4 @ X2))) & ($true = (('const/sets/IN' @ X0 @ X4 @ X1))))))),
% 0.20/0.28 inference(rectify,[],[f19])).
% 0.20/0.28 thf(f21,plain,(
% 0.20/0.28 ! [X0 : $tType,X1 : (X0 > $o),X2 : (X0 > $o)] : ((! [X3 : X0] : (((('const/sets/IN' @ X0 @ X3 @ X2)) = $true) | ((('const/sets/IN' @ X0 @ X3 @ X1)) != $true)) | ((('const/sets/SUBSET' @ X0 @ X1 @ X2)) != $true)) & (((('const/sets/SUBSET' @ X0 @ X1 @ X2)) = $true) | (($true != (('const/sets/IN' @ X0 @ (sK0 @ X0 @ X2 @ X1) @ X2))) & ($true = (('const/sets/IN' @ X0 @ (sK0 @ X0 @ X2 @ X1) @ X1))))))),
% 0.20/0.28 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP]),skolemize(X4,sK0 @ X0 @ X2 @ X1)],[f20])).
% 0.20/0.28 thf(f22,plain,(
% 0.20/0.28 ! [X0 : $tType,X1 : (X0 > $o),X2 : (X0 > $o)] : ((((X1 != X2) & ($true = (('const/sets/SUBSET' @ X0 @ X2 @ X1)))) | ($true != (('const/sets/PSUBSET' @ X0 @ X2 @ X1)))) & (($true = (('const/sets/PSUBSET' @ X0 @ X2 @ X1))) | ((X1 = X2) | ($true != (('const/sets/SUBSET' @ X0 @ X2 @ X1))))))),
% 0.20/0.28 inference(nnf_transformation,[],[f14])).
% 0.20/0.28 thf(f23,plain,(
% 0.20/0.28 ! [X0 : $tType,X1 : (X0 > $o),X2 : (X0 > $o)] : ((((X1 != X2) & ($true = (('const/sets/SUBSET' @ X0 @ X2 @ X1)))) | ($true != (('const/sets/PSUBSET' @ X0 @ X2 @ X1)))) & (($true = (('const/sets/PSUBSET' @ X0 @ X2 @ X1))) | (X1 = X2) | ($true != (('const/sets/SUBSET' @ X0 @ X2 @ X1)))))),
% 0.20/0.28 inference(flattening,[],[f22])).
% 0.20/0.28 thf(f24,plain,(
% 0.20/0.28 ! [X0 : $tType,X1 : (X0 > $o),X2 : (X0 > $o)] : ((! [X3 : X0] : ((('const/sets/IN' @ X0 @ X3 @ X1)) = (('const/sets/IN' @ X0 @ X3 @ X2))) | (X1 != X2)) & ((X1 = X2) | ? [X3 : X0] : ((('const/sets/IN' @ X0 @ X3 @ X1)) != (('const/sets/IN' @ X0 @ X3 @ X2)))))),
% 0.20/0.28 inference(nnf_transformation,[],[f8])).
% 0.20/0.28 thf(f25,plain,(
% 0.20/0.28 ! [X0 : $tType,X1 : (X0 > $o),X2 : (X0 > $o)] : ((! [X3 : X0] : ((('const/sets/IN' @ X0 @ X3 @ X1)) = (('const/sets/IN' @ X0 @ X3 @ X2))) | (X1 != X2)) & ((X1 = X2) | ? [X4 : X0] : ((('const/sets/IN' @ X0 @ X4 @ X2)) != (('const/sets/IN' @ X0 @ X4 @ X1)))))),
% 0.20/0.28 inference(rectify,[],[f24])).
% 0.20/0.28 thf(f26,plain,(
% 0.20/0.28 ! [X0 : $tType,X1 : (X0 > $o),X2 : (X0 > $o)] : ((! [X3 : X0] : ((('const/sets/IN' @ X0 @ X3 @ X1)) = (('const/sets/IN' @ X0 @ X3 @ X2))) | (X1 != X2)) & ((X1 = X2) | ((('const/sets/IN' @ X0 @ (sK1 @ X0 @ X2 @ X1) @ X2)) != (('const/sets/IN' @ X0 @ (sK1 @ X0 @ X2 @ X1) @ X1)))))),
% 0.20/0.28 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP]),skolemize(X4,sK0 @ X0 @ X2 @ X1)],[f25])).
% 0.20/0.28 thf(f27,plain,(
% 0.20/0.28 ? [X0 : $tType,X1 : (X0 > $o),X2 : (X0 > $o),X3 : (X0 > $o)] : (($true = (('const/sets/PSUBSET' @ X0 @ X3 @ X1))) & ($true != (('const/sets/PSUBSET' @ X0 @ X3 @ X2))) & ((('const/sets/SUBSET' @ X0 @ X1 @ X2)) = $true))),
% 0.20/0.28 inference(rectify,[],[f18])).
% 0.20/0.28 thf(f28,plain,(
% 0.20/0.28 ($true = (('const/sets/PSUBSET' @ sK2 @ sK5 @ sK3))) & ($true != (('const/sets/PSUBSET' @ sK2 @ sK5 @ sK4))) & ($true = (('const/sets/SUBSET' @ sK2 @ sK3 @ sK4)))),
% 0.20/0.28 inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4),skolemize(X3,sK5)],[f27])).
% 0.20/0.28 thf(f29,plain,(
% 0.20/0.28 ( ! [X0 : $tType,X2 : (X0 > $o),X1 : (X0 > $o)] : (($true = (('const/sets/IN' @ X0 @ (sK0 @ X0 @ X2 @ X1) @ X1))) | ((('const/sets/SUBSET' @ X0 @ X1 @ X2)) = $true)) )),
% 0.20/0.28 inference(cnf_transformation,[],[f21])).
% 0.20/0.28 thf(f30,plain,(
% 0.20/0.28 ( ! [X0 : $tType,X2 : (X0 > $o),X1 : (X0 > $o)] : (($true != (('const/sets/IN' @ X0 @ (sK0 @ X0 @ X2 @ X1) @ X2))) | ((('const/sets/SUBSET' @ X0 @ X1 @ X2)) = $true)) )),
% 0.20/0.28 inference(cnf_transformation,[],[f21])).
% 0.20/0.28 thf(f31,plain,(
% 0.20/0.28 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : X0,X1 : (X0 > $o)] : (((('const/sets/SUBSET' @ X0 @ X1 @ X2)) != $true) | ((('const/sets/IN' @ X0 @ X3 @ X1)) != $true) | ((('const/sets/IN' @ X0 @ X3 @ X2)) = $true)) )),
% 0.20/0.28 inference(cnf_transformation,[],[f21])).
% 0.20/0.28 thf(f32,plain,(
% 0.20/0.28 ( ! [X0 : $tType,X2 : (X0 > $o),X1 : (X0 > $o)] : (($true = (('const/sets/PSUBSET' @ X0 @ X2 @ X1))) | (X1 = X2) | ($true != (('const/sets/SUBSET' @ X0 @ X2 @ X1)))) )),
% 0.20/0.28 inference(cnf_transformation,[],[f23])).
% 0.20/0.28 thf(f33,plain,(
% 0.20/0.28 ( ! [X0 : $tType,X2 : (X0 > $o),X1 : (X0 > $o)] : (($true = (('const/sets/SUBSET' @ X0 @ X2 @ X1))) | ($true != (('const/sets/PSUBSET' @ X0 @ X2 @ X1)))) )),
% 0.20/0.28 inference(cnf_transformation,[],[f23])).
% 0.20/0.28 thf(f35,plain,(
% 0.20/0.28 ( ! [X0 : $tType,X2 : (X0 > $o),X1 : (X0 > $o)] : (((('const/sets/IN' @ X0 @ (sK1 @ X0 @ X2 @ X1) @ X2)) != (('const/sets/IN' @ X0 @ (sK1 @ X0 @ X2 @ X1) @ X1))) | (X1 = X2)) )),
% 0.20/0.28 inference(cnf_transformation,[],[f26])).
% 0.20/0.28 thf(f38,plain,(
% 0.20/0.28 ($true = (('const/sets/SUBSET' @ sK2 @ sK3 @ sK4)))),
% 0.20/0.28 inference(cnf_transformation,[],[f28])).
% 0.20/0.28 thf(f39,plain,(
% 0.20/0.28 ($true != (('const/sets/PSUBSET' @ sK2 @ sK5 @ sK4)))),
% 0.20/0.28 inference(cnf_transformation,[],[f28])).
% 0.20/0.28 thf(f40,plain,(
% 0.20/0.28 ($true = (('const/sets/PSUBSET' @ sK2 @ sK5 @ sK3)))),
% 0.20/0.28 inference(cnf_transformation,[],[f28])).
% 0.20/0.28 thf(f48,plain,(
% 0.20/0.28 ( ! [X0 : $tType,X2 : (X0 > $o),X1 : (X0 > $o)] : (($true = (('const/sets/IN' @ X0 @ (sK1 @ X0 @ X2 @ X1) @ X2))) | (X1 = X2) | ($true = (('const/sets/IN' @ X0 @ (sK1 @ X0 @ X2 @ X1) @ X1)))) )),
% 0.20/0.28 inference(xor_proxy_clausification,[],[f35])).
% 0.20/0.28 thf(f49,plain,(
% 0.20/0.28 ( ! [X0 : $tType,X2 : (X0 > $o),X1 : (X0 > $o)] : (($false = (('const/sets/IN' @ X0 @ (sK1 @ X0 @ X2 @ X1) @ X1))) | (X1 = X2) | ((('const/sets/IN' @ X0 @ (sK1 @ X0 @ X2 @ X1) @ X2)) = $false)) )),
% 0.20/0.28 inference(xor_proxy_clausification,[],[f35])).
% 0.20/0.28 thf(f51,definition,(
% 0.20/0.28 spl6_1 <=> ($true = (('const/sets/SUBSET' @ sK2 @ sK3 @ sK4)))),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition])).
% 0.20/0.28 thf(f53,plain,(
% 0.20/0.28 ($true = (('const/sets/SUBSET' @ sK2 @ sK3 @ sK4))) | ~spl6_1),
% 0.20/0.28 inference(avatar_component_clause,[],[f51])).
% 0.20/0.28 thf(f54,plain,(
% 0.20/0.28 spl6_1),
% 0.20/0.28 inference(avatar_split_clause,[],[f38,f51])).
% 0.20/0.28 thf(f56,definition,(
% 0.20/0.28 spl6_2 <=> ($true = (('const/sets/PSUBSET' @ sK2 @ sK5 @ sK3)))),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition])).
% 0.20/0.28 thf(f58,plain,(
% 0.20/0.28 ($true = (('const/sets/PSUBSET' @ sK2 @ sK5 @ sK3))) | ~spl6_2),
% 0.20/0.28 inference(avatar_component_clause,[],[f56])).
% 0.20/0.28 thf(f59,plain,(
% 0.20/0.28 spl6_2),
% 0.20/0.28 inference(avatar_split_clause,[],[f40,f56])).
% 0.20/0.28 thf(f61,definition,(
% 0.20/0.28 spl6_3 <=> ($true = (('const/sets/PSUBSET' @ sK2 @ sK5 @ sK4)))),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition])).
% 0.20/0.28 thf(f63,plain,(
% 0.20/0.28 ($true != (('const/sets/PSUBSET' @ sK2 @ sK5 @ sK4))) | spl6_3),
% 0.20/0.28 inference(avatar_component_clause,[],[f61])).
% 0.20/0.28 thf(f64,plain,(
% 0.20/0.28 ~spl6_3),
% 0.20/0.28 inference(avatar_split_clause,[],[f39,f61])).
% 0.20/0.28 thf(f65,plain,(
% 0.20/0.28 (sK5 = sK4) | ($true != $true) | ($true != (('const/sets/SUBSET' @ sK2 @ sK5 @ sK4))) | spl6_3),
% 0.20/0.28 inference(superposition,[],[f63,f32])).
% 0.20/0.28 thf(f66,plain,(
% 0.20/0.28 (sK5 = sK4) | ($true != (('const/sets/SUBSET' @ sK2 @ sK5 @ sK4))) | spl6_3),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f65])).
% 0.20/0.28 thf(f68,definition,(
% 0.20/0.28 spl6_4 <=> ($true = (('const/sets/SUBSET' @ sK2 @ sK5 @ sK4)))),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition])).
% 0.20/0.28 thf(f72,definition,(
% 0.20/0.28 spl6_5 <=> (sK5 = sK4)),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition])).
% 0.20/0.28 thf(f74,plain,(
% 0.20/0.28 (sK5 = sK4) | ~spl6_5),
% 0.20/0.28 inference(avatar_component_clause,[],[f72])).
% 0.20/0.28 thf(f75,plain,(
% 0.20/0.28 ~spl6_4 | spl6_5 | spl6_3),
% 0.20/0.28 inference(avatar_split_clause,[],[f66,f61,f72,f68])).
% 0.20/0.28 thf(f81,plain,(
% 0.20/0.28 ( ! [X0 : sK2] : (($true != $true) | ($true = (('const/sets/IN' @ sK2 @ X0 @ sK4))) | ($true != (('const/sets/IN' @ sK2 @ X0 @ sK3)))) ) | ~spl6_1),
% 0.20/0.28 inference(superposition,[],[f31,f53])).
% 0.20/0.28 thf(f82,plain,(
% 0.20/0.28 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : X0,X1 : (X0 > $o)] : (($true != $true) | ((('const/sets/IN' @ X0 @ X3 @ X1)) != $true) | ((('const/sets/IN' @ X0 @ X3 @ X2)) = $true) | ((('const/sets/PSUBSET' @ X0 @ X1 @ X2)) != $true)) )),
% 0.20/0.28 inference(superposition,[],[f31,f33])).
% 0.20/0.28 thf(f83,plain,(
% 0.20/0.28 ( ! [X0 : sK2] : (($true = (('const/sets/IN' @ sK2 @ X0 @ sK4))) | ($true != (('const/sets/IN' @ sK2 @ X0 @ sK3)))) ) | ~spl6_1),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f81])).
% 0.20/0.28 thf(f84,plain,(
% 0.20/0.28 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : X0,X1 : (X0 > $o)] : (((('const/sets/PSUBSET' @ X0 @ X1 @ X2)) != $true) | ((('const/sets/IN' @ X0 @ X3 @ X2)) = $true) | ((('const/sets/IN' @ X0 @ X3 @ X1)) != $true)) )),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f82])).
% 0.20/0.28 thf(f85,plain,(
% 0.20/0.28 ( ! [X0 : (sK2 > $o)] : (($true != (('const/sets/IN' @ sK2 @ (sK0 @ sK2 @ sK4 @ X0) @ sK3))) | ($true = (('const/sets/SUBSET' @ sK2 @ X0 @ sK4))) | ($true != $true)) ) | ~spl6_1),
% 0.20/0.28 inference(superposition,[],[f30,f83])).
% 0.20/0.28 thf(f86,plain,(
% 0.20/0.28 ( ! [X0 : (sK2 > $o)] : (($true != (('const/sets/IN' @ sK2 @ (sK0 @ sK2 @ sK4 @ X0) @ sK3))) | ($true = (('const/sets/SUBSET' @ sK2 @ X0 @ sK4)))) ) | ~spl6_1),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f85])).
% 0.20/0.28 thf(f88,plain,(
% 0.20/0.28 ( ! [X0 : sK2] : (($true != (('const/sets/IN' @ sK2 @ X0 @ sK5))) | ($true = (('const/sets/IN' @ sK2 @ X0 @ sK3))) | ($true != $true)) ) | ~spl6_2),
% 0.20/0.28 inference(superposition,[],[f84,f58])).
% 0.20/0.28 thf(f91,plain,(
% 0.20/0.28 ( ! [X0 : sK2] : (($true = (('const/sets/IN' @ sK2 @ X0 @ sK3))) | ($true != (('const/sets/IN' @ sK2 @ X0 @ sK5)))) ) | ~spl6_2),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f88])).
% 0.20/0.28 thf(f95,plain,(
% 0.20/0.28 ( ! [X0 : (sK2 > $o)] : (($true = $false) | ($true != (('const/sets/IN' @ sK2 @ (sK1 @ sK2 @ X0 @ sK4) @ sK3))) | ((('const/sets/IN' @ sK2 @ (sK1 @ sK2 @ X0 @ sK4) @ X0)) = $false) | (sK4 = X0)) ) | ~spl6_1),
% 0.20/0.28 inference(superposition,[],[f49,f83])).
% 0.20/0.28 thf(f100,plain,(
% 0.20/0.28 ( ! [X0 : (sK2 > $o)] : (((('const/sets/IN' @ sK2 @ (sK1 @ sK2 @ X0 @ sK4) @ X0)) = $false) | ($true != (('const/sets/IN' @ sK2 @ (sK1 @ sK2 @ X0 @ sK4) @ sK3))) | (sK4 = X0)) ) | ~spl6_1),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f95])).
% 0.20/0.28 thf(f104,plain,(
% 0.20/0.28 ( ! [X0 : (sK2 > $o)] : (($true != $true) | ($true != (('const/sets/IN' @ sK2 @ (sK0 @ sK2 @ sK4 @ X0) @ sK5))) | ($true = (('const/sets/SUBSET' @ sK2 @ X0 @ sK4)))) ) | (~spl6_1 | ~spl6_2)),
% 0.20/0.28 inference(superposition,[],[f86,f91])).
% 0.20/0.28 thf(f108,plain,(
% 0.20/0.28 ( ! [X0 : (sK2 > $o)] : (($true != (('const/sets/IN' @ sK2 @ (sK0 @ sK2 @ sK4 @ X0) @ sK5))) | ($true = (('const/sets/SUBSET' @ sK2 @ X0 @ sK4)))) ) | (~spl6_1 | ~spl6_2)),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f104])).
% 0.20/0.28 thf(f119,plain,(
% 0.20/0.28 ($true != (('const/sets/IN' @ sK2 @ (sK1 @ sK2 @ sK3 @ sK4) @ sK3))) | ($true != (('const/sets/IN' @ sK2 @ (sK1 @ sK2 @ sK3 @ sK4) @ sK5))) | (sK3 = sK4) | ($true = $false) | (~spl6_1 | ~spl6_2)),
% 0.20/0.28 inference(superposition,[],[f91,f100])).
% 0.20/0.28 thf(f124,plain,(
% 0.20/0.28 ($true != (('const/sets/IN' @ sK2 @ (sK1 @ sK2 @ sK3 @ sK4) @ sK3))) | (sK3 = sK4) | ($true != (('const/sets/IN' @ sK2 @ (sK1 @ sK2 @ sK3 @ sK4) @ sK5))) | (~spl6_1 | ~spl6_2)),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f119])).
% 0.20/0.28 thf(f128,definition,(
% 0.20/0.28 spl6_7 <=> ($true = (('const/sets/IN' @ sK2 @ (sK1 @ sK2 @ sK3 @ sK4) @ sK5)))),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl6_7])],[avatar_definition])).
% 0.20/0.28 thf(f130,plain,(
% 0.20/0.28 ($true != (('const/sets/IN' @ sK2 @ (sK1 @ sK2 @ sK3 @ sK4) @ sK5))) | spl6_7),
% 0.20/0.28 inference(avatar_component_clause,[],[f128])).
% 0.20/0.28 thf(f132,definition,(
% 0.20/0.28 spl6_8 <=> (sK3 = sK4)),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl6_8])],[avatar_definition])).
% 0.20/0.28 thf(f136,plain,(
% 0.20/0.28 (sK3 = sK4) | ($true != (('const/sets/IN' @ sK2 @ (sK1 @ sK2 @ sK3 @ sK4) @ sK5))) | (~spl6_1 | ~spl6_2)),
% 0.20/0.28 inference(forward_subsumption_resolution,[],[f124,f91])).
% 0.20/0.28 thf(f137,plain,(
% 0.20/0.28 ~spl6_7 | spl6_8 | ~spl6_1 | ~spl6_2),
% 0.20/0.28 inference(avatar_split_clause,[],[f136,f56,f51,f132,f128])).
% 0.20/0.28 thf(f140,plain,(
% 0.20/0.28 ($true = (('const/sets/SUBSET' @ sK2 @ sK5 @ sK4))) | ($true = (('const/sets/SUBSET' @ sK2 @ sK5 @ sK4))) | ($true != $true) | (~spl6_1 | ~spl6_2)),
% 0.20/0.28 inference(superposition,[],[f108,f29])).
% 0.20/0.28 thf(f141,plain,(
% 0.20/0.28 ($true != $true) | ($true = (('const/sets/SUBSET' @ sK2 @ sK5 @ sK4))) | (~spl6_1 | ~spl6_2)),
% 0.20/0.28 inference(duplicate_literal_removal,[],[f140])).
% 0.20/0.28 thf(f142,plain,(
% 0.20/0.28 ($true = (('const/sets/SUBSET' @ sK2 @ sK5 @ sK4))) | (~spl6_1 | ~spl6_2)),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f141])).
% 0.20/0.28 thf(f145,plain,(
% 0.20/0.28 spl6_4 | ~spl6_1 | ~spl6_2),
% 0.20/0.28 inference(avatar_split_clause,[],[f142,f56,f51,f68])).
% 0.20/0.28 thf(f149,plain,(
% 0.20/0.28 ( ! [X0 : sK2] : (($true = (('const/sets/IN' @ sK2 @ X0 @ sK5))) | ($true != (('const/sets/IN' @ sK2 @ X0 @ sK3)))) ) | (~spl6_1 | ~spl6_5)),
% 0.20/0.28 inference(superposition,[],[f83,f74])).
% 0.20/0.28 thf(f205,plain,(
% 0.20/0.28 ($true != (('const/sets/IN' @ sK2 @ (sK1 @ sK2 @ sK3 @ sK5) @ sK5))) | (~spl6_5 | spl6_7)),
% 0.20/0.28 inference(forward_demodulation,[],[f130,f74])).
% 0.20/0.28 thf(f207,definition,(
% 0.20/0.28 spl6_10 <=> ($true = (('const/sets/IN' @ sK2 @ (sK1 @ sK2 @ sK3 @ sK5) @ sK5)))),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl6_10])],[avatar_definition])).
% 0.20/0.28 thf(f209,plain,(
% 0.20/0.28 ($true != (('const/sets/IN' @ sK2 @ (sK1 @ sK2 @ sK3 @ sK5) @ sK5))) | spl6_10),
% 0.20/0.28 inference(avatar_component_clause,[],[f207])).
% 0.20/0.28 thf(f210,plain,(
% 0.20/0.28 ~spl6_10 | ~spl6_5 | spl6_7),
% 0.20/0.28 inference(avatar_split_clause,[],[f205,f128,f72,f207])).
% 0.20/0.28 thf(f248,plain,(
% 0.20/0.28 ($true != (('const/sets/IN' @ sK2 @ (sK1 @ sK2 @ sK3 @ sK5) @ sK3))) | ($true != $true) | (~spl6_1 | ~spl6_5 | spl6_10)),
% 0.20/0.28 inference(superposition,[],[f209,f149])).
% 0.20/0.28 thf(f253,plain,(
% 0.20/0.28 ($true != (('const/sets/IN' @ sK2 @ (sK1 @ sK2 @ sK3 @ sK5) @ sK3))) | (~spl6_1 | ~spl6_5 | spl6_10)),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f248])).
% 0.20/0.28 thf(f260,definition,(
% 0.20/0.28 spl6_12 <=> ($true = (('const/sets/IN' @ sK2 @ (sK1 @ sK2 @ sK3 @ sK5) @ sK3)))),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl6_12])],[avatar_definition])).
% 0.20/0.28 thf(f262,plain,(
% 0.20/0.28 ($true != (('const/sets/IN' @ sK2 @ (sK1 @ sK2 @ sK3 @ sK5) @ sK3))) | spl6_12),
% 0.20/0.28 inference(avatar_component_clause,[],[f260])).
% 0.20/0.28 thf(f263,plain,(
% 0.20/0.28 ~spl6_12 | ~spl6_1 | ~spl6_5 | spl6_10),
% 0.20/0.28 inference(avatar_split_clause,[],[f253,f207,f72,f51,f260])).
% 0.20/0.28 thf(f276,plain,(
% 0.20/0.28 ($true = (('const/sets/IN' @ sK2 @ (sK1 @ sK2 @ sK3 @ sK5) @ sK5))) | ($true != $true) | (sK3 = sK5) | spl6_12),
% 0.20/0.28 inference(superposition,[],[f262,f48])).
% 0.20/0.28 thf(f281,plain,(
% 0.20/0.28 (sK3 = sK5) | ($true = (('const/sets/IN' @ sK2 @ (sK1 @ sK2 @ sK3 @ sK5) @ sK5))) | spl6_12),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f276])).
% 0.20/0.28 thf(f287,plain,(
% 0.20/0.28 (sK3 = sK5) | (spl6_10 | spl6_12)),
% 0.20/0.28 inference(forward_subsumption_resolution,[],[f281,f209])).
% 0.20/0.28 thf(f289,definition,(
% 0.20/0.28 spl6_14 <=> (sK3 = sK5)),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl6_14])],[avatar_definition])).
% 0.20/0.28 thf(f292,plain,(
% 0.20/0.28 spl6_14 | spl6_10 | spl6_12),
% 0.20/0.28 inference(avatar_split_clause,[],[f287,f260,f207,f289])).
% 0.20/0.28 thf(f293,definition,(
% 0.20/0.28 (sK3 != sK5) | (sK5 != sK4) | ($true != (('const/sets/PSUBSET' @ sK2 @ sK5 @ sK3))) | ($true = (('const/sets/PSUBSET' @ sK2 @ sK5 @ sK4)))),
% 0.20/0.28 introduced(theory,[theory_tautology_sat_conflict])).
% 0.20/0.28 thf(f294,definition,(
% 0.20/0.28 (sK3 != sK4) | ($true != (('const/sets/PSUBSET' @ sK2 @ sK5 @ sK3))) | ($true = (('const/sets/PSUBSET' @ sK2 @ sK5 @ sK4)))),
% 0.20/0.28 introduced(theory,[theory_tautology_sat_conflict])).
% 0.20/0.28 cnf(s1, plain, spl6_1, inference(sat_conversion,[],[f54])).
% 0.20/0.28 cnf(s2, plain, spl6_2, inference(sat_conversion,[],[f59])).
% 0.20/0.28 cnf(s3, plain, ~spl6_3, inference(sat_conversion,[],[f64])).
% 0.20/0.28 cnf(s4, plain, spl6_3 | ~spl6_4 | spl6_5, inference(sat_conversion,[],[f75])).
% 0.20/0.28 cnf(s7, plain, ~spl6_1 | ~spl6_2 | ~spl6_7 | spl6_8, inference(sat_conversion,[],[f137])).
% 0.20/0.28 cnf(s9, plain, ~spl6_1 | ~spl6_2 | spl6_4, inference(sat_conversion,[],[f145])).
% 0.20/0.28 cnf(s11, plain, ~spl6_5 | spl6_7 | ~spl6_10, inference(sat_conversion,[],[f210])).
% 0.20/0.28 cnf(s13, plain, ~spl6_1 | ~spl6_5 | spl6_10 | ~spl6_12, inference(sat_conversion,[],[f263])).
% 0.20/0.28 cnf(s15, plain, spl6_10 | spl6_12 | spl6_14, inference(sat_conversion,[],[f292])).
% 0.20/0.28 cnf(s16, plain, ~spl6_2 | spl6_3 | ~spl6_5 | ~spl6_14, inference(sat_conversion,[],[f293])).
% 0.20/0.28 cnf(s17, plain, ~spl6_2 | spl6_3 | ~spl6_8, inference(sat_conversion,[],[f294])).
% 0.20/0.28 cnf(s20, plain, ~spl6_8, inference(rat,[],[s17,s3,s2])).
% 0.20/0.28 cnf(s22, plain, spl6_4, inference(rat,[],[s9,s2,s1])).
% 0.20/0.28 cnf(s23, plain, ~spl6_7, inference(rat,[],[s7,s20,s2,s1])).
% 0.20/0.28 cnf(s24, plain, spl6_5, inference(rat,[],[s4,s3,s22])).
% 0.20/0.28 cnf(s25, plain, ~spl6_10, inference(rat,[],[s11,s23,s24])).
% 0.20/0.28 cnf(s27, plain, ~spl6_14, inference(rat,[],[s16,s2,s3,s24])).
% 0.20/0.28 cnf(s28, plain, spl6_12, inference(rat,[],[s15,s27,s25])).
% 0.20/0.28 cnf(s30, plain, $false, inference(rat,[],[s13,s24,s1,s28,s25])).
% 0.20/0.28 thf(f297,plain,(
% 0.20/0.28 $false),
% 0.20/0.28 inference(avatar_sat_refutation,[],[s30])).
% 0.20/0.28 % SZS output end Proof for theBenchmark
% 0.20/0.28 % (4168972)------------------------------
% 0.20/0.28 % (4168972)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (4168972)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (4168972)CaDiCaL version: 2.1.3
% 0.20/0.28 % (4168972)Termination reason: Refutation
% 0.20/0.28 % (4168972)Time elapsed: 0.015 s
% 0.20/0.28 % (4168972)Peak memory usage: 13 MB
% 0.20/0.28 % (4168972)Instructions burned: 23 (million)
% 0.20/0.28 % (4168963)Success in time 0.052 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------