TSTP Solution File: PUZ086^1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : PUZ086^1 : 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 : n028.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 02:28:30 EDT 2024

% Result   : Theorem 0.20s 0.42s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : PUZ086^1 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.13  % 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.34  % Computer : n028.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Sat May 18 10:37:38 EDT 2024
% 0.14/0.34  % CPUTime    : 
% 0.14/0.34  This is a TH0_THM_EQU_NAR problem
% 0.14/0.34  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.36  % (25115)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.36  % (25109)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.36  % (25115)Instruction limit reached!
% 0.14/0.36  % (25115)------------------------------
% 0.14/0.36  % (25115)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.36  % (25115)Termination reason: Unknown
% 0.14/0.36  % (25115)Termination phase: shuffling
% 0.14/0.36  
% 0.14/0.36  % (25115)Memory used [KB]: 1023
% 0.14/0.36  % (25115)Time elapsed: 0.004 s
% 0.14/0.37  % (25115)Instructions burned: 5 (million)
% 0.14/0.37  % (25115)------------------------------
% 0.14/0.37  % (25115)------------------------------
% 0.14/0.37  % (25109)Instruction limit reached!
% 0.14/0.37  % (25109)------------------------------
% 0.14/0.37  % (25109)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (25109)Termination reason: Unknown
% 0.14/0.37  % (25109)Termination phase: shuffling
% 0.14/0.37  
% 0.14/0.37  % (25109)Memory used [KB]: 1023
% 0.14/0.37  % (25109)Time elapsed: 0.004 s
% 0.14/0.37  % (25109)Instructions burned: 4 (million)
% 0.14/0.37  % (25109)------------------------------
% 0.14/0.37  % (25109)------------------------------
% 0.14/0.37  % (25112)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  % (25112)Instruction limit reached!
% 0.14/0.37  % (25112)------------------------------
% 0.14/0.37  % (25112)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (25112)Termination reason: Unknown
% 0.14/0.37  % (25112)Termination phase: shuffling
% 0.14/0.37  
% 0.14/0.37  % (25112)Memory used [KB]: 1023
% 0.14/0.37  % (25112)Time elapsed: 0.003 s
% 0.14/0.37  % (25112)Instructions burned: 3 (million)
% 0.14/0.37  % (25112)------------------------------
% 0.14/0.37  % (25112)------------------------------
% 0.14/0.37  % (25114)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  % (25111)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.37  % (25110)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.37  % (25108)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  % (25111)Instruction limit reached!
% 0.14/0.37  % (25111)------------------------------
% 0.14/0.37  % (25111)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (25111)Termination reason: Unknown
% 0.14/0.37  % (25111)Termination phase: shuffling
% 0.14/0.37  
% 0.14/0.37  % (25111)Memory used [KB]: 1023
% 0.14/0.37  % (25111)Time elapsed: 0.003 s
% 0.14/0.37  % (25111)Instructions burned: 3 (million)
% 0.14/0.37  % (25111)------------------------------
% 0.14/0.37  % (25111)------------------------------
% 0.14/0.37  % (25113)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.38  % (25114)Instruction limit reached!
% 0.14/0.38  % (25114)------------------------------
% 0.14/0.38  % (25114)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38  % (25114)Termination reason: Unknown
% 0.14/0.38  % (25114)Termination phase: Saturation
% 0.14/0.38  
% 0.14/0.38  % (25114)Memory used [KB]: 5628
% 0.14/0.38  % (25114)Time elapsed: 0.009 s
% 0.14/0.38  % (25114)Instructions burned: 18 (million)
% 0.14/0.38  % (25114)------------------------------
% 0.14/0.38  % (25114)------------------------------
% 0.14/0.38  % (25116)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.38  % (25113)Refutation not found, incomplete strategy
% 0.14/0.38  % (25113)------------------------------
% 0.14/0.38  % (25113)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38  % (25113)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38  
% 0.14/0.38  
% 0.14/0.38  % (25113)Memory used [KB]: 5628
% 0.14/0.38  % (25113)Time elapsed: 0.007 s
% 0.14/0.38  % (25113)Instructions burned: 9 (million)
% 0.14/0.38  % (25113)------------------------------
% 0.14/0.38  % (25113)------------------------------
% 0.14/0.38  % (25117)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.38  % (25118)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.38  % (25118)Instruction limit reached!
% 0.14/0.38  % (25118)------------------------------
% 0.14/0.38  % (25118)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38  % (25118)Termination reason: Unknown
% 0.14/0.38  % (25118)Termination phase: shuffling
% 0.14/0.38  
% 0.14/0.38  % (25118)Memory used [KB]: 1023
% 0.14/0.38  % (25118)Time elapsed: 0.003 s
% 0.14/0.38  % (25118)Instructions burned: 3 (million)
% 0.14/0.38  % (25118)------------------------------
% 0.14/0.38  % (25118)------------------------------
% 0.14/0.39  % (25110)Instruction limit reached!
% 0.14/0.39  % (25110)------------------------------
% 0.14/0.39  % (25110)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39  % (25110)Termination reason: Unknown
% 0.14/0.39  % (25110)Termination phase: Saturation
% 0.14/0.39  
% 0.14/0.39  % (25110)Memory used [KB]: 5756
% 0.14/0.39  % (25110)Time elapsed: 0.017 s
% 0.14/0.39  % (25110)Instructions burned: 28 (million)
% 0.14/0.39  % (25110)------------------------------
% 0.14/0.39  % (25110)------------------------------
% 0.14/0.39  % (25117)Instruction limit reached!
% 0.14/0.39  % (25117)------------------------------
% 0.14/0.39  % (25117)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39  % (25117)Termination reason: Unknown
% 0.14/0.39  % (25117)Termination phase: Saturation
% 0.14/0.39  
% 0.14/0.39  % (25117)Memory used [KB]: 1151
% 0.14/0.39  % (25117)Time elapsed: 0.010 s
% 0.14/0.39  % (25117)Instructions burned: 16 (million)
% 0.14/0.39  % (25117)------------------------------
% 0.14/0.39  % (25117)------------------------------
% 0.14/0.39  % (25119)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.39  % (25121)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.39  % (25120)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  % (25116)Instruction limit reached!
% 0.14/0.40  % (25116)------------------------------
% 0.14/0.40  % (25116)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40  % (25116)Termination reason: Unknown
% 0.14/0.40  % (25116)Termination phase: Saturation
% 0.14/0.40  
% 0.14/0.40  % (25116)Memory used [KB]: 5884
% 0.14/0.40  % (25116)Time elapsed: 0.019 s
% 0.14/0.40  % (25116)Instructions burned: 37 (million)
% 0.14/0.40  % (25116)------------------------------
% 0.14/0.40  % (25116)------------------------------
% 0.14/0.40  % (25122)lrs+21_1:1_au=on:cnfonf=off:fd=preordered:fe=off:fsr=off:hud=11:inj=on:kws=precedence:s2pl=no:sp=weighted_frequency:tgt=full:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.14/0.40  % (25120)Instruction limit reached!
% 0.14/0.40  % (25120)------------------------------
% 0.14/0.40  % (25120)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40  % (25120)Termination reason: Unknown
% 0.14/0.40  % (25120)Termination phase: SInE selection
% 0.14/0.40  
% 0.14/0.40  % (25120)Memory used [KB]: 1023
% 0.14/0.40  % (25120)Time elapsed: 0.005 s
% 0.14/0.40  % (25120)Instructions burned: 7 (million)
% 0.14/0.40  % (25120)------------------------------
% 0.14/0.40  % (25120)------------------------------
% 0.14/0.40  % (25122)Instruction limit reached!
% 0.14/0.40  % (25122)------------------------------
% 0.14/0.40  % (25122)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40  % (25122)Termination reason: Unknown
% 0.14/0.40  % (25122)Termination phase: shuffling
% 0.14/0.40  
% 0.14/0.40  % (25122)Memory used [KB]: 1023
% 0.14/0.40  % (25122)Time elapsed: 0.003 s
% 0.14/0.40  % (25122)Instructions burned: 3 (million)
% 0.14/0.40  % (25122)------------------------------
% 0.14/0.40  % (25122)------------------------------
% 0.14/0.40  % (25121)Instruction limit reached!
% 0.14/0.40  % (25121)------------------------------
% 0.14/0.40  % (25121)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40  % (25121)Termination reason: Unknown
% 0.14/0.40  % (25121)Termination phase: Saturation
% 0.14/0.40  
% 0.14/0.40  % (25121)Memory used [KB]: 5628
% 0.14/0.40  % (25121)Time elapsed: 0.009 s
% 0.14/0.40  % (25121)Instructions burned: 17 (million)
% 0.14/0.40  % (25121)------------------------------
% 0.14/0.40  % (25121)------------------------------
% 0.14/0.40  % (25123)lrs+2_1:1_apa=on:au=on:bd=preordered:cnfonf=off:cs=on:ixr=off:sos=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.14/0.40  % (25124)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.14/0.40  % (25123)Instruction limit reached!
% 0.14/0.40  % (25123)------------------------------
% 0.14/0.40  % (25123)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40  % (25123)Termination reason: Unknown
% 0.14/0.40  % (25123)Termination phase: shuffling
% 0.14/0.40  
% 0.14/0.40  % (25123)Memory used [KB]: 1023
% 0.14/0.40  % (25123)Time elapsed: 0.003 s
% 0.14/0.40  % (25123)Instructions burned: 3 (million)
% 0.14/0.40  % (25123)------------------------------
% 0.14/0.40  % (25123)------------------------------
% 0.14/0.41  % (25124)Instruction limit reached!
% 0.14/0.41  % (25124)------------------------------
% 0.14/0.41  % (25124)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.41  % (25124)Termination reason: Unknown
% 0.14/0.41  % (25124)Termination phase: Property scanning
% 0.14/0.41  
% 0.14/0.41  % (25124)Memory used [KB]: 1023
% 0.14/0.41  % (25124)Time elapsed: 0.006 s
% 0.14/0.41  % (25124)Instructions burned: 8 (million)
% 0.14/0.41  % (25124)------------------------------
% 0.14/0.41  % (25124)------------------------------
% 0.20/0.41  % (25125)dis+1002_1:1_add=large:cnfonf=lazy_pi_sigma_gen:fe=off:prag=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.41  % (25125)Instruction limit reached!
% 0.20/0.41  % (25125)------------------------------
% 0.20/0.41  % (25125)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.41  % (25125)Termination reason: Unknown
% 0.20/0.41  % (25125)Termination phase: shuffling
% 0.20/0.41  
% 0.20/0.41  % (25125)Memory used [KB]: 1023
% 0.20/0.41  % (25125)Time elapsed: 0.003 s
% 0.20/0.41  % (25125)Instructions burned: 3 (million)
% 0.20/0.41  % (25125)------------------------------
% 0.20/0.41  % (25125)------------------------------
% 0.20/0.41  % (25126)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.20/0.42  % (25108)First to succeed.
% 0.20/0.42  % (25126)Instruction limit reached!
% 0.20/0.42  % (25126)------------------------------
% 0.20/0.42  % (25126)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.42  % (25126)Termination reason: Unknown
% 0.20/0.42  % (25126)Termination phase: Property scanning
% 0.20/0.42  
% 0.20/0.42  % (25126)Memory used [KB]: 1023
% 0.20/0.42  % (25126)Time elapsed: 0.004 s
% 0.20/0.42  % (25126)Instructions burned: 6 (million)
% 0.20/0.42  % (25126)------------------------------
% 0.20/0.42  % (25126)------------------------------
% 0.20/0.42  % (25129)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.20/0.42  % (25128)lrs+10_1:1_e2e=on:sd=1:sgt=8:ss=axioms:i=710:si=on:rtra=on_0 on theBenchmark for (2999ds/710Mi)
% 0.20/0.42  % (25129)Instruction limit reached!
% 0.20/0.42  % (25129)------------------------------
% 0.20/0.42  % (25129)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.42  % (25129)Termination reason: Unknown
% 0.20/0.42  % (25129)Termination phase: Property scanning
% 0.20/0.42  
% 0.20/0.42  % (25129)Memory used [KB]: 1023
% 0.20/0.42  % (25129)Time elapsed: 0.005 s
% 0.20/0.42  % (25129)Instructions burned: 6 (million)
% 0.20/0.42  % (25129)------------------------------
% 0.20/0.42  % (25129)------------------------------
% 0.20/0.42  % (25127)lrs+1002_1:1_anc=all_dependent:au=on:cbe=off:fde=unused:ntd=on:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.20/0.42  % (25108)Refutation found. Thanks to Tanya!
% 0.20/0.42  % SZS status Theorem for theBenchmark
% 0.20/0.42  % SZS output start Proof for theBenchmark
% 0.20/0.42  thf(type_def_5, type, mu: $tType).
% 0.20/0.42  thf(func_def_0, type, mu: $tType).
% 0.20/0.42  thf(func_def_1, type, meq_ind: mu > mu > $i > $o).
% 0.20/0.42  thf(func_def_2, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.42  thf(func_def_4, type, mnot: ($i > $o) > $i > $o).
% 0.20/0.42  thf(func_def_5, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.42  thf(func_def_6, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.42  thf(func_def_7, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.42  thf(func_def_8, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.42  thf(func_def_9, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.42  thf(func_def_10, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.42  thf(func_def_11, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.20/0.42  thf(func_def_12, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.20/0.42  thf(func_def_13, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.20/0.42  thf(func_def_14, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.20/0.42  thf(func_def_15, type, mtrue: $i > $o).
% 0.20/0.42  thf(func_def_16, type, mfalse: $i > $o).
% 0.20/0.42  thf(func_def_17, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.20/0.42  thf(func_def_18, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.20/0.42  thf(func_def_19, type, mreflexive: ($i > $i > $o) > $o).
% 0.20/0.42  thf(func_def_20, type, msymmetric: ($i > $i > $o) > $o).
% 0.20/0.42  thf(func_def_21, type, mserial: ($i > $i > $o) > $o).
% 0.20/0.42  thf(func_def_22, type, mtransitive: ($i > $i > $o) > $o).
% 0.20/0.42  thf(func_def_23, type, meuclidean: ($i > $i > $o) > $o).
% 0.20/0.42  thf(func_def_24, type, mpartially_functional: ($i > $i > $o) > $o).
% 0.20/0.42  thf(func_def_25, type, mfunctional: ($i > $i > $o) > $o).
% 0.20/0.42  thf(func_def_26, type, mweakly_dense: ($i > $i > $o) > $o).
% 0.20/0.42  thf(func_def_27, type, mweakly_connected: ($i > $i > $o) > $o).
% 0.20/0.42  thf(func_def_28, type, mweakly_directed: ($i > $i > $o) > $o).
% 0.20/0.42  thf(func_def_29, type, mvalid: ($i > $o) > $o).
% 0.20/0.42  thf(func_def_30, type, minvalid: ($i > $o) > $o).
% 0.20/0.42  thf(func_def_31, type, msatisfiable: ($i > $o) > $o).
% 0.20/0.42  thf(func_def_32, type, mcountersatisfiable: ($i > $o) > $o).
% 0.20/0.42  thf(func_def_33, type, peter: $i > $i > $o).
% 0.20/0.42  thf(func_def_34, type, john: $i > $i > $o).
% 0.20/0.42  thf(func_def_35, type, wife: ($i > $i > $o) > $i > $i > $o).
% 0.20/0.42  thf(func_def_36, type, time: $i > $o).
% 0.20/0.42  thf(func_def_37, type, place: $i > $o).
% 0.20/0.42  thf(func_def_38, type, appointment: $i > $o).
% 0.20/0.42  thf(func_def_55, type, sK1: $i > ($i > $o) > $i).
% 0.20/0.42  thf(func_def_56, type, sK2: $i > ($i > $o) > $i).
% 0.20/0.42  thf(func_def_57, type, sK3: $i > $i).
% 0.20/0.42  thf(func_def_58, type, sK4: $i > ($i > $o) > $i).
% 0.20/0.42  thf(func_def_68, type, ph14: !>[X0: $tType]:(X0)).
% 0.20/0.42  thf(f1049,plain,(
% 0.20/0.42    $false),
% 0.20/0.42    inference(avatar_sat_refutation,[],[f397,f933,f934,f1006,f1024,f1038,f1048])).
% 0.20/0.42  thf(f1048,plain,(
% 0.20/0.42    ~spl0_34),
% 0.20/0.42    inference(avatar_contradiction_clause,[],[f1047])).
% 0.20/0.42  thf(f1047,plain,(
% 0.20/0.42    $false | ~spl0_34),
% 0.20/0.42    inference(trivial_inequality_removal,[],[f1044])).
% 0.20/0.42  thf(f1044,plain,(
% 0.20/0.42    ($false = $true) | ~spl0_34),
% 0.20/0.42    inference(superposition,[],[f453,f930])).
% 0.20/0.42  thf(f930,plain,(
% 0.20/0.42    ((time @ sK13) = $false) | ~spl0_34),
% 0.20/0.42    inference(avatar_component_clause,[],[f928])).
% 0.20/0.42  thf(f928,plain,(
% 0.20/0.42    spl0_34 <=> ((time @ sK13) = $false)),
% 0.20/0.42    introduced(avatar_definition,[new_symbols(naming,[spl0_34])])).
% 0.20/0.42  thf(f453,plain,(
% 0.20/0.42    ( ! [X0 : $i] : (((time @ X0) = $true)) )),
% 0.20/0.42    inference(trivial_inequality_removal,[],[f446])).
% 0.20/0.42  thf(f446,plain,(
% 0.20/0.42    ( ! [X0 : $i] : (($false = $true) | ((time @ X0) = $true)) )),
% 0.20/0.42    inference(superposition,[],[f219,f203])).
% 0.20/0.42  thf(f203,plain,(
% 0.20/0.42    ( ! [X1 : $i] : (((peter @ X1 @ X1) = $true)) )),
% 0.20/0.42    inference(beta_eta_normalization,[],[f202])).
% 0.20/0.42  thf(f202,plain,(
% 0.20/0.42    ( ! [X1 : $i] : ((((^[Y0 : $i]: (peter @ Y0 @ Y0)) @ X1) = $true)) )),
% 0.20/0.42    inference(pi_clausification,[],[f201])).
% 0.20/0.42  thf(f201,plain,(
% 0.20/0.42    ((!! @ $i @ (^[Y0 : $i]: (peter @ Y0 @ Y0))) = $true)),
% 0.20/0.42    inference(beta_eta_normalization,[],[f186])).
% 0.20/0.42  thf(f186,plain,(
% 0.20/0.42    (((^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))) @ peter) = $true)),
% 0.20/0.42    inference(definition_unfolding,[],[f136,f134])).
% 0.20/0.42  thf(f134,plain,(
% 0.20/0.42    (mreflexive = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))))),
% 0.20/0.42    inference(cnf_transformation,[],[f58])).
% 0.20/0.42  thf(f58,plain,(
% 0.20/0.42    (mreflexive = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))))),
% 0.20/0.42    inference(fool_elimination,[],[f57])).
% 0.20/0.42  thf(f57,plain,(
% 0.20/0.42    (mreflexive = (^[X0 : $i > $i > $o] : (! [X1] : (X0 @ X1 @ X1))))),
% 0.20/0.42    inference(rectify,[],[f18])).
% 0.20/0.42  thf(f18,axiom,(
% 0.20/0.42    (mreflexive = (^[X6 : $i > $i > $o] : (! [X8] : (X6 @ X8 @ X8))))),
% 0.20/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mreflexive)).
% 0.20/0.42  thf(f136,plain,(
% 0.20/0.42    ((mreflexive @ peter) = $true)),
% 0.20/0.42    inference(cnf_transformation,[],[f52])).
% 0.20/0.42  thf(f52,plain,(
% 0.20/0.42    ((mreflexive @ peter) = $true)),
% 0.20/0.42    inference(fool_elimination,[],[f51])).
% 0.20/0.42  thf(f51,plain,(
% 0.20/0.42    (mreflexive @ peter)),
% 0.20/0.42    inference(rectify,[],[f32])).
% 0.20/0.42  thf(f32,axiom,(
% 0.20/0.42    (mreflexive @ peter)),
% 0.20/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',refl_peter)).
% 0.20/0.42  thf(f219,plain,(
% 0.20/0.42    ( ! [X2 : $i,X1 : $i] : (((peter @ X1 @ X2) = $false) | ((time @ X2) = $true)) )),
% 0.20/0.42    inference(not_proxy_clausification,[],[f218])).
% 0.20/0.42  thf(f218,plain,(
% 0.20/0.42    ( ! [X2 : $i,X1 : $i] : (((~ (peter @ X1 @ X2)) = $true) | ((time @ X2) = $true)) )),
% 0.20/0.42    inference(binary_proxy_clausification,[],[f217])).
% 0.20/0.42  thf(f217,plain,(
% 0.20/0.42    ( ! [X2 : $i,X1 : $i] : ((((~ (peter @ X1 @ X2)) | (time @ X2)) = $true)) )),
% 0.20/0.42    inference(beta_eta_normalization,[],[f216])).
% 0.20/0.42  thf(f216,plain,(
% 0.20/0.42    ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: ((~ (peter @ X1 @ Y0)) | (time @ Y0))) @ X2) = $true)) )),
% 0.20/0.42    inference(pi_clausification,[],[f215])).
% 0.20/0.42  thf(f215,plain,(
% 0.20/0.42    ( ! [X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: ((~ (peter @ X1 @ Y0)) | (time @ Y0)))))) )),
% 0.20/0.42    inference(beta_eta_normalization,[],[f214])).
% 0.20/0.42  thf(f214,plain,(
% 0.20/0.42    ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((~ (peter @ Y0 @ Y1)) | (time @ Y1))))) @ X1) = $true)) )),
% 0.20/0.42    inference(pi_clausification,[],[f213])).
% 0.20/0.42  thf(f213,plain,(
% 0.20/0.42    ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((~ (peter @ Y0 @ Y1)) | (time @ Y1)))))) = $true)),
% 0.20/0.42    inference(beta_eta_normalization,[],[f189])).
% 0.20/0.42  thf(f189,plain,(
% 0.20/0.42    (((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (Y0 @ Y2 @ Y3)) | (Y1 @ Y3))))))))) @ peter @ time)) = $true)),
% 0.20/0.42    inference(definition_unfolding,[],[f151,f159,f153])).
% 0.20/0.42  thf(f153,plain,(
% 0.20/0.42    (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (Y0 @ Y2 @ Y3)) | (Y1 @ Y3))))))))))),
% 0.20/0.42    inference(cnf_transformation,[],[f66])).
% 0.20/0.42  thf(f66,plain,(
% 0.20/0.42    (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (Y0 @ Y2 @ Y3)) | (Y1 @ Y3))))))))))),
% 0.20/0.42    inference(fool_elimination,[],[f65])).
% 0.20/0.42  thf(f65,plain,(
% 0.20/0.42    ((^[X0 : $i > $i > $o, X1 : $i > $o, X2 : $i] : (! [X3] : ((X1 @ X3) | ~(X0 @ X2 @ X3)))) = mbox)),
% 0.20/0.42    inference(rectify,[],[f16])).
% 0.20/0.42  thf(f16,axiom,(
% 0.20/0.42    ((^[X6 : $i > $i > $o, X3 : $i > $o, X2 : $i] : (! [X7] : ((X3 @ X7) | ~(X6 @ X2 @ X7)))) = mbox)),
% 0.20/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox)).
% 0.20/0.42  thf(f159,plain,(
% 0.20/0.42    (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.20/0.42    inference(cnf_transformation,[],[f97])).
% 0.20/0.42  thf(f97,plain,(
% 0.20/0.42    (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.20/0.42    inference(fool_elimination,[],[f96])).
% 0.20/0.42  thf(f96,plain,(
% 0.20/0.42    (mvalid = (^[X0 : $i > $o] : (! [X1] : (X0 @ X1))))),
% 0.20/0.42    inference(rectify,[],[f28])).
% 0.20/0.42  thf(f28,axiom,(
% 0.20/0.42    (mvalid = (^[X3 : $i > $o] : (! [X2] : (X3 @ X2))))),
% 0.20/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mvalid)).
% 0.20/0.42  thf(f151,plain,(
% 0.20/0.42    ((mvalid @ (mbox @ peter @ time)) = $true)),
% 0.20/0.42    inference(cnf_transformation,[],[f60])).
% 0.20/0.42  thf(f60,plain,(
% 0.20/0.42    ((mvalid @ (mbox @ peter @ time)) = $true)),
% 0.20/0.42    inference(fool_elimination,[],[f59])).
% 0.20/0.42  thf(f59,plain,(
% 0.20/0.42    (mvalid @ (mbox @ peter @ time))),
% 0.20/0.42    inference(rectify,[],[f40])).
% 0.20/0.42  thf(f40,axiom,(
% 0.20/0.42    (mvalid @ (mbox @ peter @ time))),
% 0.20/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_a)).
% 0.20/0.42  thf(f1038,plain,(
% 0.20/0.42    ~spl0_33),
% 0.20/0.42    inference(avatar_contradiction_clause,[],[f1037])).
% 0.20/0.42  thf(f1037,plain,(
% 0.20/0.42    $false | ~spl0_33),
% 0.20/0.42    inference(trivial_inequality_removal,[],[f1033])).
% 0.20/0.42  thf(f1033,plain,(
% 0.20/0.42    ($false = $true) | ~spl0_33),
% 0.20/0.42    inference(superposition,[],[f926,f536])).
% 0.20/0.42  thf(f536,plain,(
% 0.20/0.42    ( ! [X0 : $i] : (((place @ X0) = $true)) )),
% 0.20/0.42    inference(trivial_inequality_removal,[],[f518])).
% 0.20/0.42  thf(f518,plain,(
% 0.20/0.42    ( ! [X0 : $i] : (($false = $true) | ((place @ X0) = $true)) )),
% 0.20/0.42    inference(superposition,[],[f469,f203])).
% 0.20/0.42  thf(f469,plain,(
% 0.20/0.42    ( ! [X0 : $i,X1 : $i] : (((peter @ X1 @ X0) = $false) | ((place @ X0) = $true)) )),
% 0.20/0.42    inference(trivial_inequality_removal,[],[f458])).
% 0.20/0.42  thf(f458,plain,(
% 0.20/0.42    ( ! [X0 : $i,X1 : $i] : (((peter @ X1 @ X0) = $false) | ($false = $true) | ((place @ X0) = $true)) )),
% 0.20/0.42    inference(superposition,[],[f379,f200])).
% 0.20/0.42  thf(f200,plain,(
% 0.20/0.42    ( ! [X1 : $i] : (((john @ X1 @ X1) = $true)) )),
% 0.20/0.42    inference(beta_eta_normalization,[],[f199])).
% 0.20/0.42  thf(f199,plain,(
% 0.20/0.42    ( ! [X1 : $i] : ((((^[Y0 : $i]: (john @ Y0 @ Y0)) @ X1) = $true)) )),
% 0.20/0.42    inference(pi_clausification,[],[f198])).
% 0.20/0.42  thf(f198,plain,(
% 0.20/0.42    ((!! @ $i @ (^[Y0 : $i]: (john @ Y0 @ Y0))) = $true)),
% 0.20/0.42    inference(beta_eta_normalization,[],[f191])).
% 0.20/0.42  thf(f191,plain,(
% 0.20/0.42    (((^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))) @ john) = $true)),
% 0.20/0.42    inference(definition_unfolding,[],[f157,f134])).
% 0.20/0.42  thf(f157,plain,(
% 0.20/0.42    ((mreflexive @ john) = $true)),
% 0.20/0.42    inference(cnf_transformation,[],[f79])).
% 0.20/0.42  thf(f79,plain,(
% 0.20/0.42    ((mreflexive @ john) = $true)),
% 0.20/0.42    inference(fool_elimination,[],[f78])).
% 0.20/0.42  thf(f78,plain,(
% 0.20/0.42    (mreflexive @ john)),
% 0.20/0.42    inference(rectify,[],[f33])).
% 0.20/0.42  thf(f33,axiom,(
% 0.20/0.42    (mreflexive @ john)),
% 0.20/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',refl_john)).
% 0.20/0.42  thf(f379,plain,(
% 0.20/0.42    ( ! [X2 : $i,X3 : $i,X1 : $i] : (((john @ X2 @ X3) = $false) | ($true = (place @ X3)) | ((peter @ X1 @ X2) = $false)) )),
% 0.20/0.42    inference(not_proxy_clausification,[],[f378])).
% 0.20/0.42  thf(f378,plain,(
% 0.20/0.42    ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = (place @ X3)) | ((peter @ X1 @ X2) = $false) | ((~ (john @ X2 @ X3)) = $true)) )),
% 0.20/0.42    inference(binary_proxy_clausification,[],[f377])).
% 0.20/0.42  thf(f377,plain,(
% 0.20/0.42    ( ! [X2 : $i,X3 : $i,X1 : $i] : (((peter @ X1 @ X2) = $false) | (((~ (john @ X2 @ X3)) | (place @ X3)) = $true)) )),
% 0.20/0.42    inference(beta_eta_normalization,[],[f376])).
% 0.20/0.42  thf(f376,plain,(
% 0.20/0.42    ( ! [X2 : $i,X3 : $i,X1 : $i] : (((peter @ X1 @ X2) = $false) | (((^[Y0 : $i]: ((~ (john @ X2 @ Y0)) | (place @ Y0))) @ X3) = $true)) )),
% 0.20/0.42    inference(pi_clausification,[],[f375])).
% 0.20/0.42  thf(f375,plain,(
% 0.20/0.42    ( ! [X2 : $i,X1 : $i] : (((peter @ X1 @ X2) = $false) | ((!! @ $i @ (^[Y0 : $i]: ((~ (john @ X2 @ Y0)) | (place @ Y0)))) = $true)) )),
% 0.20/0.42    inference(not_proxy_clausification,[],[f374])).
% 0.20/0.42  thf(f374,plain,(
% 0.20/0.42    ( ! [X2 : $i,X1 : $i] : (((~ (peter @ X1 @ X2)) = $true) | ((!! @ $i @ (^[Y0 : $i]: ((~ (john @ X2 @ Y0)) | (place @ Y0)))) = $true)) )),
% 0.20/0.42    inference(binary_proxy_clausification,[],[f373])).
% 0.20/0.42  thf(f373,plain,(
% 0.20/0.42    ( ! [X2 : $i,X1 : $i] : ((((~ (peter @ X1 @ X2)) | (!! @ $i @ (^[Y0 : $i]: ((~ (john @ X2 @ Y0)) | (place @ Y0))))) = $true)) )),
% 0.20/0.42    inference(beta_eta_normalization,[],[f372])).
% 0.20/0.42  thf(f372,plain,(
% 0.20/0.42    ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: ((~ (peter @ X1 @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((~ (john @ Y0 @ Y1)) | (place @ Y1)))))) @ X2) = $true)) )),
% 0.20/0.42    inference(pi_clausification,[],[f371])).
% 0.20/0.42  thf(f371,plain,(
% 0.20/0.42    ( ! [X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: ((~ (peter @ X1 @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((~ (john @ Y0 @ Y1)) | (place @ Y1))))))))) )),
% 0.20/0.42    inference(beta_eta_normalization,[],[f370])).
% 0.20/0.42  thf(f370,plain,(
% 0.20/0.42    ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((~ (peter @ Y0 @ Y1)) | (!! @ $i @ (^[Y2 : $i]: ((~ (john @ Y1 @ Y2)) | (place @ Y2)))))))) @ X1) = $true)) )),
% 0.20/0.42    inference(pi_clausification,[],[f369])).
% 0.20/0.42  thf(f369,plain,(
% 0.20/0.42    ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((~ (peter @ Y0 @ Y1)) | (!! @ $i @ (^[Y2 : $i]: ((~ (john @ Y1 @ Y2)) | (place @ Y2))))))))) = $true)),
% 0.20/0.42    inference(beta_eta_normalization,[],[f197])).
% 0.20/0.42  thf(f197,plain,(
% 0.20/0.42    (((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (Y0 @ Y2 @ Y3)) | (Y1 @ Y3))))))))) @ peter @ ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (Y0 @ Y2 @ Y3)) | (Y1 @ Y3))))))))) @ john @ place))) = $true)),
% 0.20/0.42    inference(definition_unfolding,[],[f172,f159,f153,f153])).
% 0.20/0.42  thf(f172,plain,(
% 0.20/0.42    ((mvalid @ (mbox @ peter @ (mbox @ john @ place))) = $true)),
% 0.20/0.42    inference(cnf_transformation,[],[f48])).
% 0.20/0.42  thf(f48,plain,(
% 0.20/0.42    ((mvalid @ (mbox @ peter @ (mbox @ john @ place))) = $true)),
% 0.20/0.42    inference(fool_elimination,[],[f47])).
% 0.20/0.42  thf(f47,plain,(
% 0.20/0.42    (mvalid @ (mbox @ peter @ (mbox @ john @ place)))),
% 0.20/0.42    inference(rectify,[],[f41])).
% 0.20/0.42  thf(f41,axiom,(
% 0.20/0.42    (mvalid @ (mbox @ peter @ (mbox @ john @ place)))),
% 0.20/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_b)).
% 0.20/0.42  thf(f926,plain,(
% 0.20/0.42    ($false = (place @ sK13)) | ~spl0_33),
% 0.20/0.42    inference(avatar_component_clause,[],[f924])).
% 0.20/0.42  thf(f924,plain,(
% 0.20/0.42    spl0_33 <=> ($false = (place @ sK13))),
% 0.20/0.42    introduced(avatar_definition,[new_symbols(naming,[spl0_33])])).
% 0.20/0.42  thf(f1024,plain,(
% 0.20/0.42    ~spl0_32),
% 0.20/0.42    inference(avatar_contradiction_clause,[],[f1023])).
% 0.20/0.42  thf(f1023,plain,(
% 0.20/0.42    $false | ~spl0_32),
% 0.20/0.42    inference(trivial_inequality_removal,[],[f1020])).
% 0.20/0.42  thf(f1020,plain,(
% 0.20/0.42    ($false = $true) | ~spl0_32),
% 0.20/0.42    inference(superposition,[],[f536,f920])).
% 0.20/0.42  thf(f920,plain,(
% 0.20/0.42    ((place @ sK9) = $false) | ~spl0_32),
% 0.20/0.42    inference(avatar_component_clause,[],[f918])).
% 0.20/0.42  thf(f918,plain,(
% 0.20/0.42    spl0_32 <=> ((place @ sK9) = $false)),
% 0.20/0.42    introduced(avatar_definition,[new_symbols(naming,[spl0_32])])).
% 0.20/0.42  thf(f1006,plain,(
% 0.20/0.42    ~spl0_31),
% 0.20/0.42    inference(avatar_contradiction_clause,[],[f1005])).
% 0.20/0.42  thf(f1005,plain,(
% 0.20/0.42    $false | ~spl0_31),
% 0.20/0.42    inference(trivial_inequality_removal,[],[f998])).
% 0.20/0.42  thf(f998,plain,(
% 0.20/0.42    ($false = $true) | ~spl0_31),
% 0.20/0.42    inference(superposition,[],[f453,f916])).
% 0.20/0.42  thf(f916,plain,(
% 0.20/0.42    ((time @ sK9) = $false) | ~spl0_31),
% 0.20/0.42    inference(avatar_component_clause,[],[f914])).
% 0.20/0.42  thf(f914,plain,(
% 0.20/0.42    spl0_31 <=> ((time @ sK9) = $false)),
% 0.20/0.42    introduced(avatar_definition,[new_symbols(naming,[spl0_31])])).
% 0.20/0.42  thf(f934,plain,(
% 0.20/0.42    spl0_33 | spl0_34 | ~spl0_2),
% 0.20/0.42    inference(avatar_split_clause,[],[f903,f394,f928,f924])).
% 0.20/0.42  thf(f394,plain,(
% 0.20/0.42    spl0_2 <=> ((appointment @ sK13) = $false)),
% 0.20/0.42    introduced(avatar_definition,[new_symbols(naming,[spl0_2])])).
% 0.20/0.42  thf(f903,plain,(
% 0.20/0.42    ($false = (place @ sK13)) | ((time @ sK13) = $false) | ~spl0_2),
% 0.20/0.42    inference(trivial_inequality_removal,[],[f897])).
% 0.20/0.42  thf(f897,plain,(
% 0.20/0.42    ($false = (place @ sK13)) | ((time @ sK13) = $false) | ($false = $true) | ~spl0_2),
% 0.20/0.42    inference(superposition,[],[f710,f396])).
% 0.20/0.42  thf(f396,plain,(
% 0.20/0.42    ((appointment @ sK13) = $false) | ~spl0_2),
% 0.20/0.42    inference(avatar_component_clause,[],[f394])).
% 0.20/0.42  thf(f710,plain,(
% 0.20/0.42    ( ! [X0 : $i] : (((appointment @ X0) = $true) | ((place @ X0) = $false) | ((time @ X0) = $false)) )),
% 0.20/0.42    inference(trivial_inequality_removal,[],[f701])).
% 0.20/0.42  thf(f701,plain,(
% 0.20/0.42    ( ! [X0 : $i] : (($false = $true) | ((time @ X0) = $false) | ((appointment @ X0) = $true) | ((place @ X0) = $false)) )),
% 0.20/0.42    inference(superposition,[],[f203,f560])).
% 0.20/0.42  thf(f560,plain,(
% 0.20/0.42    ( ! [X0 : $i,X1 : $i] : (((peter @ X1 @ X0) = $false) | ((time @ X0) = $false) | ((place @ X0) = $false) | ((appointment @ X0) = $true)) )),
% 0.20/0.42    inference(trivial_inequality_removal,[],[f551])).
% 0.20/0.42  thf(f551,plain,(
% 0.20/0.42    ( ! [X0 : $i,X1 : $i] : (((peter @ X1 @ X0) = $false) | ((appointment @ X0) = $true) | ($false = $true) | ((place @ X0) = $false) | ((time @ X0) = $false)) )),
% 0.20/0.42    inference(superposition,[],[f200,f235])).
% 0.20/0.42  thf(f235,plain,(
% 0.20/0.42    ( ! [X2 : $i,X3 : $i,X1 : $i] : (((john @ X2 @ X3) = $false) | ($false = (place @ X3)) | ((peter @ X1 @ X2) = $false) | ((time @ X3) = $false) | ((appointment @ X3) = $true)) )),
% 0.20/0.42    inference(not_proxy_clausification,[],[f234])).
% 0.20/0.42  thf(f234,plain,(
% 0.20/0.42    ( ! [X2 : $i,X3 : $i,X1 : $i] : (($false = (place @ X3)) | ((appointment @ X3) = $true) | ((john @ X2 @ X3) = $false) | ((peter @ X1 @ X2) = $false) | ((~ (time @ X3)) = $true)) )),
% 0.20/0.42    inference(not_proxy_clausification,[],[f233])).
% 0.20/0.42  thf(f233,plain,(
% 0.20/0.42    ( ! [X2 : $i,X3 : $i,X1 : $i] : (((peter @ X1 @ X2) = $false) | ((~ (place @ X3)) = $true) | ((john @ X2 @ X3) = $false) | ((appointment @ X3) = $true) | ((~ (time @ X3)) = $true)) )),
% 0.20/0.42    inference(binary_proxy_clausification,[],[f232])).
% 0.20/0.42  thf(f232,plain,(
% 0.20/0.42    ( ! [X2 : $i,X3 : $i,X1 : $i] : (((peter @ X1 @ X2) = $false) | ((john @ X2 @ X3) = $false) | ((appointment @ X3) = $true) | (((~ (place @ X3)) | (~ (time @ X3))) = $true)) )),
% 0.20/0.42    inference(not_proxy_clausification,[],[f231])).
% 0.20/0.42  thf(f231,plain,(
% 0.20/0.42    ( ! [X2 : $i,X3 : $i,X1 : $i] : (((appointment @ X3) = $true) | ((~ (john @ X2 @ X3)) = $true) | ((peter @ X1 @ X2) = $false) | (((~ (place @ X3)) | (~ (time @ X3))) = $true)) )),
% 0.20/0.42    inference(binary_proxy_clausification,[],[f230])).
% 0.20/0.42  thf(f230,plain,(
% 0.20/0.42    ( ! [X2 : $i,X3 : $i,X1 : $i] : (((((~ (place @ X3)) | (~ (time @ X3))) | (appointment @ X3)) = $true) | ((~ (john @ X2 @ X3)) = $true) | ((peter @ X1 @ X2) = $false)) )),
% 0.20/0.42    inference(binary_proxy_clausification,[],[f229])).
% 0.20/0.42  thf(f229,plain,(
% 0.20/0.42    ( ! [X2 : $i,X3 : $i,X1 : $i] : (((peter @ X1 @ X2) = $false) | (((~ (john @ X2 @ X3)) | (((~ (place @ X3)) | (~ (time @ X3))) | (appointment @ X3))) = $true)) )),
% 0.20/0.42    inference(beta_eta_normalization,[],[f228])).
% 0.20/0.42  thf(f228,plain,(
% 0.20/0.42    ( ! [X2 : $i,X3 : $i,X1 : $i] : (((peter @ X1 @ X2) = $false) | (((^[Y0 : $i]: ((~ (john @ X2 @ Y0)) | (((~ (place @ Y0)) | (~ (time @ Y0))) | (appointment @ Y0)))) @ X3) = $true)) )),
% 0.20/0.42    inference(pi_clausification,[],[f227])).
% 0.20/0.42  thf(f227,plain,(
% 0.20/0.42    ( ! [X2 : $i,X1 : $i] : (((peter @ X1 @ X2) = $false) | ((!! @ $i @ (^[Y0 : $i]: ((~ (john @ X2 @ Y0)) | (((~ (place @ Y0)) | (~ (time @ Y0))) | (appointment @ Y0))))) = $true)) )),
% 0.20/0.42    inference(not_proxy_clausification,[],[f226])).
% 0.20/0.42  thf(f226,plain,(
% 0.20/0.42    ( ! [X2 : $i,X1 : $i] : (((~ (peter @ X1 @ X2)) = $true) | ((!! @ $i @ (^[Y0 : $i]: ((~ (john @ X2 @ Y0)) | (((~ (place @ Y0)) | (~ (time @ Y0))) | (appointment @ Y0))))) = $true)) )),
% 0.20/0.42    inference(binary_proxy_clausification,[],[f225])).
% 0.20/0.42  thf(f225,plain,(
% 0.20/0.42    ( ! [X2 : $i,X1 : $i] : ((((~ (peter @ X1 @ X2)) | (!! @ $i @ (^[Y0 : $i]: ((~ (john @ X2 @ Y0)) | (((~ (place @ Y0)) | (~ (time @ Y0))) | (appointment @ Y0)))))) = $true)) )),
% 0.20/0.42    inference(beta_eta_normalization,[],[f224])).
% 0.20/0.42  thf(f224,plain,(
% 0.20/0.42    ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: ((~ (peter @ X1 @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((~ (john @ Y0 @ Y1)) | (((~ (place @ Y1)) | (~ (time @ Y1))) | (appointment @ Y1))))))) @ X2) = $true)) )),
% 0.20/0.42    inference(pi_clausification,[],[f223])).
% 0.20/0.42  thf(f223,plain,(
% 0.20/0.42    ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((~ (peter @ X1 @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((~ (john @ Y0 @ Y1)) | (((~ (place @ Y1)) | (~ (time @ Y1))) | (appointment @ Y1)))))))) = $true)) )),
% 0.20/0.42    inference(beta_eta_normalization,[],[f222])).
% 0.20/0.42  thf(f222,plain,(
% 0.20/0.42    ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((~ (peter @ Y0 @ Y1)) | (!! @ $i @ (^[Y2 : $i]: ((~ (john @ Y1 @ Y2)) | (((~ (place @ Y2)) | (~ (time @ Y2))) | (appointment @ Y2))))))))) @ X1) = $true)) )),
% 0.20/0.42    inference(pi_clausification,[],[f221])).
% 0.20/0.42  thf(f221,plain,(
% 0.20/0.42    ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((~ (peter @ Y0 @ Y1)) | (!! @ $i @ (^[Y2 : $i]: ((~ (john @ Y1 @ Y2)) | (((~ (place @ Y2)) | (~ (time @ Y2))) | (appointment @ Y2)))))))))) = $true)),
% 0.20/0.42    inference(boolean_simplification,[],[f220])).
% 0.20/0.42  thf(f220,plain,(
% 0.20/0.42    ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((~ (peter @ Y0 @ Y1)) | (!! @ $i @ (^[Y2 : $i]: ((~ (john @ Y1 @ Y2)) | ((~ (~ ((~ (place @ Y2)) | (~ (time @ Y2))))) | (appointment @ Y2)))))))))) = $true)),
% 0.20/0.42    inference(beta_eta_normalization,[],[f185])).
% 0.20/0.42  thf(f185,plain,(
% 0.20/0.42    (((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (Y0 @ Y2 @ Y3)) | (Y1 @ Y3))))))))) @ peter @ ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (Y0 @ Y2 @ Y3)) | (Y1 @ Y3))))))))) @ john @ ((^[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 > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y2 @ Y4) | (Y3 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y1)))))) @ place @ time) @ appointment)))) = $true)),
% 0.20/0.42    inference(definition_unfolding,[],[f135,f159,f153,f153,f177,f176])).
% 0.20/0.42  thf(f176,plain,(
% 0.20/0.42    (mand = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y2 @ Y4) | (Y3 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y1)))))))),
% 0.20/0.42    inference(definition_unfolding,[],[f137,f141,f145,f141,f141])).
% 0.20/0.42  thf(f145,plain,(
% 0.20/0.42    (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) | (Y1 @ Y2))))))))),
% 0.20/0.42    inference(cnf_transformation,[],[f50])).
% 0.20/0.42  thf(f50,plain,(
% 0.20/0.42    (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) | (Y1 @ Y2))))))))),
% 0.20/0.42    inference(fool_elimination,[],[f49])).
% 0.20/0.42  thf(f49,plain,(
% 0.20/0.42    (mor = (^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X1 @ X2) | (X0 @ X2))))),
% 0.20/0.42    inference(rectify,[],[f4])).
% 0.20/0.42  thf(f4,axiom,(
% 0.20/0.42    (mor = (^[X3 : $i > $o, X4 : $i > $o, X2 : $i] : ((X4 @ X2) | (X3 @ X2))))),
% 0.20/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mor)).
% 0.20/0.42  thf(f141,plain,(
% 0.20/0.42    (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.20/0.42    inference(cnf_transformation,[],[f111])).
% 0.20/0.42  thf(f111,plain,(
% 0.20/0.42    (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.20/0.42    inference(fool_elimination,[],[f110])).
% 0.20/0.42  thf(f110,plain,(
% 0.20/0.42    (mnot = (^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))))),
% 0.20/0.42    inference(rectify,[],[f3])).
% 0.20/0.42  thf(f3,axiom,(
% 0.20/0.42    (mnot = (^[X3 : $i > $o, X2 : $i] : (~(X3 @ X2))))),
% 0.20/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mnot)).
% 0.20/0.42  thf(f137,plain,(
% 0.20/0.42    (mand = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mnot @ (mor @ (mnot @ Y0) @ (mnot @ Y1)))))))),
% 0.20/0.42    inference(cnf_transformation,[],[f95])).
% 0.20/0.42  thf(f95,plain,(
% 0.20/0.42    (mand = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mnot @ (mor @ (mnot @ Y0) @ (mnot @ Y1)))))))),
% 0.20/0.42    inference(fool_elimination,[],[f94])).
% 0.20/0.42  thf(f94,plain,(
% 0.20/0.42    (mand = (^[X0 : $i > $o, X1 : $i > $o] : (mnot @ (mor @ (mnot @ X0) @ (mnot @ X1)))))),
% 0.20/0.42    inference(rectify,[],[f5])).
% 0.20/0.42  thf(f5,axiom,(
% 0.20/0.42    (mand = (^[X3 : $i > $o, X4 : $i > $o] : (mnot @ (mor @ (mnot @ X3) @ (mnot @ X4)))))),
% 0.20/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mand)).
% 0.20/0.42  thf(f177,plain,(
% 0.20/0.42    (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.20/0.42    inference(definition_unfolding,[],[f132,f145,f141])).
% 0.20/0.42  thf(f132,plain,(
% 0.20/0.42    (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.20/0.42    inference(cnf_transformation,[],[f87])).
% 0.20/0.42  thf(f87,plain,(
% 0.20/0.42    (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.20/0.42    inference(fool_elimination,[],[f86])).
% 0.20/0.42  thf(f86,plain,(
% 0.20/0.42    (mimplies = (^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)))),
% 0.20/0.42    inference(rectify,[],[f6])).
% 0.20/0.42  thf(f6,axiom,(
% 0.20/0.42    (mimplies = (^[X3 : $i > $o, X4 : $i > $o] : (mor @ (mnot @ X3) @ X4)))),
% 0.20/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mimplies)).
% 0.20/0.42  thf(f135,plain,(
% 0.20/0.42    ((mvalid @ (mbox @ peter @ (mbox @ john @ (mimplies @ (mand @ place @ time) @ appointment)))) = $true)),
% 0.20/0.42    inference(cnf_transformation,[],[f75])).
% 0.20/0.42  thf(f75,plain,(
% 0.20/0.42    ((mvalid @ (mbox @ peter @ (mbox @ john @ (mimplies @ (mand @ place @ time) @ appointment)))) = $true)),
% 0.20/0.42    inference(fool_elimination,[],[f74])).
% 0.20/0.42  thf(f74,plain,(
% 0.20/0.42    (mvalid @ (mbox @ peter @ (mbox @ john @ (mimplies @ (mand @ place @ time) @ appointment))))),
% 0.20/0.42    inference(rectify,[],[f43])).
% 0.20/0.42  thf(f43,axiom,(
% 0.20/0.42    (mvalid @ (mbox @ peter @ (mbox @ john @ (mimplies @ (mand @ place @ time) @ appointment))))),
% 0.20/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_d)).
% 0.20/0.42  thf(f933,plain,(
% 0.20/0.42    spl0_32 | spl0_31 | ~spl0_1),
% 0.20/0.42    inference(avatar_split_clause,[],[f904,f390,f914,f918])).
% 0.20/0.42  thf(f390,plain,(
% 0.20/0.42    spl0_1 <=> ((appointment @ sK9) = $false)),
% 0.20/0.42    introduced(avatar_definition,[new_symbols(naming,[spl0_1])])).
% 0.20/0.42  thf(f904,plain,(
% 0.20/0.42    ((time @ sK9) = $false) | ((place @ sK9) = $false) | ~spl0_1),
% 0.20/0.42    inference(trivial_inequality_removal,[],[f900])).
% 0.20/0.42  thf(f900,plain,(
% 0.20/0.42    ((time @ sK9) = $false) | ($false = $true) | ((place @ sK9) = $false) | ~spl0_1),
% 0.20/0.42    inference(superposition,[],[f392,f710])).
% 0.20/0.42  thf(f392,plain,(
% 0.20/0.42    ((appointment @ sK9) = $false) | ~spl0_1),
% 0.20/0.42    inference(avatar_component_clause,[],[f390])).
% 0.20/0.42  thf(f397,plain,(
% 0.20/0.42    spl0_1 | spl0_2),
% 0.20/0.42    inference(avatar_split_clause,[],[f354,f394,f390])).
% 0.20/0.42  thf(f354,plain,(
% 0.20/0.42    ((appointment @ sK9) = $false) | ((appointment @ sK13) = $false)),
% 0.20/0.42    inference(binary_proxy_clausification,[],[f353])).
% 0.20/0.42  thf(f353,plain,(
% 0.20/0.42    ((appointment @ sK9) = $false) | (((~ (john @ sK12 @ sK13)) | (appointment @ sK13)) = $false)),
% 0.20/0.42    inference(beta_eta_normalization,[],[f352])).
% 0.20/0.42  thf(f352,plain,(
% 0.20/0.42    ((appointment @ sK9) = $false) | (((^[Y0 : $i]: ((~ (john @ sK12 @ Y0)) | (appointment @ Y0))) @ sK13) = $false)),
% 0.20/0.42    inference(sigma_clausification,[],[f349])).
% 0.20/0.42  thf(f349,plain,(
% 0.20/0.42    ((!! @ $i @ (^[Y0 : $i]: ((~ (john @ sK12 @ Y0)) | (appointment @ Y0)))) = $false) | ((appointment @ sK9) = $false)),
% 0.20/0.42    inference(binary_proxy_clausification,[],[f348])).
% 0.20/0.42  thf(f348,plain,(
% 0.20/0.42    (((~ (peter @ sK5 @ sK12)) | (!! @ $i @ (^[Y0 : $i]: ((~ (john @ sK12 @ Y0)) | (appointment @ Y0))))) = $false) | ((appointment @ sK9) = $false)),
% 0.20/0.42    inference(beta_eta_normalization,[],[f347])).
% 0.20/0.42  thf(f347,plain,(
% 0.20/0.42    ($false = ((^[Y0 : $i]: ((~ (peter @ sK5 @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((~ (john @ Y0 @ Y1)) | (appointment @ Y1)))))) @ sK12)) | ((appointment @ sK9) = $false)),
% 0.20/0.42    inference(sigma_clausification,[],[f333])).
% 0.20/0.42  thf(f333,plain,(
% 0.20/0.42    ((appointment @ sK9) = $false) | ($false = (!! @ $i @ (^[Y0 : $i]: ((~ (peter @ sK5 @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((~ (john @ Y0 @ Y1)) | (appointment @ Y1))))))))),
% 0.20/0.42    inference(binary_proxy_clausification,[],[f332])).
% 0.20/0.42  thf(f332,plain,(
% 0.20/0.42    (((~ (peter @ sK6 @ sK9)) | (appointment @ sK9)) = $false) | ($false = (!! @ $i @ (^[Y0 : $i]: ((~ (peter @ sK5 @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((~ (john @ Y0 @ Y1)) | (appointment @ Y1))))))))),
% 0.20/0.42    inference(beta_eta_normalization,[],[f331])).
% 0.20/0.42  thf(f331,plain,(
% 0.20/0.42    (((^[Y0 : $i]: ((~ (peter @ sK6 @ Y0)) | (appointment @ Y0))) @ sK9) = $false) | ($false = (!! @ $i @ (^[Y0 : $i]: ((~ (peter @ sK5 @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((~ (john @ Y0 @ Y1)) | (appointment @ Y1))))))))),
% 0.20/0.42    inference(sigma_clausification,[],[f318])).
% 0.20/0.42  thf(f318,plain,(
% 0.20/0.42    ((!! @ $i @ (^[Y0 : $i]: ((~ (peter @ sK6 @ Y0)) | (appointment @ Y0)))) = $false) | ($false = (!! @ $i @ (^[Y0 : $i]: ((~ (peter @ sK5 @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((~ (john @ Y0 @ Y1)) | (appointment @ Y1))))))))),
% 0.20/0.42    inference(binary_proxy_clausification,[],[f317])).
% 0.20/0.42  thf(f317,plain,(
% 0.20/0.42    (((~ (john @ sK5 @ sK6)) | (!! @ $i @ (^[Y0 : $i]: ((~ (peter @ sK6 @ Y0)) | (appointment @ Y0))))) = $false) | ($false = (!! @ $i @ (^[Y0 : $i]: ((~ (peter @ sK5 @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((~ (john @ Y0 @ Y1)) | (appointment @ Y1))))))))),
% 0.20/0.42    inference(beta_eta_normalization,[],[f316])).
% 0.20/0.42  thf(f316,plain,(
% 0.20/0.42    (((^[Y0 : $i]: ((~ (john @ sK5 @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((~ (peter @ Y0 @ Y1)) | (appointment @ Y1)))))) @ sK6) = $false) | ($false = (!! @ $i @ (^[Y0 : $i]: ((~ (peter @ sK5 @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((~ (john @ Y0 @ Y1)) | (appointment @ Y1))))))))),
% 0.20/0.42    inference(sigma_clausification,[],[f315])).
% 0.20/0.42  thf(f315,plain,(
% 0.20/0.42    ($false = (!! @ $i @ (^[Y0 : $i]: ((~ (john @ sK5 @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((~ (peter @ Y0 @ Y1)) | (appointment @ Y1)))))))) | ($false = (!! @ $i @ (^[Y0 : $i]: ((~ (peter @ sK5 @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((~ (john @ Y0 @ Y1)) | (appointment @ Y1))))))))),
% 0.20/0.42    inference(not_proxy_clausification,[],[f314])).
% 0.20/0.42  thf(f314,plain,(
% 0.20/0.42    ((~ (!! @ $i @ (^[Y0 : $i]: ((~ (john @ sK5 @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((~ (peter @ Y0 @ Y1)) | (appointment @ Y1)))))))) = $true) | ($false = (!! @ $i @ (^[Y0 : $i]: ((~ (peter @ sK5 @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((~ (john @ Y0 @ Y1)) | (appointment @ Y1))))))))),
% 0.20/0.42    inference(not_proxy_clausification,[],[f313])).
% 0.20/0.42  thf(f313,plain,(
% 0.20/0.42    ((~ (!! @ $i @ (^[Y0 : $i]: ((~ (peter @ sK5 @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((~ (john @ Y0 @ Y1)) | (appointment @ Y1)))))))) = $true) | ((~ (!! @ $i @ (^[Y0 : $i]: ((~ (john @ sK5 @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((~ (peter @ Y0 @ Y1)) | (appointment @ Y1)))))))) = $true)),
% 0.20/0.42    inference(binary_proxy_clausification,[],[f312])).
% 0.20/0.42  thf(f312,plain,(
% 0.20/0.42    ($true = ((~ (!! @ $i @ (^[Y0 : $i]: ((~ (peter @ sK5 @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((~ (john @ Y0 @ Y1)) | (appointment @ Y1)))))))) | (~ (!! @ $i @ (^[Y0 : $i]: ((~ (john @ sK5 @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((~ (peter @ Y0 @ Y1)) | (appointment @ Y1))))))))))),
% 0.20/0.42    inference(not_proxy_clausification,[],[f311])).
% 0.20/0.42  thf(f311,plain,(
% 0.20/0.42    ((~ ((~ (!! @ $i @ (^[Y0 : $i]: ((~ (peter @ sK5 @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((~ (john @ Y0 @ Y1)) | (appointment @ Y1)))))))) | (~ (!! @ $i @ (^[Y0 : $i]: ((~ (john @ sK5 @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((~ (peter @ Y0 @ Y1)) | (appointment @ Y1)))))))))) = $false)),
% 0.20/0.42    inference(beta_eta_normalization,[],[f310])).
% 0.20/0.42  thf(f310,plain,(
% 0.20/0.42    ($false = ((^[Y0 : $i]: (~ ((~ (!! @ $i @ (^[Y1 : $i]: ((~ (peter @ Y0 @ Y1)) | (!! @ $i @ (^[Y2 : $i]: ((~ (john @ Y1 @ Y2)) | (appointment @ Y2)))))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((~ (john @ Y0 @ Y1)) | (!! @ $i @ (^[Y2 : $i]: ((~ (peter @ Y1 @ Y2)) | (appointment @ Y2))))))))))) @ sK5))),
% 0.20/0.42    inference(sigma_clausification,[],[f309])).
% 0.20/0.42  thf(f309,plain,(
% 0.20/0.42    ((!! @ $i @ (^[Y0 : $i]: (~ ((~ (!! @ $i @ (^[Y1 : $i]: ((~ (peter @ Y0 @ Y1)) | (!! @ $i @ (^[Y2 : $i]: ((~ (john @ Y1 @ Y2)) | (appointment @ Y2)))))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((~ (john @ Y0 @ Y1)) | (!! @ $i @ (^[Y2 : $i]: ((~ (peter @ Y1 @ Y2)) | (appointment @ Y2)))))))))))) != $true)),
% 0.20/0.42    inference(beta_eta_normalization,[],[f194])).
% 0.20/0.42  thf(f194,plain,(
% 0.20/0.42    (((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y2 @ Y4) | (Y3 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y1)))))) @ ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (Y0 @ Y2 @ Y3)) | (Y1 @ Y3))))))))) @ peter @ ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (Y0 @ Y2 @ Y3)) | (Y1 @ Y3))))))))) @ john @ appointment)) @ ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (Y0 @ Y2 @ Y3)) | (Y1 @ Y3))))))))) @ john @ ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (Y0 @ Y2 @ Y3)) | (Y1 @ Y3))))))))) @ peter @ appointment)))) != $true)),
% 0.20/0.42    inference(definition_unfolding,[],[f168,f159,f176,f153,f153,f153,f153])).
% 0.20/0.42  thf(f168,plain,(
% 0.20/0.42    ((mvalid @ (mand @ (mbox @ peter @ (mbox @ john @ appointment)) @ (mbox @ john @ (mbox @ peter @ appointment)))) != $true)),
% 0.20/0.42    inference(cnf_transformation,[],[f131])).
% 0.20/0.42  thf(f131,plain,(
% 0.20/0.42    ((mvalid @ (mand @ (mbox @ peter @ (mbox @ john @ appointment)) @ (mbox @ john @ (mbox @ peter @ appointment)))) != $true)),
% 0.20/0.42    inference(flattening,[],[f69])).
% 0.20/0.42  thf(f69,plain,(
% 0.20/0.42    ~((mvalid @ (mand @ (mbox @ peter @ (mbox @ john @ appointment)) @ (mbox @ john @ (mbox @ peter @ appointment)))) = $true)),
% 0.20/0.42    inference(fool_elimination,[],[f68])).
% 0.20/0.42  thf(f68,plain,(
% 0.20/0.42    ~(mvalid @ (mand @ (mbox @ peter @ (mbox @ john @ appointment)) @ (mbox @ john @ (mbox @ peter @ appointment))))),
% 0.20/0.42    inference(rectify,[],[f45])).
% 0.20/0.42  thf(f45,negated_conjecture,(
% 0.20/0.42    ~(mvalid @ (mand @ (mbox @ peter @ (mbox @ john @ appointment)) @ (mbox @ john @ (mbox @ peter @ appointment))))),
% 0.20/0.42    inference(negated_conjecture,[],[f44])).
% 0.20/0.42  thf(f44,conjecture,(
% 0.20/0.42    (mvalid @ (mand @ (mbox @ peter @ (mbox @ john @ appointment)) @ (mbox @ john @ (mbox @ peter @ appointment))))),
% 0.20/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)).
% 0.20/0.42  % SZS output end Proof for theBenchmark
% 0.20/0.42  % (25108)------------------------------
% 0.20/0.42  % (25108)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.42  % (25108)Termination reason: Refutation
% 0.20/0.42  
% 0.20/0.42  % (25108)Memory used [KB]: 6396
% 0.20/0.42  % (25108)Time elapsed: 0.048 s
% 0.20/0.42  % (25108)Instructions burned: 85 (million)
% 0.20/0.42  % (25108)------------------------------
% 0.20/0.42  % (25108)------------------------------
% 0.20/0.42  % (25107)Success in time 0.061 s
% 0.20/0.42  % Vampire---4.8 exiting
%------------------------------------------------------------------------------