↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SYO376^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 : 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:47:33 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO376^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.18  % Computer : n009.cluster.edu
% 0.09/0.18  % Model    : x86_64 x86_64
% 0.09/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18  % Memory   : 8046.5625MB
% 0.09/0.18  % OS       : Linux 6.8.0-71-generic
% 0.09/0.18  % CPULimit : 300
% 0.09/0.18  % WCLimit  : 300
% 0.09/0.18  % DateTime : Tue Sep 29 16:49:45 UTC 2026
% 0.09/0.18  % CPUTime  : 
% 0.09/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.22  Running higher-order theorem proving
% 0.09/0.23  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.29  % (57648)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.29  % (57655)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1551791946:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.21/0.29  % (57655)Refutation not found, incomplete strategy
% 0.21/0.29  % (57655)------------------------------
% 0.21/0.29  % (57655)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29  % (57655)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29  % (57655)CaDiCaL version: 2.1.3
% 0.21/0.29  % (57655)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.29  % (57655)Time elapsed: 0.0000 s
% 0.21/0.29  % (57655)Peak memory usage: 12 MB
% 0.21/0.29  % (57655)------------------------------
% 0.21/0.29  % (57655)------------------------------
% 0.21/0.29  % (57659)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.29  % (57659)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.29  % (57653)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=4237569441:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.29  % (57654)lrs+10_16_si=on:nwc=1.5:random_seed=119906648:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.21/0.29  % (57656)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=2718398246: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.29  % (57657)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=849551873:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.29  % (57659)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=697073843:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.21/0.29  % (57653)Refutation not found, incomplete strategy
% 0.21/0.29  % (57653)------------------------------
% 0.21/0.29  % (57653)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29  % (57653)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29  % (57653)CaDiCaL version: 2.1.3
% 0.21/0.29  % (57653)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.29  % (57653)Time elapsed: 0.001 s
% 0.21/0.29  % (57653)Peak memory usage: 12 MB
% 0.21/0.29  % (57657)Refutation not found, incomplete strategy
% 0.21/0.29  % (57657)------------------------------
% 0.21/0.29  % (57657)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29  % (57657)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29  % (57657)CaDiCaL version: 2.1.3
% 0.21/0.29  % (57657)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.29  % (57657)Time elapsed: 0.001 s
% 0.21/0.29  % (57657)Peak memory usage: 11 MB
% 0.21/0.29  % (57656)Refutation not found, incomplete strategy
% 0.21/0.29  % (57656)------------------------------
% 0.21/0.29  % (57656)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29  % (57656)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29  % (57656)CaDiCaL version: 2.1.3
% 0.21/0.29  % (57656)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.29  % (57656)Time elapsed: 0.001 s
% 0.21/0.29  % (57656)Peak memory usage: 12 MB
% 0.21/0.29  % (57656)Instructions burned: 1 (million)
% 0.21/0.29  % (57653)------------------------------
% 0.21/0.29  % (57653)------------------------------
% 0.21/0.29  % (57657)------------------------------
% 0.21/0.29  % (57657)------------------------------
% 0.21/0.29  % (57656)------------------------------
% 0.21/0.29  % (57656)------------------------------
% 0.21/0.29  % (57654)Refutation not found, incomplete strategy
% 0.21/0.29  % (57654)------------------------------
% 0.21/0.29  % (57654)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29  % (57654)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29  % (57654)CaDiCaL version: 2.1.3
% 0.21/0.29  % (57654)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.29  % (57654)Time elapsed: 0.003 s
% 0.21/0.29  % (57654)Peak memory usage: 12 MB
% 0.21/0.29  % (57654)Instructions burned: 3 (million)
% 0.21/0.29  % (57654)------------------------------
% 0.21/0.29  % (57654)------------------------------
% 0.21/0.29  % (57659)Refutation not found, incomplete strategy
% 0.21/0.29  % (57659)------------------------------
% 0.21/0.29  % (57659)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29  % (57659)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29  % (57659)CaDiCaL version: 2.1.3
% 0.21/0.29  % (57659)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.29  % (57659)Time elapsed: 0.003 s
% 0.21/0.29  % (57659)Peak memory usage: 12 MB
% 0.21/0.29  % (57659)Instructions burned: 2 (million)
% 0.21/0.29  % (57659)------------------------------
% 0.21/0.29  % (57659)------------------------------
% 0.21/0.29  % (57661)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=81282559:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.21/0.29  % (57661)Instruction limit reached! 
% 0.21/0.29  % (57661)------------------------------
% 0.21/0.29  % (57661)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29  % (57661)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29  % (57661)CaDiCaL version: 2.1.3
% 0.21/0.29  % (57661)Termination reason: Instruction limit
% 0.21/0.29  % (57661)Termination phase: Saturation
% 0.21/0.29  % (57661)Time elapsed: 0.001 s
% 0.21/0.29  % (57661)Peak memory usage: 12 MB
% 0.21/0.29  % (57661)Instructions burned: 2 (million)
% 0.21/0.29  % (57658)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1659151939:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.21/0.29  % (57668)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.21/0.29  % (57673)lrs+10_1_si=on:cs=on:random_seed=3787804096:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 0.21/0.29  % (57670)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.29  % (57670)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.21/0.29  % (57673)Refutation not found, incomplete strategy
% 0.21/0.29  % (57673)------------------------------
% 0.21/0.29  % (57673)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29  % (57673)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29  % (57673)CaDiCaL version: 2.1.3
% 0.21/0.29  % (57673)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.29  % (57673)Time elapsed: 0.0000 s
% 0.21/0.29  % (57673)Peak memory usage: 12 MB
% 0.21/0.29  % (57673)Instructions burned: 1 (million)
% 0.21/0.29  % (57673)------------------------------
% 0.21/0.29  % (57673)------------------------------
% 0.21/0.29  % (57667)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=1692957181:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.21/0.29  % (57668)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=406309224:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.21/0.29  % (57669)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=1694448201:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.21/0.29  % (57670)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=268246797:i=28:s2at=5:piset=not:hud=10:bd=all:av=off:rtra=on:ixr=off:fsdmm=1_2999 on theBenchmark for (2999ds/28Mi)
% 0.21/0.29  % (57658) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-57648-57658"...
% 0.21/0.29  % (57669)Refutation not found, incomplete strategy
% 0.21/0.29  % (57669)------------------------------
% 0.21/0.29  % (57669)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29  % (57669)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29  % (57669)CaDiCaL version: 2.1.3
% 0.21/0.29  % (57669)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.29  % (57669)Time elapsed: 0.002 s
% 0.21/0.29  % (57669)Peak memory usage: 12 MB
% 0.21/0.29  % (57669)Instructions burned: 2 (million)
% 0.21/0.29  % (57671)lrs+1002_64_sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:sp=occurrence:lma=off:plsqr=32,1:uwa=interpreted_only:random_seed=3494446631:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 0.21/0.29  % (57669)------------------------------
% 0.21/0.29  % (57669)------------------------------
% 0.21/0.29  % (57670)Refutation not found, incomplete strategy
% 0.21/0.29  % (57670)------------------------------
% 0.21/0.29  % (57670)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29  % (57670)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29  % (57670)CaDiCaL version: 2.1.3
% 0.21/0.29  % (57670)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.29  % (57670)Time elapsed: 0.003 s
% 0.21/0.29  % (57670)Peak memory usage: 12 MB
% 0.21/0.29  % (57670)Instructions burned: 4 (million)
% 0.21/0.29  % (57667)Instruction limit reached! 
% 0.21/0.29  % (57667)------------------------------
% 0.21/0.29  % (57667)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29  % (57667)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29  % (57667)CaDiCaL version: 2.1.3
% 0.21/0.29  % (57667)Termination reason: Instruction limit
% 0.21/0.29  % (57667)Termination phase: Saturation
% 0.21/0.29  % (57667)Time elapsed: 0.004 s
% 0.21/0.29  % (57667)Peak memory usage: 11 MB
% 0.21/0.29  % (57667)Instructions burned: 5 (million)
% 0.21/0.29  % (57668)Instruction limit reached! 
% 0.21/0.29  % (57668)------------------------------
% 0.21/0.29  % (57668)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29  % (57668)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29  % (57668)CaDiCaL version: 2.1.3
% 0.21/0.29  % (57668)Termination reason: Instruction limit
% 0.21/0.29  % (57668)Termination phase: Saturation
% 0.21/0.29  % (57668)Time elapsed: 0.004 s
% 0.21/0.29  % (57668)Peak memory usage: 12 MB
% 0.21/0.29  % (57668)Instructions burned: 7 (million)
% 0.21/0.29  % (57670)------------------------------
% 0.21/0.29  % (57670)------------------------------
% 0.21/0.29  % (57658)...printing done.
% 0.21/0.29  % (57671)Refutation not found, incomplete strategy
% 0.21/0.29  % (57671)------------------------------
% 0.21/0.29  % (57671)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29  % (57671)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29  % (57671)CaDiCaL version: 2.1.3
% 0.21/0.29  % (57671)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.29  % (57671)Time elapsed: 0.002 s
% 0.21/0.29  % (57671)Peak memory usage: 12 MB
% 0.21/0.29  % (57671)Instructions burned: 3 (million)
% 0.21/0.29  % (57676)WARNING Broken Constraint: if positive_literal_split_queue_ratios(1,32) has been set then positive_literal_split_queue(off) is equal to on
% 0.21/0.29  % (57671)------------------------------
% 0.21/0.29  % (57671)------------------------------
% 0.21/0.29  % (57658)Refutation found. Thanks to Tanya!
% 0.21/0.29  % SZS status Theorem for theBenchmark
% 0.21/0.29  % SZS output start Proof for theBenchmark
% 0.21/0.29  thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.21/0.29  thf(func_def_0, type, cG: ($o > $o)).
% 0.21/0.29  thf(func_def_1, type, cF: ($o > $o)).
% 0.21/0.29  thf(func_def_2, type, cP: (($o > $o) > $o)).
% 0.21/0.29  thf(func_def_6, type, vOR: ($o > $o > $o)).
% 0.21/0.29  thf(func_def_7, type, db0: !>[X0: $tType]:(X0)).
% 0.21/0.29  thf(func_def_8, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.21/0.29  thf(func_def_9, type, vNOT: ($o > $o)).
% 0.21/0.29  thf(func_def_10, type, sK0: $o).
% 0.21/0.29  thf(func_def_12, type, sK2: $o).
% 0.21/0.29  thf(func_def_13, type, sK3: $o).
% 0.21/0.29  thf(func_def_14, type, sK4: $o).
% 0.21/0.29  thf(f1,conjecture,(
% 0.21/0.29    ((cP @ cF) & (cP @ cG)) => ((cP @ (^[X0 : $o] : ((cG @ X0) | ~(cF @ X0)))) | (cP @ (^[X0 : $o] : ((cG @ X0) | (cF @ X0)))))),
% 0.21/0.29    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM627)).
% 0.21/0.29  thf(f2,negated_conjecture,(
% 0.21/0.29    ~(((cP @ cF) & (cP @ cG)) => ((cP @ (^[X0 : $o] : ((cG @ X0) | ~(cF @ X0)))) | (cP @ (^[X0 : $o] : ((cG @ X0) | (cF @ X0))))))),
% 0.21/0.29    inference(negated_conjecture,[status(cth)],[f1])).
% 0.21/0.29  thf(f3,plain,(
% 0.21/0.29    ~(((cP @ cF) & (cP @ cG)) => ((cP @ (^[X0 : $o] : ((cG @ X0) | ~(cF @ X0)))) | (cP @ (^[X1 : $o] : ((cG @ X1) | (cF @ X1))))))),
% 0.21/0.29    inference(rectify,[],[f2])).
% 0.21/0.29  thf(f4,plain,(
% 0.21/0.29    ~(((((cP @ cG)) = $true) & (((cP @ cF)) = $true)) => ((((cP @ (^[Y0 : $o]: ((cF @ Y0) | (cG @ Y0))))) = $true) | (((cP @ (^[Y0 : $o]: ((~ (cF @ Y0)) | (cG @ Y0))))) = $true)))),
% 0.21/0.29    inference(fool_elimination,[],[f3])).
% 0.21/0.29  thf(f5,plain,(
% 0.21/0.29    ((((cP @ (^[Y0 : $o]: ((cF @ Y0) | (cG @ Y0))))) != $true) & (((cP @ (^[Y0 : $o]: ((~ (cF @ Y0)) | (cG @ Y0))))) != $true)) & ((((cP @ cG)) = $true) & (((cP @ cF)) = $true))),
% 0.21/0.29    inference(ennf_transformation,[],[f4])).
% 0.21/0.29  thf(f6,plain,(
% 0.21/0.29    (((cP @ cF)) = $true) & (((cP @ (^[Y0 : $o]: ((cF @ Y0) | (cG @ Y0))))) != $true) & (((cP @ (^[Y0 : $o]: ((~ (cF @ Y0)) | (cG @ Y0))))) != $true) & (((cP @ cG)) = $true)),
% 0.21/0.29    inference(flattening,[],[f5])).
% 0.21/0.29  thf(f7,plain,(
% 0.21/0.29    (((cP @ cG)) = $true)),
% 0.21/0.29    inference(cnf_transformation,[],[f6])).
% 0.21/0.29  thf(f8,plain,(
% 0.21/0.29    (((cP @ (^[Y0 : $o]: ((~ (cF @ Y0)) | (cG @ Y0))))) != $true)),
% 0.21/0.29    inference(cnf_transformation,[],[f6])).
% 0.21/0.29  thf(f9,plain,(
% 0.21/0.29    (((cP @ (^[Y0 : $o]: ((cF @ Y0) | (cG @ Y0))))) != $true)),
% 0.21/0.29    inference(cnf_transformation,[],[f6])).
% 0.21/0.29  thf(f10,plain,(
% 0.21/0.29    (((cP @ cF)) = $true)),
% 0.21/0.29    inference(cnf_transformation,[],[f6])).
% 0.21/0.29  thf(f12,definition,(
% 0.21/0.29    ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.21/0.29    introduced(theory,[fool_exhaustiveness_axiom])).
% 0.21/0.29  thf(f13,plain,(
% 0.21/0.29    ($true != $true) | (cG != (^[Y0 : $o]: ((cF @ Y0) | (cG @ Y0))))),
% 0.21/0.29    inference(constrained_superposition,[],[f9,f7])).
% 0.21/0.29  thf(f14,plain,(
% 0.21/0.29    (cF != (^[Y0 : $o]: ((cF @ Y0) | (cG @ Y0)))) | ($true != $true)),
% 0.21/0.29    inference(constrained_superposition,[],[f9,f10])).
% 0.21/0.29  thf(f15,plain,(
% 0.21/0.29    (cG != (^[Y0 : $o]: ((cF @ Y0) | (cG @ Y0))))),
% 0.21/0.29    inference(trivial_inequality_removal,[],[f13])).
% 0.21/0.29  thf(f16,plain,(
% 0.21/0.29    (cF != (^[Y0 : $o]: ((cF @ Y0) | (cG @ Y0))))),
% 0.21/0.29    inference(trivial_inequality_removal,[],[f14])).
% 0.21/0.29  thf(f17,plain,(
% 0.21/0.29    (((cG @ sK0)) != (((^[Y0 : $o]: ((cF @ Y0) | (cG @ Y0))) @ sK0)))),
% 0.21/0.29    inference(negative_extensionality,[],[f15])).
% 0.21/0.29  thf(f18,plain,(
% 0.21/0.29    (((cG @ sK0)) = $true) | ($true = (((^[Y0 : $o]: ((cF @ Y0) | (cG @ Y0))) @ sK0)))),
% 0.21/0.29    inference(xor_proxy_clausification,[],[f17])).
% 0.21/0.29  thf(f19,plain,(
% 0.21/0.29    ($false = (((^[Y0 : $o]: ((cF @ Y0) | (cG @ Y0))) @ sK0))) | ($false = ((cG @ sK0)))),
% 0.21/0.29    inference(xor_proxy_clausification,[],[f17])).
% 0.21/0.29  thf(f20,plain,(
% 0.21/0.29    ($false = ((cG @ sK0))) | ((((cF @ sK0) | (cG @ sK0))) = $false)),
% 0.21/0.29    inference(beta-eta_normalization,[],[f19])).
% 0.21/0.29  thf(f21,plain,(
% 0.21/0.29    ($false = ((cG @ sK0))) | ($false = ((cG @ sK0)))),
% 0.21/0.29    inference(or_proxy_clausification,[],[f20])).
% 0.21/0.29  thf(f23,plain,(
% 0.21/0.29    ($false = ((cG @ sK0)))),
% 0.21/0.29    inference(duplicate_literal_removal,[],[f21])).
% 0.21/0.29  thf(f24,plain,(
% 0.21/0.29    (((cG @ sK0)) = $true) | ((((cF @ sK0) | (cG @ sK0))) = $true)),
% 0.21/0.29    inference(beta-eta_normalization,[],[f18])).
% 0.21/0.29  thf(f25,plain,(
% 0.21/0.29    (((cG @ sK0)) = $true) | (((cG @ sK0)) = $true) | (((cF @ sK0)) = $true)),
% 0.21/0.29    inference(or_proxy_clausification,[],[f24])).
% 0.21/0.29  thf(f26,plain,(
% 0.21/0.29    (((cF @ sK0)) = $true) | (((cG @ sK0)) = $true)),
% 0.21/0.29    inference(duplicate_literal_removal,[],[f25])).
% 0.21/0.29  thf(f28,definition,(
% 0.21/0.29    spl1_1 <=> ($false = ((cG @ sK0)))),
% 0.21/0.29    introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition])).
% 0.21/0.29  thf(f29,plain,(
% 0.21/0.29    ($false = ((cG @ sK0))) | ~spl1_1),
% 0.21/0.29    inference(avatar_component_clause,[],[f28])).
% 0.21/0.29  thf(f34,plain,(
% 0.21/0.29    spl1_1),
% 0.21/0.29    inference(avatar_split_clause,[],[f23,f28])).
% 0.21/0.29  thf(f36,definition,(
% 0.21/0.29    spl1_3 <=> (((cG @ sK0)) = $true)),
% 0.21/0.29    introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition])).
% 0.21/0.29  thf(f37,plain,(
% 0.21/0.29    (((cG @ sK0)) = $true) | ~spl1_3),
% 0.21/0.29    inference(avatar_component_clause,[],[f36])).
% 0.21/0.29  thf(f39,definition,(
% 0.21/0.29    spl1_4 <=> (((cF @ sK0)) = $true)),
% 0.21/0.29    introduced(definition,[new_symbols(definition,[spl1_4])],[avatar_definition])).
% 0.21/0.29  thf(f40,plain,(
% 0.21/0.29    (((cF @ sK0)) = $true) | ~spl1_4),
% 0.21/0.29    inference(avatar_component_clause,[],[f39])).
% 0.21/0.29  thf(f41,plain,(
% 0.21/0.29    spl1_3 | spl1_4),
% 0.21/0.29    inference(avatar_split_clause,[],[f26,f39,f36])).
% 0.21/0.29  thf(f42,plain,(
% 0.21/0.29    ($false = $true) | (~spl1_1 | ~spl1_3)),
% 0.21/0.29    inference(backward_demodulation,[],[f37,f29])).
% 0.21/0.29  thf(f43,plain,(
% 0.21/0.29    $false | (~spl1_1 | ~spl1_3)),
% 0.21/0.29    inference(trivial_inequality_removal,[],[f42])).
% 0.21/0.29  thf(f44,plain,(
% 0.21/0.29    ~spl1_1 | ~spl1_3),
% 0.21/0.29    inference(avatar_contradiction_clause,[],[f43])).
% 0.21/0.29  thf(f45,plain,(
% 0.21/0.29    (cG != (^[Y0 : $o]: ((~ (cF @ Y0)) | (cG @ Y0)))) | ($true != $true)),
% 0.21/0.29    inference(constrained_superposition,[],[f8,f7])).
% 0.21/0.29  thf(f47,plain,(
% 0.21/0.29    (cG != (^[Y0 : $o]: ((~ (cF @ Y0)) | (cG @ Y0))))),
% 0.21/0.29    inference(trivial_inequality_removal,[],[f45])).
% 0.21/0.29  thf(f49,plain,(
% 0.21/0.29    (((cF @ sK2)) != (((^[Y0 : $o]: ((cF @ Y0) | (cG @ Y0))) @ sK2)))),
% 0.21/0.29    inference(negative_extensionality,[],[f16])).
% 0.21/0.29  thf(f50,plain,(
% 0.21/0.29    ((((^[Y0 : $o]: ((cF @ Y0) | (cG @ Y0))) @ sK2)) = $true) | (((cF @ sK2)) = $true)),
% 0.21/0.29    inference(xor_proxy_clausification,[],[f49])).
% 0.21/0.29  thf(f51,plain,(
% 0.21/0.29    ($false = ((cF @ sK2))) | ($false = (((^[Y0 : $o]: ((cF @ Y0) | (cG @ Y0))) @ sK2)))),
% 0.21/0.29    inference(xor_proxy_clausification,[],[f49])).
% 0.21/0.29  thf(f52,plain,(
% 0.21/0.29    ($false = ((cF @ sK2))) | ((((cF @ sK2) | (cG @ sK2))) = $false)),
% 0.21/0.29    inference(beta-eta_normalization,[],[f51])).
% 0.21/0.29  thf(f54,plain,(
% 0.21/0.29    ($false = ((cF @ sK2))) | ($false = ((cF @ sK2)))),
% 0.21/0.29    inference(or_proxy_clausification,[],[f52])).
% 0.21/0.29  thf(f55,plain,(
% 0.21/0.29    ($false = ((cF @ sK2)))),
% 0.21/0.29    inference(duplicate_literal_removal,[],[f54])).
% 0.21/0.29  thf(f56,plain,(
% 0.21/0.29    (((cF @ sK2)) = $true) | ((((cF @ sK2) | (cG @ sK2))) = $true)),
% 0.21/0.29    inference(beta-eta_normalization,[],[f50])).
% 0.21/0.29  thf(f57,plain,(
% 0.21/0.29    (((cF @ sK2)) = $true) | (((cF @ sK2)) = $true) | (((cG @ sK2)) = $true)),
% 0.21/0.29    inference(or_proxy_clausification,[],[f56])).
% 0.21/0.29  thf(f58,plain,(
% 0.21/0.29    (((cF @ sK2)) = $true) | (((cG @ sK2)) = $true)),
% 0.21/0.29    inference(duplicate_literal_removal,[],[f57])).
% 0.21/0.29  thf(f59,plain,(
% 0.21/0.29    ($false = $true) | (((cG @ sK2)) = $true)),
% 0.21/0.29    inference(forward_demodulation,[],[f58,f55])).
% 0.21/0.29  thf(f60,plain,(
% 0.21/0.29    (((cG @ sK2)) = $true)),
% 0.21/0.29    inference(trivial_inequality_removal,[],[f59])).
% 0.21/0.29  thf(f61,plain,(
% 0.21/0.29    ((((^[Y0 : $o]: ((~ (cF @ Y0)) | (cG @ Y0))) @ sK3)) != ((cG @ sK3)))),
% 0.21/0.29    inference(negative_extensionality,[],[f47])).
% 0.21/0.29  thf(f62,plain,(
% 0.21/0.29    ((((^[Y0 : $o]: ((~ (cF @ Y0)) | (cG @ Y0))) @ sK3)) = $true) | ($true = ((cG @ sK3)))),
% 0.21/0.29    inference(xor_proxy_clausification,[],[f61])).
% 0.21/0.29  thf(f63,plain,(
% 0.21/0.29    ($false = ((cG @ sK3))) | ($false = (((^[Y0 : $o]: ((~ (cF @ Y0)) | (cG @ Y0))) @ sK3)))),
% 0.21/0.29    inference(xor_proxy_clausification,[],[f61])).
% 0.21/0.29  thf(f64,plain,(
% 0.21/0.29    ((((~ (cF @ sK3)) | (cG @ sK3))) = $false) | ($false = ((cG @ sK3)))),
% 0.21/0.29    inference(beta-eta_normalization,[],[f63])).
% 0.21/0.30  thf(f65,plain,(
% 0.21/0.30    ($false = ((cG @ sK3))) | ($false = ((cG @ sK3)))),
% 0.21/0.30    inference(or_proxy_clausification,[],[f64])).
% 0.21/0.30  thf(f68,plain,(
% 0.21/0.30    ($false = ((cG @ sK3)))),
% 0.21/0.30    inference(duplicate_literal_removal,[],[f65])).
% 0.21/0.30  thf(f69,plain,(
% 0.21/0.30    ($true = ((cG @ sK3))) | ((((~ (cF @ sK3)) | (cG @ sK3))) = $true)),
% 0.21/0.30    inference(beta-eta_normalization,[],[f62])).
% 0.21/0.30  thf(f70,plain,(
% 0.21/0.30    ($true = ((cG @ sK3))) | ($true = ((cG @ sK3))) | (((~ (cF @ sK3))) = $true)),
% 0.21/0.30    inference(or_proxy_clausification,[],[f69])).
% 0.21/0.30  thf(f71,plain,(
% 0.21/0.30    ($true = ((cG @ sK3))) | ($true = ((cG @ sK3))) | (((cF @ sK3)) = $false)),
% 0.21/0.30    inference(not_proxy_clausification,[],[f70])).
% 0.21/0.30  thf(f72,plain,(
% 0.21/0.30    ($true = ((cG @ sK3))) | (((cF @ sK3)) = $false)),
% 0.21/0.30    inference(duplicate_literal_removal,[],[f71])).
% 0.21/0.30  thf(f74,definition,(
% 0.21/0.30    spl1_5 <=> ($false = ((cG @ sK3)))),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl1_5])],[avatar_definition])).
% 0.21/0.30  thf(f75,plain,(
% 0.21/0.30    ($false = ((cG @ sK3))) | ~spl1_5),
% 0.21/0.30    inference(avatar_component_clause,[],[f74])).
% 0.21/0.30  thf(f80,plain,(
% 0.21/0.30    spl1_5),
% 0.21/0.30    inference(avatar_split_clause,[],[f68,f74])).
% 0.21/0.30  thf(f82,definition,(
% 0.21/0.30    spl1_7 <=> ($true = ((cG @ sK3)))),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl1_7])],[avatar_definition])).
% 0.21/0.30  thf(f83,plain,(
% 0.21/0.30    ($true = ((cG @ sK3))) | ~spl1_7),
% 0.21/0.30    inference(avatar_component_clause,[],[f82])).
% 0.21/0.30  thf(f85,definition,(
% 0.21/0.30    spl1_8 <=> (((cF @ sK3)) = $false)),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl1_8])],[avatar_definition])).
% 0.21/0.30  thf(f86,plain,(
% 0.21/0.30    (((cF @ sK3)) = $false) | ~spl1_8),
% 0.21/0.30    inference(avatar_component_clause,[],[f85])).
% 0.21/0.30  thf(f87,plain,(
% 0.21/0.30    spl1_7 | spl1_8),
% 0.21/0.30    inference(avatar_split_clause,[],[f72,f85,f82])).
% 0.21/0.30  thf(f88,plain,(
% 0.21/0.30    ($false = $true) | (~spl1_5 | ~spl1_7)),
% 0.21/0.30    inference(forward_demodulation,[],[f83,f75])).
% 0.21/0.30  thf(f89,plain,(
% 0.21/0.30    $false | (~spl1_5 | ~spl1_7)),
% 0.21/0.30    inference(trivial_inequality_removal,[],[f88])).
% 0.21/0.30  thf(f90,plain,(
% 0.21/0.30    ~spl1_5 | ~spl1_7),
% 0.21/0.30    inference(avatar_contradiction_clause,[],[f89])).
% 0.21/0.30  thf(f117,plain,(
% 0.21/0.30    (sK0 = $false) | (((cG @ $true)) = $false) | ~spl1_1),
% 0.21/0.30    inference(constrained_superposition,[],[f29,f12])).
% 0.21/0.30  thf(f118,plain,(
% 0.21/0.30    (((cF @ $true)) = $true) | (sK0 = $false) | ~spl1_4),
% 0.21/0.30    inference(constrained_superposition,[],[f40,f12])).
% 0.21/0.30  thf(f120,plain,(
% 0.21/0.30    (sK2 = $false) | (((cG @ $true)) = $true)),
% 0.21/0.30    inference(constrained_superposition,[],[f60,f12])).
% 0.21/0.30  thf(f121,plain,(
% 0.21/0.30    (((cG @ $true)) = $false) | ($false = sK3) | ~spl1_5),
% 0.21/0.30    inference(constrained_superposition,[],[f75,f12])).
% 0.21/0.30  thf(f122,plain,(
% 0.21/0.30    (((cF @ $true)) = $false) | ($false = sK3) | ~spl1_8),
% 0.21/0.30    inference(constrained_superposition,[],[f86,f12])).
% 0.21/0.30  thf(f137,definition,(
% 0.21/0.30    spl1_11 <=> ($false = sK3)),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl1_11])],[avatar_definition])).
% 0.21/0.30  thf(f138,plain,(
% 0.21/0.30    ($false = sK3) | ~spl1_11),
% 0.21/0.30    inference(avatar_component_clause,[],[f137])).
% 0.21/0.30  thf(f140,definition,(
% 0.21/0.30    spl1_12 <=> (((cF @ $true)) = $false)),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl1_12])],[avatar_definition])).
% 0.21/0.30  thf(f141,plain,(
% 0.21/0.30    (((cF @ $true)) = $false) | ~spl1_12),
% 0.21/0.30    inference(avatar_component_clause,[],[f140])).
% 0.21/0.30  thf(f142,plain,(
% 0.21/0.30    spl1_11 | spl1_12 | ~spl1_8),
% 0.21/0.30    inference(avatar_split_clause,[],[f122,f85,f140,f137])).
% 0.21/0.30  thf(f144,definition,(
% 0.21/0.30    spl1_13 <=> (sK0 = $false)),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl1_13])],[avatar_definition])).
% 0.21/0.30  thf(f145,plain,(
% 0.21/0.30    (sK0 = $false) | ~spl1_13),
% 0.21/0.30    inference(avatar_component_clause,[],[f144])).
% 0.21/0.30  thf(f147,definition,(
% 0.21/0.30    spl1_14 <=> (((cG @ $true)) = $false)),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl1_14])],[avatar_definition])).
% 0.21/0.30  thf(f148,plain,(
% 0.21/0.30    (((cG @ $true)) = $false) | ~spl1_14),
% 0.21/0.30    inference(avatar_component_clause,[],[f147])).
% 0.21/0.30  thf(f149,plain,(
% 0.21/0.30    spl1_13 | spl1_14 | ~spl1_1),
% 0.21/0.30    inference(avatar_split_clause,[],[f117,f28,f147,f144])).
% 0.21/0.30  thf(f154,plain,(
% 0.21/0.30    spl1_11 | spl1_14 | ~spl1_5),
% 0.21/0.30    inference(avatar_split_clause,[],[f121,f74,f147,f137])).
% 0.21/0.30  thf(f156,definition,(
% 0.21/0.30    spl1_16 <=> (sK2 = $false)),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl1_16])],[avatar_definition])).
% 0.21/0.30  thf(f157,plain,(
% 0.21/0.30    (sK2 = $false) | ~spl1_16),
% 0.21/0.30    inference(avatar_component_clause,[],[f156])).
% 0.21/0.30  thf(f160,definition,(
% 0.21/0.30    spl1_17 <=> (((cF @ $true)) = $true)),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl1_17])],[avatar_definition])).
% 0.21/0.30  thf(f161,plain,(
% 0.21/0.30    (((cF @ $true)) = $true) | ~spl1_17),
% 0.21/0.30    inference(avatar_component_clause,[],[f160])).
% 0.21/0.30  thf(f162,plain,(
% 0.21/0.30    spl1_17 | spl1_13 | ~spl1_4),
% 0.21/0.30    inference(avatar_split_clause,[],[f118,f39,f144,f160])).
% 0.21/0.30  thf(f165,definition,(
% 0.21/0.30    spl1_18 <=> (((cG @ $true)) = $true)),
% 0.21/0.30    introduced(definition,[new_symbols(definition,[spl1_18])],[avatar_definition])).
% 0.21/0.30  thf(f166,plain,(
% 0.21/0.30    (((cG @ $true)) = $true) | ~spl1_18),
% 0.21/0.30    inference(avatar_component_clause,[],[f165])).
% 0.21/0.30  thf(f167,plain,(
% 0.21/0.30    spl1_16 | spl1_18),
% 0.21/0.30    inference(avatar_split_clause,[],[f120,f165,f156])).
% 0.21/0.30  thf(f169,plain,(
% 0.21/0.30    ($true = ((cG @ $false))) | ~spl1_16),
% 0.21/0.30    inference(backward_demodulation,[],[f60,f157])).
% 0.21/0.30  thf(f170,plain,(
% 0.21/0.30    (((cF @ $false)) = $false) | ~spl1_16),
% 0.21/0.30    inference(backward_demodulation,[],[f55,f157])).
% 0.21/0.30  thf(f171,plain,(
% 0.21/0.30    (((cF @ $false)) = $false) | (~spl1_8 | ~spl1_11)),
% 0.21/0.30    inference(backward_demodulation,[],[f86,f138])).
% 0.21/0.30  thf(f172,plain,(
% 0.21/0.30    ($false = ((cG @ $false))) | (~spl1_5 | ~spl1_11)),
% 0.21/0.30    inference(backward_demodulation,[],[f75,f138])).
% 0.21/0.30  thf(f173,plain,(
% 0.21/0.30    (((cF @ $false)) = $true) | (~spl1_4 | ~spl1_13)),
% 0.21/0.30    inference(backward_demodulation,[],[f40,f145])).
% 0.21/0.30  thf(f175,plain,(
% 0.21/0.30    ($false = $true) | (~spl1_5 | ~spl1_11 | ~spl1_16)),
% 0.21/0.30    inference(backward_demodulation,[],[f169,f172])).
% 0.21/0.30  thf(f176,plain,(
% 0.21/0.30    $false | (~spl1_5 | ~spl1_11 | ~spl1_16)),
% 0.21/0.30    inference(trivial_inequality_removal,[],[f175])).
% 0.21/0.30  thf(f177,plain,(
% 0.21/0.30    ~spl1_5 | ~spl1_11 | ~spl1_16),
% 0.21/0.30    inference(avatar_contradiction_clause,[],[f176])).
% 0.21/0.30  thf(f178,plain,(
% 0.21/0.30    ($false = $true) | (~spl1_4 | ~spl1_13 | ~spl1_16)),
% 0.21/0.30    inference(forward_demodulation,[],[f173,f170])).
% 0.21/0.30  thf(f179,plain,(
% 0.21/0.30    $false | (~spl1_4 | ~spl1_13 | ~spl1_16)),
% 0.21/0.30    inference(trivial_inequality_removal,[],[f178])).
% 0.21/0.30  thf(f180,plain,(
% 0.21/0.30    ~spl1_4 | ~spl1_13 | ~spl1_16),
% 0.21/0.30    inference(avatar_contradiction_clause,[],[f179])).
% 0.21/0.30  thf(f181,plain,(
% 0.21/0.30    ($false = $true) | (~spl1_12 | ~spl1_17)),
% 0.21/0.30    inference(backward_demodulation,[],[f161,f141])).
% 0.21/0.30  thf(f182,plain,(
% 0.21/0.30    $false | (~spl1_12 | ~spl1_17)),
% 0.21/0.30    inference(trivial_inequality_removal,[],[f181])).
% 0.21/0.30  thf(f183,plain,(
% 0.21/0.30    ~spl1_12 | ~spl1_17),
% 0.21/0.30    inference(avatar_contradiction_clause,[],[f182])).
% 0.21/0.30  thf(f184,plain,(
% 0.21/0.30    ($false = $true) | (~spl1_14 | ~spl1_18)),
% 0.21/0.30    inference(forward_demodulation,[],[f166,f148])).
% 0.21/0.30  thf(f185,plain,(
% 0.21/0.30    $false | (~spl1_14 | ~spl1_18)),
% 0.21/0.30    inference(trivial_inequality_removal,[],[f184])).
% 0.21/0.30  thf(f186,plain,(
% 0.21/0.30    ~spl1_14 | ~spl1_18),
% 0.21/0.30    inference(avatar_contradiction_clause,[],[f185])).
% 0.21/0.30  thf(f189,plain,(
% 0.21/0.30    ($false = $true) | (~spl1_4 | ~spl1_8 | ~spl1_11 | ~spl1_13)),
% 0.21/0.30    inference(backward_demodulation,[],[f173,f171])).
% 0.21/0.30  thf(f190,plain,(
% 0.21/0.30    $false | (~spl1_4 | ~spl1_8 | ~spl1_11 | ~spl1_13)),
% 0.21/0.30    inference(trivial_inequality_removal,[],[f189])).
% 0.21/0.30  thf(f191,plain,(
% 0.21/0.30    ~spl1_4 | ~spl1_8 | ~spl1_11 | ~spl1_13),
% 0.21/0.30    inference(avatar_contradiction_clause,[],[f190])).
% 0.21/0.30  cnf(s2, plain, spl1_1, inference(sat_conversion,[],[f34])).
% 0.21/0.30  cnf(s3, plain, spl1_3 | spl1_4, inference(sat_conversion,[],[f41])).
% 0.21/0.30  cnf(s4, plain, ~spl1_1 | ~spl1_3, inference(sat_conversion,[],[f44])).
% 0.21/0.30  cnf(s6, plain, spl1_5, inference(sat_conversion,[],[f80])).
% 0.21/0.30  cnf(s7, plain, spl1_7 | spl1_8, inference(sat_conversion,[],[f87])).
% 0.21/0.30  cnf(s8, plain, ~spl1_5 | ~spl1_7, inference(sat_conversion,[],[f90])).
% 0.21/0.30  cnf(s10, plain, ~spl1_8 | spl1_11 | spl1_12, inference(sat_conversion,[],[f142])).
% 0.21/0.30  cnf(s11, plain, ~spl1_1 | spl1_13 | spl1_14, inference(sat_conversion,[],[f149])).
% 0.21/0.30  cnf(s13, plain, ~spl1_5 | spl1_11 | spl1_14, inference(sat_conversion,[],[f154])).
% 0.21/0.30  cnf(s15, plain, ~spl1_4 | spl1_13 | spl1_17, inference(sat_conversion,[],[f162])).
% 0.21/0.30  cnf(s16, plain, spl1_16 | spl1_18, inference(sat_conversion,[],[f167])).
% 0.21/0.30  cnf(s17, plain, ~spl1_5 | ~spl1_11 | ~spl1_16, inference(sat_conversion,[],[f177])).
% 0.21/0.30  cnf(s18, plain, ~spl1_4 | ~spl1_13 | ~spl1_16, inference(sat_conversion,[],[f180])).
% 0.21/0.30  cnf(s19, plain, ~spl1_12 | ~spl1_17, inference(sat_conversion,[],[f183])).
% 0.21/0.30  cnf(s20, plain, ~spl1_14 | ~spl1_18, inference(sat_conversion,[],[f186])).
% 0.21/0.30  cnf(s21, plain, ~spl1_4 | ~spl1_8 | ~spl1_11 | ~spl1_13, inference(sat_conversion,[],[f191])).
% 0.21/0.30  cnf(s22, plain, ~spl1_7, inference(rat,[],[s8,s6])).
% 0.21/0.30  cnf(s23, plain, spl1_8, inference(rat,[],[s7,s22])).
% 0.21/0.30  cnf(s24, plain, ~spl1_3, inference(rat,[],[s4,s2])).
% 0.21/0.30  cnf(s25, plain, spl1_4, inference(rat,[],[s3,s24])).
% 0.21/0.30  cnf(s26, plain, spl1_11, inference(rat,[],[s18,s15,s16,s19,s20,s10,s13,s25,s23,s6])).
% 0.21/0.30  cnf(s27, plain, ~spl1_16, inference(rat,[],[s17,s6,s26])).
% 0.21/0.30  cnf(s28, plain, ~spl1_13, inference(rat,[],[s21,s25,s23,s26])).
% 0.21/0.30  cnf(s29, plain, spl1_18, inference(rat,[],[s16,s27])).
% 0.21/0.30  cnf(s32, plain, spl1_14, inference(rat,[],[s11,s2,s28])).
% 0.21/0.30  cnf(s33, plain, $false, inference(rat,[],[s20,s29,s32])).
% 0.21/0.30  thf(f194,plain,(
% 0.21/0.30    $false),
% 0.21/0.30    inference(avatar_sat_refutation,[],[s33])).
% 0.21/0.30  % SZS output end Proof for theBenchmark
% 0.21/0.30  % (57658)------------------------------
% 0.21/0.30  % (57658)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.30  % (57658)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.30  % (57658)CaDiCaL version: 2.1.3
% 0.21/0.30  % (57658)Termination reason: Refutation
% 0.21/0.30  % (57658)Time elapsed: 0.012 s
% 0.21/0.30  % (57658)Peak memory usage: 13 MB
% 0.21/0.30  % (57658)Instructions burned: 9 (million)
% 0.21/0.30  % (57648)Success in time 0.057 s
% 0.21/0.30  % Vampire exiting
%------------------------------------------------------------------------------