TSTP Solution File: SYO450^6 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO450^6 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n019.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 09:04:30 EDT 2024

% Result   : Theorem 0.14s 0.40s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : SYO450^6 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35  % Computer : n019.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon May 20 10:52:08 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  This is a TH0_THM_EQU_NAR problem
% 0.14/0.35  Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.37  % (29295)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.14/0.37  % (29293)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.14/0.37  % (29294)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.37  % (29289)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.14/0.37  % (29295)Instruction limit reached!
% 0.14/0.37  % (29295)------------------------------
% 0.14/0.37  % (29295)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (29295)Termination reason: Unknown
% 0.14/0.37  % (29295)Termination phase: shuffling
% 0.14/0.37  
% 0.14/0.37  % (29295)Memory used [KB]: 1023
% 0.14/0.37  % (29295)Time elapsed: 0.003 s
% 0.14/0.37  % (29295)Instructions burned: 3 (million)
% 0.14/0.37  % (29295)------------------------------
% 0.14/0.37  % (29295)------------------------------
% 0.14/0.37  % (29292)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.37  % (29292)Instruction limit reached!
% 0.14/0.37  % (29292)------------------------------
% 0.14/0.37  % (29292)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (29292)Termination reason: Unknown
% 0.14/0.37  % (29292)Termination phase: shuffling
% 0.14/0.37  
% 0.14/0.37  % (29292)Memory used [KB]: 1023
% 0.14/0.37  % (29292)Time elapsed: 0.003 s
% 0.14/0.37  % (29292)Instructions burned: 2 (million)
% 0.14/0.37  % (29292)------------------------------
% 0.14/0.37  % (29292)------------------------------
% 0.14/0.37  % (29288)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.14/0.37  % (29289)Instruction limit reached!
% 0.14/0.37  % (29289)------------------------------
% 0.14/0.37  % (29289)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (29289)Termination reason: Unknown
% 0.14/0.37  % (29289)Termination phase: shuffling
% 0.14/0.37  
% 0.14/0.37  % (29289)Memory used [KB]: 1023
% 0.14/0.37  % (29289)Time elapsed: 0.004 s
% 0.14/0.37  % (29289)Instructions burned: 4 (million)
% 0.14/0.37  % (29289)------------------------------
% 0.14/0.37  % (29289)------------------------------
% 0.14/0.38  % (29293)Refutation not found, incomplete strategy
% 0.14/0.38  % (29293)------------------------------
% 0.14/0.38  % (29293)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38  % (29293)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38  
% 0.14/0.38  
% 0.14/0.38  % (29293)Memory used [KB]: 5628
% 0.14/0.38  % (29293)Time elapsed: 0.009 s
% 0.14/0.38  % (29293)Instructions burned: 14 (million)
% 0.14/0.38  % (29293)------------------------------
% 0.14/0.38  % (29293)------------------------------
% 0.14/0.38  % (29294)Instruction limit reached!
% 0.14/0.38  % (29294)------------------------------
% 0.14/0.38  % (29294)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38  % (29294)Termination reason: Unknown
% 0.14/0.38  % (29294)Termination phase: Saturation
% 0.14/0.38  
% 0.14/0.38  % (29294)Memory used [KB]: 5628
% 0.14/0.38  % (29294)Time elapsed: 0.011 s
% 0.14/0.38  % (29294)Instructions burned: 19 (million)
% 0.14/0.38  % (29294)------------------------------
% 0.14/0.38  % (29294)------------------------------
% 0.14/0.38  % (29290)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2999ds/27Mi)
% 0.14/0.39  % (29291)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.39  % (29291)Instruction limit reached!
% 0.14/0.39  % (29291)------------------------------
% 0.14/0.39  % (29291)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39  % (29291)Termination reason: Unknown
% 0.14/0.39  % (29291)Termination phase: shuffling
% 0.14/0.39  
% 0.14/0.39  % (29291)Memory used [KB]: 1023
% 0.14/0.39  % (29291)Time elapsed: 0.003 s
% 0.14/0.39  % (29291)Instructions burned: 2 (million)
% 0.14/0.39  % (29291)------------------------------
% 0.14/0.39  % (29291)------------------------------
% 0.14/0.39  % (29297)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.14/0.39  % (29296)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.14/0.39  % (29298)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.14/0.39  % (29298)Instruction limit reached!
% 0.14/0.39  % (29298)------------------------------
% 0.14/0.39  % (29298)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39  % (29298)Termination reason: Unknown
% 0.14/0.39  % (29298)Termination phase: shuffling
% 0.14/0.39  
% 0.14/0.39  % (29298)Memory used [KB]: 1023
% 0.14/0.39  % (29298)Time elapsed: 0.004 s
% 0.14/0.39  % (29298)Instructions burned: 4 (million)
% 0.14/0.39  % (29298)------------------------------
% 0.14/0.39  % (29298)------------------------------
% 0.14/0.39  % (29290)Instruction limit reached!
% 0.14/0.39  % (29290)------------------------------
% 0.14/0.39  % (29290)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39  % (29290)Termination reason: Unknown
% 0.14/0.39  % (29290)Termination phase: Saturation
% 0.14/0.39  
% 0.14/0.39  % (29290)Memory used [KB]: 5756
% 0.14/0.39  % (29290)Time elapsed: 0.015 s
% 0.14/0.39  % (29290)Instructions burned: 27 (million)
% 0.14/0.39  % (29290)------------------------------
% 0.14/0.39  % (29290)------------------------------
% 0.14/0.40  % (29300)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.14/0.40  % (29297)Instruction limit reached!
% 0.14/0.40  % (29297)------------------------------
% 0.14/0.40  % (29297)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40  % (29297)Termination reason: Unknown
% 0.14/0.40  % (29297)Termination phase: Saturation
% 0.14/0.40  
% 0.14/0.40  % (29297)Memory used [KB]: 5628
% 0.14/0.40  % (29297)Time elapsed: 0.010 s
% 0.14/0.40  % (29297)Instructions burned: 16 (million)
% 0.14/0.40  % (29297)------------------------------
% 0.14/0.40  % (29297)------------------------------
% 0.14/0.40  % (29288)First to succeed.
% 0.14/0.40  % (29301)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.14/0.40  % (29300)Instruction limit reached!
% 0.14/0.40  % (29300)------------------------------
% 0.14/0.40  % (29300)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40  % (29300)Termination reason: Unknown
% 0.14/0.40  % (29300)Termination phase: Property scanning
% 0.14/0.40  
% 0.14/0.40  % (29300)Memory used [KB]: 1023
% 0.14/0.40  % (29300)Time elapsed: 0.005 s
% 0.14/0.40  % (29300)Instructions burned: 7 (million)
% 0.14/0.40  % (29300)------------------------------
% 0.14/0.40  % (29300)------------------------------
% 0.14/0.40  % (29299)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on theBenchmark for (2999ds/1041Mi)
% 0.14/0.40  % (29288)Refutation found. Thanks to Tanya!
% 0.14/0.40  % SZS status Theorem for theBenchmark
% 0.14/0.40  % SZS output start Proof for theBenchmark
% 0.14/0.40  thf(type_def_5, type, mu: $tType).
% 0.14/0.40  thf(func_def_0, type, mu: $tType).
% 0.14/0.40  thf(func_def_1, type, meq_ind: mu > mu > $i > $o).
% 0.14/0.40  thf(func_def_2, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40  thf(func_def_4, type, mnot: ($i > $o) > $i > $o).
% 0.14/0.40  thf(func_def_5, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40  thf(func_def_6, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40  thf(func_def_7, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40  thf(func_def_8, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40  thf(func_def_9, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40  thf(func_def_10, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40  thf(func_def_11, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.14/0.40  thf(func_def_12, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.14/0.40  thf(func_def_13, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.14/0.40  thf(func_def_14, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.14/0.40  thf(func_def_15, type, mtrue: $i > $o).
% 0.14/0.40  thf(func_def_16, type, mfalse: $i > $o).
% 0.14/0.40  thf(func_def_17, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40  thf(func_def_18, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40  thf(func_def_19, type, mreflexive: ($i > $i > $o) > $o).
% 0.14/0.40  thf(func_def_20, type, msymmetric: ($i > $i > $o) > $o).
% 0.14/0.40  thf(func_def_21, type, mserial: ($i > $i > $o) > $o).
% 0.14/0.40  thf(func_def_22, type, mtransitive: ($i > $i > $o) > $o).
% 0.14/0.40  thf(func_def_23, type, meuclidean: ($i > $i > $o) > $o).
% 0.14/0.40  thf(func_def_24, type, mpartially_functional: ($i > $i > $o) > $o).
% 0.14/0.40  thf(func_def_25, type, mfunctional: ($i > $i > $o) > $o).
% 0.14/0.40  thf(func_def_26, type, mweakly_dense: ($i > $i > $o) > $o).
% 0.14/0.40  thf(func_def_27, type, mweakly_connected: ($i > $i > $o) > $o).
% 0.14/0.40  thf(func_def_28, type, mweakly_directed: ($i > $i > $o) > $o).
% 0.14/0.40  thf(func_def_29, type, mvalid: ($i > $o) > $o).
% 0.14/0.40  thf(func_def_30, type, minvalid: ($i > $o) > $o).
% 0.14/0.40  thf(func_def_31, type, msatisfiable: ($i > $o) > $o).
% 0.14/0.40  thf(func_def_32, type, mcountersatisfiable: ($i > $o) > $o).
% 0.14/0.40  thf(func_def_33, type, rel_s5: $i > $i > $o).
% 0.14/0.40  thf(func_def_34, type, mbox_s5: ($i > $o) > $i > $o).
% 0.14/0.40  thf(func_def_35, type, mdia_s5: ($i > $o) > $i > $o).
% 0.14/0.40  thf(func_def_36, type, p: $i > $o).
% 0.14/0.40  thf(func_def_37, type, q: $i > $o).
% 0.14/0.40  thf(func_def_38, type, r: $i > $o).
% 0.14/0.40  thf(func_def_56, type, sK2: $i > $i).
% 0.14/0.40  thf(f575,plain,(
% 0.14/0.40    $false),
% 0.14/0.40    inference(avatar_sat_refutation,[],[f331,f337,f348,f357,f554,f567,f574])).
% 0.14/0.40  thf(f574,plain,(
% 0.14/0.40    ~spl0_2 | ~spl0_12),
% 0.14/0.40    inference(avatar_contradiction_clause,[],[f573])).
% 0.14/0.40  thf(f573,plain,(
% 0.14/0.40    $false | (~spl0_2 | ~spl0_12)),
% 0.14/0.40    inference(trivial_inequality_removal,[],[f569])).
% 0.14/0.40  thf(f569,plain,(
% 0.14/0.40    ($false = $true) | (~spl0_2 | ~spl0_12)),
% 0.14/0.40    inference(superposition,[],[f545,f326])).
% 0.14/0.40  thf(f326,plain,(
% 0.14/0.40    ((r @ (sK2 @ sK1)) = $false) | ~spl0_2),
% 0.14/0.40    inference(avatar_component_clause,[],[f324])).
% 0.14/0.40  thf(f324,plain,(
% 0.14/0.40    spl0_2 <=> ((r @ (sK2 @ sK1)) = $false)),
% 0.14/0.40    introduced(avatar_definition,[new_symbols(naming,[spl0_2])])).
% 0.14/0.40  thf(f545,plain,(
% 0.14/0.40    ((r @ (sK2 @ sK1)) = $true) | ~spl0_12),
% 0.14/0.40    inference(avatar_component_clause,[],[f543])).
% 0.14/0.40  thf(f543,plain,(
% 0.14/0.40    spl0_12 <=> ((r @ (sK2 @ sK1)) = $true)),
% 0.14/0.40    introduced(avatar_definition,[new_symbols(naming,[spl0_12])])).
% 0.14/0.40  thf(f567,plain,(
% 0.14/0.40    ~spl0_4 | ~spl0_11),
% 0.14/0.40    inference(avatar_contradiction_clause,[],[f566])).
% 0.14/0.40  thf(f566,plain,(
% 0.14/0.40    $false | (~spl0_4 | ~spl0_11)),
% 0.14/0.40    inference(trivial_inequality_removal,[],[f562])).
% 0.14/0.40  thf(f562,plain,(
% 0.14/0.40    ($false = $true) | (~spl0_4 | ~spl0_11)),
% 0.14/0.40    inference(superposition,[],[f541,f335])).
% 0.14/0.40  thf(f335,plain,(
% 0.14/0.40    ((q @ (sK2 @ sK1)) = $true) | ~spl0_4),
% 0.14/0.40    inference(avatar_component_clause,[],[f333])).
% 0.14/0.40  thf(f333,plain,(
% 0.14/0.40    spl0_4 <=> ((q @ (sK2 @ sK1)) = $true)),
% 0.14/0.40    introduced(avatar_definition,[new_symbols(naming,[spl0_4])])).
% 0.14/0.40  thf(f541,plain,(
% 0.14/0.40    ((q @ (sK2 @ sK1)) = $false) | ~spl0_11),
% 0.14/0.40    inference(avatar_component_clause,[],[f539])).
% 0.14/0.40  thf(f539,plain,(
% 0.14/0.40    spl0_11 <=> ((q @ (sK2 @ sK1)) = $false)),
% 0.14/0.40    introduced(avatar_definition,[new_symbols(naming,[spl0_11])])).
% 0.14/0.40  thf(f554,plain,(
% 0.14/0.40    spl0_11 | spl0_12 | spl0_3),
% 0.14/0.40    inference(avatar_split_clause,[],[f553,f328,f543,f539])).
% 0.14/0.40  thf(f328,plain,(
% 0.14/0.40    spl0_3 <=> ((p @ sK1) = $false)),
% 0.14/0.40    introduced(avatar_definition,[new_symbols(naming,[spl0_3])])).
% 0.14/0.40  thf(f553,plain,(
% 0.14/0.40    ((r @ (sK2 @ sK1)) = $true) | ((q @ (sK2 @ sK1)) = $false) | spl0_3),
% 0.14/0.40    inference(subsumption_resolution,[],[f514,f329])).
% 0.14/0.40  thf(f329,plain,(
% 0.14/0.40    ((p @ sK1) != $false) | spl0_3),
% 0.14/0.40    inference(avatar_component_clause,[],[f328])).
% 0.14/0.40  thf(f514,plain,(
% 0.14/0.40    ((p @ sK1) = $false) | ((r @ (sK2 @ sK1)) = $true) | ((q @ (sK2 @ sK1)) = $false)),
% 0.14/0.40    inference(trivial_inequality_removal,[],[f504])).
% 0.14/0.40  thf(f504,plain,(
% 0.14/0.40    ((r @ (sK2 @ sK1)) = $true) | ((p @ sK1) = $false) | ((q @ (sK2 @ sK1)) = $false) | ($false = $true)),
% 0.14/0.40    inference(superposition,[],[f181,f222])).
% 0.14/0.40  thf(f222,plain,(
% 0.14/0.40    ( ! [X1 : $i] : (((rel_s5 @ X1 @ X1) = $true)) )),
% 0.14/0.40    inference(beta_eta_normalization,[],[f221])).
% 0.14/0.40  thf(f221,plain,(
% 0.14/0.40    ( ! [X1 : $i] : ((((^[Y0 : $i]: (rel_s5 @ Y0 @ Y0)) @ X1) = $true)) )),
% 0.14/0.40    inference(pi_clausification,[],[f220])).
% 0.14/0.40  thf(f220,plain,(
% 0.14/0.40    ((!! @ $i @ (^[Y0 : $i]: (rel_s5 @ Y0 @ Y0))) = $true)),
% 0.14/0.40    inference(beta_eta_normalization,[],[f160])).
% 0.14/0.40  thf(f160,plain,(
% 0.14/0.40    (((^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))) @ rel_s5) = $true)),
% 0.14/0.40    inference(definition_unfolding,[],[f133,f116])).
% 0.14/0.40  thf(f116,plain,(
% 0.14/0.40    (mreflexive = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))))),
% 0.14/0.40    inference(cnf_transformation,[],[f99])).
% 0.14/0.40  thf(f99,plain,(
% 0.14/0.40    (mreflexive = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))))),
% 0.14/0.40    inference(fool_elimination,[],[f98])).
% 0.14/0.40  thf(f98,plain,(
% 0.14/0.40    ((^[X0 : $i > $i > $o] : (! [X1] : (X0 @ X1 @ X1))) = mreflexive)),
% 0.14/0.40    inference(rectify,[],[f18])).
% 0.14/0.40  thf(f18,axiom,(
% 0.14/0.40    ((^[X6 : $i > $i > $o] : (! [X8] : (X6 @ X8 @ X8))) = mreflexive)),
% 0.14/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mreflexive)).
% 0.14/0.40  thf(f133,plain,(
% 0.14/0.40    ((mreflexive @ rel_s5) = $true)),
% 0.14/0.40    inference(cnf_transformation,[],[f87])).
% 0.14/0.40  thf(f87,plain,(
% 0.14/0.40    ((mreflexive @ rel_s5) = $true)),
% 0.14/0.40    inference(fool_elimination,[],[f86])).
% 0.14/0.40  thf(f86,plain,(
% 0.14/0.40    (mreflexive @ rel_s5)),
% 0.14/0.40    inference(rectify,[],[f34])).
% 0.14/0.40  thf(f34,axiom,(
% 0.14/0.40    (mreflexive @ rel_s5)),
% 0.14/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a1)).
% 0.14/0.40  thf(f181,plain,(
% 0.14/0.40    ( ! [X1 : $i] : (((rel_s5 @ sK1 @ X1) = $false) | ((r @ (sK2 @ X1)) = $true) | ($false = (p @ X1)) | ((q @ (sK2 @ X1)) = $false)) )),
% 0.14/0.40    inference(not_proxy_clausification,[],[f180])).
% 0.14/0.40  thf(f180,plain,(
% 0.14/0.40    ( ! [X1 : $i] : (($false = (p @ X1)) | ((rel_s5 @ sK1 @ X1) = $false) | ((r @ (sK2 @ X1)) = $true) | ((~ (q @ (sK2 @ X1))) = $true)) )),
% 0.14/0.40    inference(binary_proxy_clausification,[],[f179])).
% 0.14/0.40  thf(f179,plain,(
% 0.14/0.40    ( ! [X1 : $i] : ((((~ (q @ (sK2 @ X1))) | (r @ (sK2 @ X1))) = $true) | ((rel_s5 @ sK1 @ X1) = $false) | ($false = (p @ X1))) )),
% 0.14/0.40    inference(not_proxy_clausification,[],[f178])).
% 0.14/0.40  thf(f178,plain,(
% 0.14/0.40    ( ! [X1 : $i] : (((rel_s5 @ sK1 @ X1) = $false) | ((~ ((~ (q @ (sK2 @ X1))) | (r @ (sK2 @ X1)))) = $false) | ($false = (p @ X1))) )),
% 0.14/0.40    inference(binary_proxy_clausification,[],[f176])).
% 0.14/0.40  thf(f176,plain,(
% 0.14/0.40    ( ! [X1 : $i] : (((rel_s5 @ sK1 @ X1) = $false) | (((~ ((~ (q @ (sK2 @ X1))) | (r @ (sK2 @ X1)))) | (~ (rel_s5 @ X1 @ (sK2 @ X1)))) = $false) | ($false = (p @ X1))) )),
% 0.14/0.40    inference(beta_eta_normalization,[],[f175])).
% 0.14/0.40  thf(f175,plain,(
% 0.14/0.40    ( ! [X1 : $i] : (($false = ((^[Y0 : $i]: ((~ ((~ (q @ Y0)) | (r @ Y0))) | (~ (rel_s5 @ X1 @ Y0)))) @ (sK2 @ X1))) | ((rel_s5 @ sK1 @ X1) = $false) | ($false = (p @ X1))) )),
% 0.14/0.40    inference(sigma_clausification,[],[f174])).
% 0.14/0.40  thf(f174,plain,(
% 0.14/0.40    ( ! [X1 : $i] : (($false = (p @ X1)) | ((rel_s5 @ sK1 @ X1) = $false) | ((!! @ $i @ (^[Y0 : $i]: ((~ ((~ (q @ Y0)) | (r @ Y0))) | (~ (rel_s5 @ X1 @ Y0))))) = $false)) )),
% 0.14/0.40    inference(not_proxy_clausification,[],[f173])).
% 0.14/0.40  thf(f173,plain,(
% 0.14/0.40    ( ! [X1 : $i] : (((rel_s5 @ sK1 @ X1) = $false) | ($false = (p @ X1)) | ((~ (!! @ $i @ (^[Y0 : $i]: ((~ ((~ (q @ Y0)) | (r @ Y0))) | (~ (rel_s5 @ X1 @ Y0)))))) = $true)) )),
% 0.14/0.40    inference(not_proxy_clausification,[],[f172])).
% 0.14/0.40  thf(f172,plain,(
% 0.14/0.40    ( ! [X1 : $i] : (((rel_s5 @ sK1 @ X1) = $false) | ((~ (p @ X1)) = $true) | ((~ (!! @ $i @ (^[Y0 : $i]: ((~ ((~ (q @ Y0)) | (r @ Y0))) | (~ (rel_s5 @ X1 @ Y0)))))) = $true)) )),
% 0.14/0.40    inference(binary_proxy_clausification,[],[f171])).
% 0.14/0.40  thf(f171,plain,(
% 0.14/0.40    ( ! [X1 : $i] : (((rel_s5 @ sK1 @ X1) = $false) | ($true = ((~ (p @ X1)) | (~ (!! @ $i @ (^[Y0 : $i]: ((~ ((~ (q @ Y0)) | (r @ Y0))) | (~ (rel_s5 @ X1 @ Y0))))))))) )),
% 0.14/0.40    inference(not_proxy_clausification,[],[f170])).
% 0.14/0.40  thf(f170,plain,(
% 0.14/0.40    ( ! [X1 : $i] : (($true = (~ (rel_s5 @ sK1 @ X1))) | ($true = ((~ (p @ X1)) | (~ (!! @ $i @ (^[Y0 : $i]: ((~ ((~ (q @ Y0)) | (r @ Y0))) | (~ (rel_s5 @ X1 @ Y0))))))))) )),
% 0.14/0.40    inference(binary_proxy_clausification,[],[f169])).
% 0.14/0.40  thf(f169,plain,(
% 0.14/0.40    ( ! [X1 : $i] : (((((~ (p @ X1)) | (~ (!! @ $i @ (^[Y0 : $i]: ((~ ((~ (q @ Y0)) | (r @ Y0))) | (~ (rel_s5 @ X1 @ Y0))))))) | (~ (rel_s5 @ sK1 @ X1))) = $true)) )),
% 0.14/0.40    inference(beta_eta_normalization,[],[f168])).
% 0.14/0.40  thf(f168,plain,(
% 0.14/0.40    ( ! [X1 : $i] : ((((^[Y0 : $i]: (((~ (p @ Y0)) | (~ (!! @ $i @ (^[Y1 : $i]: ((~ ((~ (q @ Y1)) | (r @ Y1))) | (~ (rel_s5 @ Y0 @ Y1))))))) | (~ (rel_s5 @ sK1 @ Y0)))) @ X1) = $true)) )),
% 0.14/0.40    inference(pi_clausification,[],[f167])).
% 0.14/0.40  thf(f167,plain,(
% 0.14/0.40    ((!! @ $i @ (^[Y0 : $i]: (((~ (p @ Y0)) | (~ (!! @ $i @ (^[Y1 : $i]: ((~ ((~ (q @ Y1)) | (r @ Y1))) | (~ (rel_s5 @ Y0 @ Y1))))))) | (~ (rel_s5 @ sK1 @ Y0))))) = $true)),
% 0.14/0.40    inference(not_proxy_clausification,[],[f166])).
% 0.14/0.40  thf(f166,plain,(
% 0.14/0.40    ($false = (~ (!! @ $i @ (^[Y0 : $i]: (((~ (p @ Y0)) | (~ (!! @ $i @ (^[Y1 : $i]: ((~ ((~ (q @ Y1)) | (r @ Y1))) | (~ (rel_s5 @ Y0 @ Y1))))))) | (~ (rel_s5 @ sK1 @ Y0)))))))),
% 0.14/0.40    inference(binary_proxy_clausification,[],[f164])).
% 0.14/0.40  thf(f164,plain,(
% 0.14/0.40    ($false = ((~ (!! @ $i @ (^[Y0 : $i]: (((~ (p @ Y0)) | (~ (!! @ $i @ (^[Y1 : $i]: ((~ ((~ (q @ Y1)) | (r @ Y1))) | (~ (rel_s5 @ Y0 @ Y1))))))) | (~ (rel_s5 @ sK1 @ Y0)))))) | (~ (!! @ $i @ (^[Y0 : $i]: ((~ ((~ (q @ Y0)) | ((~ (!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_s5 @ Y0 @ Y1)))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((~ (r @ Y1)) | (~ (rel_s5 @ Y0 @ Y1))))))))) | (~ (rel_s5 @ sK1 @ Y0))))))))),
% 0.14/0.40    inference(beta_eta_normalization,[],[f163])).
% 0.14/0.40  thf(f163,plain,(
% 0.14/0.40    (((^[Y0 : $i]: ((~ (!! @ $i @ (^[Y1 : $i]: (((~ (p @ Y1)) | (~ (!! @ $i @ (^[Y2 : $i]: ((~ ((~ (q @ Y2)) | (r @ Y2))) | (~ (rel_s5 @ Y1 @ Y2))))))) | (~ (rel_s5 @ Y0 @ Y1)))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((~ ((~ (q @ Y1)) | ((~ (!! @ $i @ (^[Y2 : $i]: ((p @ Y2) | (~ (rel_s5 @ Y1 @ Y2)))))) | (~ (!! @ $i @ (^[Y2 : $i]: ((~ (r @ Y2)) | (~ (rel_s5 @ Y1 @ Y2))))))))) | (~ (rel_s5 @ Y0 @ Y1)))))))) @ sK1) = $false)),
% 0.14/0.40    inference(sigma_clausification,[],[f162])).
% 0.14/0.40  thf(f162,plain,(
% 0.14/0.40    ((!! @ $i @ (^[Y0 : $i]: ((~ (!! @ $i @ (^[Y1 : $i]: (((~ (p @ Y1)) | (~ (!! @ $i @ (^[Y2 : $i]: ((~ ((~ (q @ Y2)) | (r @ Y2))) | (~ (rel_s5 @ Y1 @ Y2))))))) | (~ (rel_s5 @ Y0 @ Y1)))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((~ ((~ (q @ Y1)) | ((~ (!! @ $i @ (^[Y2 : $i]: ((p @ Y2) | (~ (rel_s5 @ Y1 @ Y2)))))) | (~ (!! @ $i @ (^[Y2 : $i]: ((~ (r @ Y2)) | (~ (rel_s5 @ Y1 @ Y2))))))))) | (~ (rel_s5 @ Y0 @ Y1))))))))) != $true)),
% 0.14/0.40    inference(beta_eta_normalization,[],[f159])).
% 0.14/0.40  thf(f159,plain,(
% 0.14/0.40    ($true != ((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y2 @ Y4) | (Y3 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ Y1)))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_s5 @ Y1 @ Y2)))))))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y2 @ Y4) | (Y3 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ Y1)))) @ p @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (rel_s5 @ Y2 @ Y3)))))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ Y0)))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y2 @ Y4) | (Y3 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ Y1)))) @ q @ r)))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (rel_s5 @ Y2 @ Y3)))))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ Y0)))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y2 @ Y4) | (Y3 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ Y1)))) @ q @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y2 @ Y4) | (Y3 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ Y1)))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_s5 @ Y1 @ Y2)))))))) @ p) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (rel_s5 @ Y2 @ Y3)))))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ Y0)))) @ r)))))))),
% 0.14/0.40    inference(definition_unfolding,[],[f131,f145,f149,f142,f149,f157,f149,f157,f149,f149,f142,f157])).
% 0.14/0.40  thf(f157,plain,(
% 0.14/0.40    (mdia_s5 = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (rel_s5 @ Y2 @ Y3)))))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ Y0)))))),
% 0.14/0.40    inference(definition_unfolding,[],[f117,f138,f142,f138])).
% 0.14/0.40  thf(f138,plain,(
% 0.14/0.40    (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.14/0.40    inference(cnf_transformation,[],[f50])).
% 0.14/0.40  thf(f50,plain,(
% 0.14/0.40    (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.14/0.40    inference(fool_elimination,[],[f49])).
% 0.14/0.40  thf(f49,plain,(
% 0.14/0.40    (mnot = (^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))))),
% 0.14/0.40    inference(rectify,[],[f3])).
% 0.14/0.40  thf(f3,axiom,(
% 0.14/0.40    (mnot = (^[X3 : $i > $o, X2 : $i] : (~(X3 @ X2))))),
% 0.14/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mnot)).
% 0.14/0.40  thf(f117,plain,(
% 0.14/0.40    (mdia_s5 = (^[Y0 : $i > $o]: (mnot @ (mbox_s5 @ (mnot @ Y0)))))),
% 0.14/0.40    inference(cnf_transformation,[],[f47])).
% 0.14/0.40  thf(f47,plain,(
% 0.14/0.40    (mdia_s5 = (^[Y0 : $i > $o]: (mnot @ (mbox_s5 @ (mnot @ Y0)))))),
% 0.14/0.40    inference(fool_elimination,[],[f46])).
% 0.14/0.40  thf(f46,plain,(
% 0.14/0.40    ((^[X0 : $i > $o] : (mnot @ (mbox_s5 @ (mnot @ X0)))) = mdia_s5)),
% 0.14/0.40    inference(rectify,[],[f33])).
% 0.14/0.40  thf(f33,axiom,(
% 0.14/0.40    ((^[X3 : $i > $o] : (mnot @ (mbox_s5 @ (mnot @ X3)))) = mdia_s5)),
% 0.14/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mdia_s5)).
% 0.14/0.40  thf(f142,plain,(
% 0.14/0.40    (mbox_s5 = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_s5 @ Y1 @ Y2)))))))))),
% 0.14/0.40    inference(cnf_transformation,[],[f105])).
% 0.14/0.40  thf(f105,plain,(
% 0.14/0.40    (mbox_s5 = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_s5 @ Y1 @ Y2)))))))))),
% 0.14/0.40    inference(fool_elimination,[],[f104])).
% 0.14/0.40  thf(f104,plain,(
% 0.14/0.40    (mbox_s5 = (^[X0 : $i > $o, X1 : $i] : (! [X2] : (~(rel_s5 @ X1 @ X2) | (X0 @ X2)))))),
% 0.14/0.40    inference(rectify,[],[f32])).
% 0.14/0.40  thf(f32,axiom,(
% 0.14/0.40    (mbox_s5 = (^[X3 : $i > $o, X2 : $i] : (! [X7] : (~(rel_s5 @ X2 @ X7) | (X3 @ X7)))))),
% 0.14/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox_s5)).
% 0.14/0.40  thf(f149,plain,(
% 0.14/0.40    (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y2 @ Y4) | (Y3 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ Y1)))))),
% 0.14/0.40    inference(definition_unfolding,[],[f114,f130,f138])).
% 0.14/0.40  thf(f130,plain,(
% 0.14/0.40    (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) | (Y1 @ Y2))))))))),
% 0.14/0.40    inference(cnf_transformation,[],[f77])).
% 0.14/0.40  thf(f77,plain,(
% 0.14/0.40    (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) | (Y1 @ Y2))))))))),
% 0.14/0.40    inference(fool_elimination,[],[f76])).
% 0.14/0.40  thf(f76,plain,(
% 0.14/0.40    ((^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X1 @ X2) | (X0 @ X2))) = mor)),
% 0.14/0.40    inference(rectify,[],[f4])).
% 0.14/0.40  thf(f4,axiom,(
% 0.14/0.40    ((^[X3 : $i > $o, X4 : $i > $o, X2 : $i] : ((X4 @ X2) | (X3 @ X2))) = mor)),
% 0.14/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mor)).
% 0.14/0.40  thf(f114,plain,(
% 0.14/0.40    (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.14/0.40    inference(cnf_transformation,[],[f109])).
% 0.14/0.40  thf(f109,plain,(
% 0.14/0.40    (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.14/0.40    inference(fool_elimination,[],[f108])).
% 0.14/0.40  thf(f108,plain,(
% 0.14/0.40    (mimplies = (^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)))),
% 0.14/0.40    inference(rectify,[],[f6])).
% 0.14/0.40  thf(f6,axiom,(
% 0.14/0.40    (mimplies = (^[X3 : $i > $o, X4 : $i > $o] : (mor @ (mnot @ X3) @ X4)))),
% 0.14/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mimplies)).
% 0.14/0.40  thf(f145,plain,(
% 0.14/0.40    (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.14/0.40    inference(cnf_transformation,[],[f62])).
% 0.14/0.40  thf(f62,plain,(
% 0.14/0.40    (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.14/0.40    inference(fool_elimination,[],[f61])).
% 0.14/0.40  thf(f61,plain,(
% 0.14/0.40    (mvalid = (^[X0 : $i > $o] : (! [X1] : (X0 @ X1))))),
% 0.14/0.40    inference(rectify,[],[f28])).
% 0.14/0.40  thf(f28,axiom,(
% 0.14/0.40    (mvalid = (^[X3 : $i > $o] : (! [X2] : (X3 @ X2))))),
% 0.14/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mvalid)).
% 0.14/0.40  thf(f131,plain,(
% 0.14/0.40    ((mvalid @ (mimplies @ (mbox_s5 @ (mimplies @ p @ (mdia_s5 @ (mimplies @ q @ r)))) @ (mdia_s5 @ (mimplies @ q @ (mimplies @ (mbox_s5 @ p) @ (mdia_s5 @ r)))))) != $true)),
% 0.14/0.40    inference(cnf_transformation,[],[f110])).
% 0.14/0.40  thf(f110,plain,(
% 0.14/0.40    ((mvalid @ (mimplies @ (mbox_s5 @ (mimplies @ p @ (mdia_s5 @ (mimplies @ q @ r)))) @ (mdia_s5 @ (mimplies @ q @ (mimplies @ (mbox_s5 @ p) @ (mdia_s5 @ r)))))) != $true)),
% 0.14/0.40    inference(flattening,[],[f68])).
% 0.14/0.40  thf(f68,plain,(
% 0.14/0.40    ~((mvalid @ (mimplies @ (mbox_s5 @ (mimplies @ p @ (mdia_s5 @ (mimplies @ q @ r)))) @ (mdia_s5 @ (mimplies @ q @ (mimplies @ (mbox_s5 @ p) @ (mdia_s5 @ r)))))) = $true)),
% 0.14/0.40    inference(fool_elimination,[],[f67])).
% 0.14/0.40  thf(f67,plain,(
% 0.14/0.40    ~(mvalid @ (mimplies @ (mbox_s5 @ (mimplies @ p @ (mdia_s5 @ (mimplies @ q @ r)))) @ (mdia_s5 @ (mimplies @ q @ (mimplies @ (mbox_s5 @ p) @ (mdia_s5 @ r))))))),
% 0.14/0.40    inference(rectify,[],[f38])).
% 0.14/0.40  thf(f38,negated_conjecture,(
% 0.14/0.40    ~(mvalid @ (mimplies @ (mbox_s5 @ (mimplies @ p @ (mdia_s5 @ (mimplies @ q @ r)))) @ (mdia_s5 @ (mimplies @ q @ (mimplies @ (mbox_s5 @ p) @ (mdia_s5 @ r))))))),
% 0.14/0.40    inference(negated_conjecture,[],[f37])).
% 0.14/0.40  thf(f37,conjecture,(
% 0.14/0.40    (mvalid @ (mimplies @ (mbox_s5 @ (mimplies @ p @ (mdia_s5 @ (mimplies @ q @ r)))) @ (mdia_s5 @ (mimplies @ q @ (mimplies @ (mbox_s5 @ p) @ (mdia_s5 @ r))))))),
% 0.14/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove)).
% 0.14/0.40  thf(f357,plain,(
% 0.14/0.40    ~spl0_1),
% 0.14/0.40    inference(avatar_contradiction_clause,[],[f356])).
% 0.14/0.40  thf(f356,plain,(
% 0.14/0.40    $false | ~spl0_1),
% 0.14/0.40    inference(trivial_inequality_removal,[],[f352])).
% 0.14/0.40  thf(f352,plain,(
% 0.14/0.40    ($false = $true) | ~spl0_1),
% 0.14/0.40    inference(superposition,[],[f222,f322])).
% 0.14/0.40  thf(f322,plain,(
% 0.14/0.40    ($false = (rel_s5 @ sK1 @ sK1)) | ~spl0_1),
% 0.14/0.40    inference(avatar_component_clause,[],[f320])).
% 0.14/0.40  thf(f320,plain,(
% 0.14/0.40    spl0_1 <=> ($false = (rel_s5 @ sK1 @ sK1))),
% 0.14/0.40    introduced(avatar_definition,[new_symbols(naming,[spl0_1])])).
% 0.14/0.40  thf(f348,plain,(
% 0.14/0.40    ~spl0_3),
% 0.14/0.40    inference(avatar_contradiction_clause,[],[f347])).
% 0.14/0.40  thf(f347,plain,(
% 0.14/0.40    $false | ~spl0_3),
% 0.14/0.40    inference(trivial_inequality_removal,[],[f343])).
% 0.14/0.40  thf(f343,plain,(
% 0.14/0.40    ($false = $true) | ~spl0_3),
% 0.14/0.40    inference(superposition,[],[f330,f240])).
% 0.14/0.40  thf(f240,plain,(
% 0.14/0.40    ((p @ sK1) = $true)),
% 0.14/0.40    inference(trivial_inequality_removal,[],[f237])).
% 0.14/0.40  thf(f237,plain,(
% 0.14/0.40    ($false = $true) | ((p @ sK1) = $true)),
% 0.14/0.40    inference(superposition,[],[f236,f222])).
% 0.14/0.40  thf(f236,plain,(
% 0.14/0.40    ( ! [X0 : $i] : (($false = (rel_s5 @ sK1 @ X0)) | ((p @ X0) = $true)) )),
% 0.14/0.40    inference(trivial_inequality_removal,[],[f231])).
% 0.14/0.40  thf(f231,plain,(
% 0.14/0.40    ( ! [X0 : $i] : (($false = $true) | ($false = (rel_s5 @ sK1 @ X0)) | ((p @ X0) = $true)) )),
% 0.14/0.40    inference(superposition,[],[f198,f222])).
% 0.14/0.40  thf(f198,plain,(
% 0.14/0.40    ( ! [X2 : $i,X1 : $i] : (($false = (rel_s5 @ X1 @ X2)) | ((p @ X2) = $true) | ((rel_s5 @ sK1 @ X1) = $false)) )),
% 0.14/0.40    inference(not_proxy_clausification,[],[f197])).
% 0.14/0.40  thf(f197,plain,(
% 0.14/0.40    ( ! [X2 : $i,X1 : $i] : (((~ (rel_s5 @ X1 @ X2)) = $true) | ((rel_s5 @ sK1 @ X1) = $false) | ((p @ X2) = $true)) )),
% 0.14/0.40    inference(binary_proxy_clausification,[],[f196])).
% 0.14/0.40  thf(f196,plain,(
% 0.14/0.40    ( ! [X2 : $i,X1 : $i] : ((((p @ X2) | (~ (rel_s5 @ X1 @ X2))) = $true) | ((rel_s5 @ sK1 @ X1) = $false)) )),
% 0.14/0.40    inference(beta_eta_normalization,[],[f195])).
% 0.14/0.40  thf(f195,plain,(
% 0.14/0.40    ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: ((p @ Y0) | (~ (rel_s5 @ X1 @ Y0)))) @ X2) = $true) | ((rel_s5 @ sK1 @ X1) = $false)) )),
% 0.14/0.40    inference(pi_clausification,[],[f194])).
% 0.14/0.40  thf(f194,plain,(
% 0.14/0.40    ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((p @ Y0) | (~ (rel_s5 @ X1 @ Y0))))) = $true) | ((rel_s5 @ sK1 @ X1) = $false)) )),
% 0.14/0.40    inference(not_proxy_clausification,[],[f193])).
% 0.14/0.40  thf(f193,plain,(
% 0.14/0.40    ( ! [X1 : $i] : (((~ (!! @ $i @ (^[Y0 : $i]: ((p @ Y0) | (~ (rel_s5 @ X1 @ Y0)))))) = $false) | ((rel_s5 @ sK1 @ X1) = $false)) )),
% 0.14/0.40    inference(binary_proxy_clausification,[],[f189])).
% 0.14/0.40  thf(f189,plain,(
% 0.14/0.40    ( ! [X1 : $i] : ((((~ (!! @ $i @ (^[Y0 : $i]: ((p @ Y0) | (~ (rel_s5 @ X1 @ Y0)))))) | (~ (!! @ $i @ (^[Y0 : $i]: ((~ (r @ Y0)) | (~ (rel_s5 @ X1 @ Y0))))))) = $false) | ((rel_s5 @ sK1 @ X1) = $false)) )),
% 0.14/0.40    inference(binary_proxy_clausification,[],[f188])).
% 0.14/0.40  thf(f188,plain,(
% 0.14/0.40    ( ! [X1 : $i] : (((rel_s5 @ sK1 @ X1) = $false) | (((~ (q @ X1)) | ((~ (!! @ $i @ (^[Y0 : $i]: ((p @ Y0) | (~ (rel_s5 @ X1 @ Y0)))))) | (~ (!! @ $i @ (^[Y0 : $i]: ((~ (r @ Y0)) | (~ (rel_s5 @ X1 @ Y0)))))))) = $false)) )),
% 0.14/0.40    inference(not_proxy_clausification,[],[f187])).
% 0.14/0.40  thf(f187,plain,(
% 0.14/0.40    ( ! [X1 : $i] : (($true = (~ (rel_s5 @ sK1 @ X1))) | (((~ (q @ X1)) | ((~ (!! @ $i @ (^[Y0 : $i]: ((p @ Y0) | (~ (rel_s5 @ X1 @ Y0)))))) | (~ (!! @ $i @ (^[Y0 : $i]: ((~ (r @ Y0)) | (~ (rel_s5 @ X1 @ Y0)))))))) = $false)) )),
% 0.14/0.40    inference(not_proxy_clausification,[],[f186])).
% 0.14/0.40  thf(f186,plain,(
% 0.14/0.40    ( ! [X1 : $i] : (((~ ((~ (q @ X1)) | ((~ (!! @ $i @ (^[Y0 : $i]: ((p @ Y0) | (~ (rel_s5 @ X1 @ Y0)))))) | (~ (!! @ $i @ (^[Y0 : $i]: ((~ (r @ Y0)) | (~ (rel_s5 @ X1 @ Y0))))))))) = $true) | ($true = (~ (rel_s5 @ sK1 @ X1)))) )),
% 0.14/0.40    inference(binary_proxy_clausification,[],[f185])).
% 0.14/0.40  thf(f185,plain,(
% 0.14/0.40    ( ! [X1 : $i] : ((((~ ((~ (q @ X1)) | ((~ (!! @ $i @ (^[Y0 : $i]: ((p @ Y0) | (~ (rel_s5 @ X1 @ Y0)))))) | (~ (!! @ $i @ (^[Y0 : $i]: ((~ (r @ Y0)) | (~ (rel_s5 @ X1 @ Y0))))))))) | (~ (rel_s5 @ sK1 @ X1))) = $true)) )),
% 0.14/0.40    inference(beta_eta_normalization,[],[f184])).
% 0.14/0.40  thf(f184,plain,(
% 0.14/0.40    ( ! [X1 : $i] : ((((^[Y0 : $i]: ((~ ((~ (q @ Y0)) | ((~ (!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_s5 @ Y0 @ Y1)))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((~ (r @ Y1)) | (~ (rel_s5 @ Y0 @ Y1))))))))) | (~ (rel_s5 @ sK1 @ Y0)))) @ X1) = $true)) )),
% 0.14/0.40    inference(pi_clausification,[],[f183])).
% 0.14/0.40  thf(f183,plain,(
% 0.14/0.40    ($true = (!! @ $i @ (^[Y0 : $i]: ((~ ((~ (q @ Y0)) | ((~ (!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_s5 @ Y0 @ Y1)))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((~ (r @ Y1)) | (~ (rel_s5 @ Y0 @ Y1))))))))) | (~ (rel_s5 @ sK1 @ Y0))))))),
% 0.14/0.40    inference(not_proxy_clausification,[],[f165])).
% 0.14/0.40  thf(f165,plain,(
% 0.14/0.40    ((~ (!! @ $i @ (^[Y0 : $i]: ((~ ((~ (q @ Y0)) | ((~ (!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_s5 @ Y0 @ Y1)))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((~ (r @ Y1)) | (~ (rel_s5 @ Y0 @ Y1))))))))) | (~ (rel_s5 @ sK1 @ Y0)))))) = $false)),
% 0.14/0.40    inference(binary_proxy_clausification,[],[f164])).
% 0.14/0.40  thf(f330,plain,(
% 0.14/0.40    ((p @ sK1) = $false) | ~spl0_3),
% 0.14/0.40    inference(avatar_component_clause,[],[f328])).
% 0.14/0.40  thf(f337,plain,(
% 0.14/0.40    spl0_3 | spl0_4 | spl0_1),
% 0.14/0.40    inference(avatar_split_clause,[],[f309,f320,f333,f328])).
% 0.14/0.40  thf(f309,plain,(
% 0.14/0.40    ($false = (rel_s5 @ sK1 @ sK1)) | ((p @ sK1) = $false) | ((q @ (sK2 @ sK1)) = $true)),
% 0.14/0.40    inference(trivial_inequality_removal,[],[f290])).
% 0.14/0.40  thf(f290,plain,(
% 0.14/0.40    ($false = (rel_s5 @ sK1 @ sK1)) | ((p @ sK1) = $false) | ($false = $true) | ((q @ (sK2 @ sK1)) = $true)),
% 0.14/0.40    inference(superposition,[],[f182,f191])).
% 0.14/0.40  thf(f191,plain,(
% 0.14/0.40    ( ! [X1 : $i] : (((rel_s5 @ sK1 @ X1) = $false) | ((q @ X1) = $true)) )),
% 0.14/0.40    inference(not_proxy_clausification,[],[f190])).
% 0.14/0.40  thf(f190,plain,(
% 0.14/0.40    ( ! [X1 : $i] : (((~ (q @ X1)) = $false) | ((rel_s5 @ sK1 @ X1) = $false)) )),
% 0.14/0.40    inference(binary_proxy_clausification,[],[f188])).
% 0.14/0.40  thf(f182,plain,(
% 0.14/0.40    ( ! [X1 : $i] : (((rel_s5 @ X1 @ (sK2 @ X1)) = $true) | ((rel_s5 @ sK1 @ X1) = $false) | ($false = (p @ X1))) )),
% 0.14/0.40    inference(not_proxy_clausification,[],[f177])).
% 0.14/0.40  thf(f177,plain,(
% 0.14/0.40    ( ! [X1 : $i] : (($false = (p @ X1)) | ((rel_s5 @ sK1 @ X1) = $false) | ((~ (rel_s5 @ X1 @ (sK2 @ X1))) = $false)) )),
% 0.14/0.40    inference(binary_proxy_clausification,[],[f176])).
% 0.14/0.40  thf(f331,plain,(
% 0.14/0.40    spl0_1 | spl0_2 | spl0_3),
% 0.14/0.40    inference(avatar_split_clause,[],[f318,f328,f324,f320])).
% 0.14/0.40  thf(f318,plain,(
% 0.14/0.40    ((p @ sK1) = $false) | ((r @ (sK2 @ sK1)) = $false) | ($false = (rel_s5 @ sK1 @ sK1))),
% 0.14/0.40    inference(trivial_inequality_removal,[],[f288])).
% 0.14/0.40  thf(f288,plain,(
% 0.14/0.40    ($false = (rel_s5 @ sK1 @ sK1)) | ((r @ (sK2 @ sK1)) = $false) | ($false = $true) | ((p @ sK1) = $false)),
% 0.14/0.40    inference(superposition,[],[f182,f246])).
% 0.14/0.40  thf(f246,plain,(
% 0.14/0.40    ( ! [X0 : $i] : (($false = (rel_s5 @ sK1 @ X0)) | ((r @ X0) = $false)) )),
% 0.14/0.40    inference(trivial_inequality_removal,[],[f241])).
% 0.14/0.40  thf(f241,plain,(
% 0.14/0.40    ( ! [X0 : $i] : (($false = $true) | ($false = (rel_s5 @ sK1 @ X0)) | ((r @ X0) = $false)) )),
% 0.14/0.40    inference(superposition,[],[f204,f222])).
% 0.14/0.40  thf(f204,plain,(
% 0.14/0.40    ( ! [X2 : $i,X1 : $i] : (($false = (rel_s5 @ X1 @ X2)) | ((r @ X2) = $false) | ((rel_s5 @ sK1 @ X1) = $false)) )),
% 0.14/0.40    inference(not_proxy_clausification,[],[f203])).
% 0.14/0.40  thf(f203,plain,(
% 0.14/0.40    ( ! [X2 : $i,X1 : $i] : (((r @ X2) = $false) | ((~ (rel_s5 @ X1 @ X2)) = $true) | ((rel_s5 @ sK1 @ X1) = $false)) )),
% 0.14/0.40    inference(not_proxy_clausification,[],[f202])).
% 0.14/0.40  thf(f202,plain,(
% 0.14/0.40    ( ! [X2 : $i,X1 : $i] : (((~ (r @ X2)) = $true) | ((rel_s5 @ sK1 @ X1) = $false) | ((~ (rel_s5 @ X1 @ X2)) = $true)) )),
% 0.14/0.40    inference(binary_proxy_clausification,[],[f201])).
% 0.14/0.40  thf(f201,plain,(
% 0.14/0.40    ( ! [X2 : $i,X1 : $i] : (((rel_s5 @ sK1 @ X1) = $false) | (((~ (r @ X2)) | (~ (rel_s5 @ X1 @ X2))) = $true)) )),
% 0.14/0.40    inference(beta_eta_normalization,[],[f200])).
% 0.14/0.40  thf(f200,plain,(
% 0.14/0.40    ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: ((~ (r @ Y0)) | (~ (rel_s5 @ X1 @ Y0)))) @ X2)) | ((rel_s5 @ sK1 @ X1) = $false)) )),
% 0.14/0.40    inference(pi_clausification,[],[f199])).
% 0.14/0.40  thf(f199,plain,(
% 0.14/0.40    ( ! [X1 : $i] : (((rel_s5 @ sK1 @ X1) = $false) | ((!! @ $i @ (^[Y0 : $i]: ((~ (r @ Y0)) | (~ (rel_s5 @ X1 @ Y0))))) = $true)) )),
% 0.14/0.40    inference(not_proxy_clausification,[],[f192])).
% 0.14/0.40  thf(f192,plain,(
% 0.14/0.40    ( ! [X1 : $i] : (((rel_s5 @ sK1 @ X1) = $false) | ((~ (!! @ $i @ (^[Y0 : $i]: ((~ (r @ Y0)) | (~ (rel_s5 @ X1 @ Y0)))))) = $false)) )),
% 0.14/0.40    inference(binary_proxy_clausification,[],[f189])).
% 0.14/0.40  % SZS output end Proof for theBenchmark
% 0.14/0.40  % (29288)------------------------------
% 0.14/0.40  % (29288)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40  % (29288)Termination reason: Refutation
% 0.14/0.40  
% 0.14/0.40  % (29288)Memory used [KB]: 5884
% 0.14/0.40  % (29288)Time elapsed: 0.030 s
% 0.14/0.40  % (29288)Instructions burned: 45 (million)
% 0.14/0.40  % (29288)------------------------------
% 0.14/0.40  % (29288)------------------------------
% 0.14/0.40  % (29287)Success in time 0.038 s
% 0.14/0.40  % Vampire---4.8 exiting
%------------------------------------------------------------------------------