TSTP Solution File: LCL718^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL718^1 : TPTP v8.2.0. Bugfixed v5.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/sandbox/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 00:22:21 EDT 2024
% Result : Theorem 0.22s 0.49s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL718^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% 0.08/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.37 % Computer : n028.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon May 20 02:23:53 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a TH0_THM_EQU_NAR problem
% 0.15/0.37 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/sandbox/benchmark/theBenchmark.p
% 0.15/0.39 % (2511)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.39 % (2512)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.15/0.39 % (2510)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.15/0.39 % (2512)Instruction limit reached!
% 0.15/0.39 % (2512)------------------------------
% 0.15/0.39 % (2512)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (2512)Termination reason: Unknown
% 0.15/0.39 % (2512)Termination phase: shuffling
% 0.15/0.39
% 0.15/0.39 % (2512)Memory used [KB]: 1023
% 0.15/0.39 % (2512)Time elapsed: 0.003 s
% 0.15/0.39 % (2512)Instructions burned: 4 (million)
% 0.15/0.39 % (2512)------------------------------
% 0.15/0.39 % (2512)------------------------------
% 0.15/0.39 % (2505)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.15/0.39 % (2507)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.15/0.39 % (2506)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.15/0.39 % (2508)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.39 % (2509)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.15/0.39 % (2508)Instruction limit reached!
% 0.15/0.39 % (2508)------------------------------
% 0.15/0.39 % (2508)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (2508)Termination reason: Unknown
% 0.15/0.39 % (2508)Termination phase: shuffling
% 0.15/0.39
% 0.15/0.39 % (2508)Memory used [KB]: 1023
% 0.15/0.39 % (2508)Time elapsed: 0.003 s
% 0.15/0.39 % (2508)Instructions burned: 2 (million)
% 0.15/0.39 % (2508)------------------------------
% 0.15/0.39 % (2508)------------------------------
% 0.15/0.39 % (2509)Instruction limit reached!
% 0.15/0.39 % (2509)------------------------------
% 0.15/0.39 % (2509)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (2509)Termination reason: Unknown
% 0.15/0.39 % (2509)Termination phase: shuffling
% 0.15/0.39
% 0.15/0.39 % (2509)Memory used [KB]: 1023
% 0.15/0.39 % (2509)Time elapsed: 0.003 s
% 0.15/0.39 % (2509)Instructions burned: 2 (million)
% 0.15/0.39 % (2509)------------------------------
% 0.15/0.39 % (2509)------------------------------
% 0.15/0.39 % (2506)Instruction limit reached!
% 0.15/0.39 % (2506)------------------------------
% 0.15/0.39 % (2506)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (2506)Termination reason: Unknown
% 0.15/0.39 % (2506)Termination phase: shuffling
% 0.15/0.39
% 0.15/0.39 % (2506)Memory used [KB]: 1023
% 0.15/0.39 % (2506)Time elapsed: 0.004 s
% 0.15/0.39 % (2506)Instructions burned: 4 (million)
% 0.15/0.39 % (2506)------------------------------
% 0.15/0.39 % (2506)------------------------------
% 0.15/0.40 % (2511)Instruction limit reached!
% 0.15/0.40 % (2511)------------------------------
% 0.15/0.40 % (2511)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (2511)Termination reason: Unknown
% 0.15/0.40 % (2511)Termination phase: Saturation
% 0.15/0.40
% 0.15/0.40 % (2511)Memory used [KB]: 5756
% 0.15/0.40 % (2511)Time elapsed: 0.010 s
% 0.15/0.40 % (2511)Instructions burned: 18 (million)
% 0.15/0.40 % (2511)------------------------------
% 0.15/0.40 % (2511)------------------------------
% 0.15/0.40 % (2510)Refutation not found, incomplete strategy
% 0.15/0.40 % (2510)------------------------------
% 0.15/0.40 % (2510)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (2510)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.40
% 0.15/0.40
% 0.15/0.40 % (2510)Memory used [KB]: 5756
% 0.15/0.40 % (2510)Time elapsed: 0.010 s
% 0.15/0.40 % (2510)Instructions burned: 18 (million)
% 0.15/0.40 % (2510)------------------------------
% 0.15/0.40 % (2510)------------------------------
% 0.15/0.40 % (2515)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.15/0.41 % (2515)Instruction limit reached!
% 0.15/0.41 % (2515)------------------------------
% 0.15/0.41 % (2515)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.41 % (2515)Termination reason: Unknown
% 0.15/0.41 % (2515)Termination phase: Property scanning
% 0.15/0.41
% 0.15/0.41 % (2515)Memory used [KB]: 1023
% 0.15/0.41 % (2515)Time elapsed: 0.003 s
% 0.15/0.41 % (2515)Instructions burned: 4 (million)
% 0.15/0.41 % (2515)------------------------------
% 0.15/0.41 % (2515)------------------------------
% 0.15/0.41 % (2514)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.15/0.41 % (2507)Instruction limit reached!
% 0.15/0.41 % (2507)------------------------------
% 0.15/0.41 % (2507)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.41 % (2507)Termination reason: Unknown
% 0.15/0.41 % (2507)Termination phase: Saturation
% 0.15/0.41
% 0.15/0.41 % (2507)Memory used [KB]: 5756
% 0.15/0.41 % (2507)Time elapsed: 0.018 s
% 0.15/0.41 % (2507)Instructions burned: 27 (million)
% 0.15/0.41 % (2507)------------------------------
% 0.15/0.41 % (2507)------------------------------
% 0.15/0.41 % (2516)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.22/0.41 % (2513)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.22/0.41 % (2517)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.22/0.41 % (2514)Instruction limit reached!
% 0.22/0.41 % (2514)------------------------------
% 0.22/0.41 % (2514)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.41 % (2514)Termination reason: Unknown
% 0.22/0.41 % (2514)Termination phase: Saturation
% 0.22/0.41
% 0.22/0.41 % (2514)Memory used [KB]: 5628
% 0.22/0.41 % (2514)Time elapsed: 0.010 s
% 0.22/0.41 % (2514)Instructions burned: 15 (million)
% 0.22/0.41 % (2514)------------------------------
% 0.22/0.41 % (2514)------------------------------
% 0.22/0.42 % (2517)Instruction limit reached!
% 0.22/0.42 % (2517)------------------------------
% 0.22/0.42 % (2517)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.42 % (2517)Termination reason: Unknown
% 0.22/0.42 % (2517)Termination phase: Function definition elimination
% 0.22/0.42
% 0.22/0.42 % (2517)Memory used [KB]: 1023
% 0.22/0.42 % (2517)Time elapsed: 0.005 s
% 0.22/0.42 % (2517)Instructions burned: 8 (million)
% 0.22/0.42 % (2517)------------------------------
% 0.22/0.42 % (2517)------------------------------
% 0.22/0.42 % (2519)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.22/0.42 % (2520)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.22/0.42 % (2519)Instruction limit reached!
% 0.22/0.42 % (2519)------------------------------
% 0.22/0.42 % (2519)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.42 % (2519)Termination reason: Unknown
% 0.22/0.42 % (2519)Termination phase: Property scanning
% 0.22/0.42
% 0.22/0.42 % (2519)Memory used [KB]: 1023
% 0.22/0.42 % (2519)Time elapsed: 0.003 s
% 0.22/0.42 % (2519)Instructions burned: 4 (million)
% 0.22/0.42 % (2519)------------------------------
% 0.22/0.42 % (2519)------------------------------
% 0.22/0.42 % (2520)Instruction limit reached!
% 0.22/0.42 % (2520)------------------------------
% 0.22/0.42 % (2520)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.42 % (2520)Termination reason: Unknown
% 0.22/0.42 % (2520)Termination phase: Property scanning
% 0.22/0.42
% 0.22/0.42 % (2520)Memory used [KB]: 1023
% 0.22/0.42 % (2520)Time elapsed: 0.004 s
% 0.22/0.42 % (2520)Instructions burned: 4 (million)
% 0.22/0.42 % (2520)------------------------------
% 0.22/0.42 % (2520)------------------------------
% 0.22/0.43 % (2518)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.22/0.43 % (2521)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.22/0.44 % (2523)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.22/0.44 % (2521)Instruction limit reached!
% 0.22/0.44 % (2521)------------------------------
% 0.22/0.44 % (2521)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.44 % (2521)Termination reason: Unknown
% 0.22/0.44 % (2521)Termination phase: Property scanning
% 0.22/0.44
% 0.22/0.44 % (2521)Memory used [KB]: 1023
% 0.22/0.44 % (2521)Time elapsed: 0.005 s
% 0.22/0.44 % (2521)Instructions burned: 9 (million)
% 0.22/0.44 % (2521)------------------------------
% 0.22/0.44 % (2521)------------------------------
% 0.22/0.44 % (2513)Instruction limit reached!
% 0.22/0.44 % (2513)------------------------------
% 0.22/0.44 % (2513)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.44 % (2513)Termination reason: Unknown
% 0.22/0.44 % (2513)Termination phase: Saturation
% 0.22/0.44
% 0.22/0.44 % (2513)Memory used [KB]: 5884
% 0.22/0.44 % (2513)Time elapsed: 0.029 s
% 0.22/0.44 % (2513)Instructions burned: 37 (million)
% 0.22/0.44 % (2513)------------------------------
% 0.22/0.44 % (2513)------------------------------
% 0.22/0.44 % (2523)Instruction limit reached!
% 0.22/0.44 % (2523)------------------------------
% 0.22/0.44 % (2523)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.44 % (2523)Termination reason: Unknown
% 0.22/0.44 % (2523)Termination phase: Preprocessing 3
% 0.22/0.44
% 0.22/0.44 % (2523)Memory used [KB]: 1023
% 0.22/0.44 % (2523)Time elapsed: 0.003 s
% 0.22/0.44 % (2523)Instructions burned: 6 (million)
% 0.22/0.44 % (2523)------------------------------
% 0.22/0.44 % (2523)------------------------------
% 0.22/0.44 % (2524)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.22/0.44 % (2518)Instruction limit reached!
% 0.22/0.44 % (2518)------------------------------
% 0.22/0.44 % (2518)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.44 % (2518)Termination reason: Unknown
% 0.22/0.44 % (2518)Termination phase: Saturation
% 0.22/0.44
% 0.22/0.44 % (2518)Memory used [KB]: 5884
% 0.22/0.44 % (2518)Time elapsed: 0.041 s
% 0.22/0.44 % (2518)Instructions burned: 16 (million)
% 0.22/0.44 % (2518)------------------------------
% 0.22/0.44 % (2518)------------------------------
% 0.22/0.44 % (2526)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.22/0.45 % (2522)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.22/0.45 % (2526)Instruction limit reached!
% 0.22/0.45 % (2526)------------------------------
% 0.22/0.45 % (2526)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.45 % (2526)Termination reason: Unknown
% 0.22/0.45 % (2526)Termination phase: Property scanning
% 0.22/0.45
% 0.22/0.45 % (2526)Memory used [KB]: 1023
% 0.22/0.45 % (2526)Time elapsed: 0.003 s
% 0.22/0.45 % (2526)Instructions burned: 7 (million)
% 0.22/0.45 % (2526)------------------------------
% 0.22/0.45 % (2526)------------------------------
% 0.22/0.45 % (2522)Instruction limit reached!
% 0.22/0.45 % (2522)------------------------------
% 0.22/0.45 % (2522)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.45 % (2522)Termination reason: Unknown
% 0.22/0.45 % (2522)Termination phase: Property scanning
% 0.22/0.45
% 0.22/0.45 % (2522)Memory used [KB]: 1023
% 0.22/0.45 % (2522)Time elapsed: 0.004 s
% 0.22/0.45 % (2522)Instructions burned: 4 (million)
% 0.22/0.45 % (2522)------------------------------
% 0.22/0.45 % (2522)------------------------------
% 0.22/0.45 % (2524)Instruction limit reached!
% 0.22/0.45 % (2524)------------------------------
% 0.22/0.45 % (2524)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.45 % (2524)Termination reason: Unknown
% 0.22/0.45 % (2524)Termination phase: Saturation
% 0.22/0.45
% 0.22/0.45 % (2524)Memory used [KB]: 5628
% 0.22/0.45 % (2524)Time elapsed: 0.013 s
% 0.22/0.45 % (2524)Instructions burned: 18 (million)
% 0.22/0.45 % (2524)------------------------------
% 0.22/0.45 % (2524)------------------------------
% 0.22/0.45 % (2528)dis+21_1:8_apa=on:cnfonf=off:fd=off:fsr=off:hud=0:ins=1:kws=inv_frequency:nwc=10.0:ss=axioms:st=5.0:i=21:si=on:rtra=on_0 on theBenchmark for (2999ds/21Mi)
% 0.22/0.45 % (2527)dis+1002_5:1_au=on:bd=off:e2e=on:fde=none:fs=off:fsr=off:sos=on:i=902:si=on:rtra=on_0 on theBenchmark for (2999ds/902Mi)
% 0.22/0.45 % (2529)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on theBenchmark for (2999ds/5Mi)
% 0.22/0.45 % (2527)Refutation not found, incomplete strategy
% 0.22/0.45 % (2527)------------------------------
% 0.22/0.45 % (2527)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.45 % (2527)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.45
% 0.22/0.45
% 0.22/0.45 % (2527)Memory used [KB]: 5628
% 0.22/0.45 % (2527)Time elapsed: 0.006 s
% 0.22/0.45 % (2527)Instructions burned: 9 (million)
% 0.22/0.45 % (2527)------------------------------
% 0.22/0.45 % (2527)------------------------------
% 0.22/0.46 % (2529)Instruction limit reached!
% 0.22/0.46 % (2529)------------------------------
% 0.22/0.46 % (2529)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.46 % (2529)Termination reason: Unknown
% 0.22/0.46 % (2529)Termination phase: Function definition elimination
% 0.22/0.46
% 0.22/0.46 % (2529)Memory used [KB]: 1023
% 0.22/0.46 % (2529)Time elapsed: 0.003 s
% 0.22/0.46 % (2529)Instructions burned: 7 (million)
% 0.22/0.46 % (2529)------------------------------
% 0.22/0.46 % (2529)------------------------------
% 0.22/0.46 % (2528)Instruction limit reached!
% 0.22/0.46 % (2528)------------------------------
% 0.22/0.46 % (2528)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.46 % (2528)Termination reason: Unknown
% 0.22/0.46 % (2528)Termination phase: Saturation
% 0.22/0.46
% 0.22/0.46 % (2528)Memory used [KB]: 5628
% 0.22/0.46 % (2528)Time elapsed: 0.008 s
% 0.22/0.46 % (2528)Instructions burned: 21 (million)
% 0.22/0.46 % (2528)------------------------------
% 0.22/0.46 % (2528)------------------------------
% 0.22/0.46 % (2525)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.22/0.46 % (2530)lrs+2_1:1_cnfonf=lazy_not_gen_be_off:cs=on:fe=off:hud=10:inj=on:ins=3:plsq=on:plsqc=1:sd=10:ss=axioms:tnu=1:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.22/0.46 % (2533)lrs+10_1:1_cnfonf=lazy_not_be_gen:ntd=on:sp=const_min:ss=axioms:sup=off:i=19:si=on:rtra=on_0 on theBenchmark for (2999ds/19Mi)
% 0.22/0.46 % (2531)lrs+1002_1:128_au=on:c=on:fsr=off:piset=equals:i=377:si=on:rtra=on_0 on theBenchmark for (2999ds/377Mi)
% 0.22/0.47 % (2530)Instruction limit reached!
% 0.22/0.47 % (2530)------------------------------
% 0.22/0.47 % (2530)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.47 % (2530)Termination reason: Unknown
% 0.22/0.47 % (2530)Termination phase: SInE selection
% 0.22/0.47
% 0.22/0.47 % (2530)Memory used [KB]: 1023
% 0.22/0.47 % (2530)Time elapsed: 0.005 s
% 0.22/0.47 % (2530)Instructions burned: 6 (million)
% 0.22/0.47 % (2530)------------------------------
% 0.22/0.47 % (2530)------------------------------
% 0.22/0.47 % (2532)dis+1010_1:4_atotf=0.2:c=on:cbe=off:cnfonf=lazy_simp:fe=off:ins=2:ntd=on:s2a=on:s2at=5.0:sgt=5:ss=axioms:st=1.5:i=779:si=on:rtra=on_0 on theBenchmark for (2999ds/779Mi)
% 0.22/0.47 % (2533)Instruction limit reached!
% 0.22/0.47 % (2533)------------------------------
% 0.22/0.47 % (2533)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.47 % (2533)Termination reason: Unknown
% 0.22/0.47 % (2533)Termination phase: Saturation
% 0.22/0.47
% 0.22/0.47 % (2533)Memory used [KB]: 5628
% 0.22/0.47 % (2533)Time elapsed: 0.007 s
% 0.22/0.47 % (2533)Instructions burned: 19 (million)
% 0.22/0.47 % (2533)------------------------------
% 0.22/0.47 % (2533)------------------------------
% 0.22/0.47 % (2525)Refutation not found, incomplete strategy
% 0.22/0.47 % (2525)------------------------------
% 0.22/0.47 % (2525)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.47 % (2525)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.47
% 0.22/0.47
% 0.22/0.47 % (2525)Memory used [KB]: 5628
% 0.22/0.47 % (2525)Time elapsed: 0.013 s
% 0.22/0.47 % (2525)Instructions burned: 12 (million)
% 0.22/0.47 % (2525)------------------------------
% 0.22/0.47 % (2525)------------------------------
% 0.22/0.47 % (2534)lrs+1010_1:1_au=on:s2a=on:sd=1:sgt=50:ss=axioms:i=879:si=on:rtra=on_0 on theBenchmark for (2999ds/879Mi)
% 0.22/0.48 % (2536)ott+21_1:1_apa=on:au=on:cnfonf=off:sos=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.22/0.48 % (2536)Instruction limit reached!
% 0.22/0.48 % (2536)------------------------------
% 0.22/0.48 % (2536)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.48 % (2536)Termination reason: Unknown
% 0.22/0.48 % (2536)Termination phase: shuffling
% 0.22/0.48
% 0.22/0.48 % (2536)Memory used [KB]: 1023
% 0.22/0.48 % (2536)Time elapsed: 0.002 s
% 0.22/0.48 % (2536)Instructions burned: 3 (million)
% 0.22/0.48 % (2536)------------------------------
% 0.22/0.48 % (2536)------------------------------
% 0.22/0.48 % (2535)dis+1002_1:128_acc=on:er=filter:i=17:si=on:rtra=on_0 on theBenchmark for (2999ds/17Mi)
% 0.22/0.48 % (2505)Instruction limit reached!
% 0.22/0.48 % (2505)------------------------------
% 0.22/0.48 % (2505)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.48 % (2505)Termination reason: Unknown
% 0.22/0.48 % (2505)Termination phase: Saturation
% 0.22/0.48
% 0.22/0.48 % (2505)Memory used [KB]: 6524
% 0.22/0.48 % (2505)Time elapsed: 0.092 s
% 0.22/0.48 % (2505)Instructions burned: 183 (million)
% 0.22/0.48 % (2505)------------------------------
% 0.22/0.48 % (2505)------------------------------
% 0.22/0.48 % (2531)First to succeed.
% 0.22/0.48 % (2538)dis+10_1:1_ixr=off:plsq=on:plsqc=1:plsqr=32,1:s2a=on:i=127:si=on:rtra=on_0 on theBenchmark for (2998ds/127Mi)
% 0.22/0.49 % (2535)Instruction limit reached!
% 0.22/0.49 % (2535)------------------------------
% 0.22/0.49 % (2535)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.49 % (2531)Refutation found. Thanks to Tanya!
% 0.22/0.49 % SZS status Theorem for theBenchmark
% 0.22/0.49 % SZS output start Proof for theBenchmark
% 0.22/0.49 thf(type_def_5, type, mu: $tType).
% 0.22/0.49 thf(func_def_0, type, mu: $tType).
% 0.22/0.49 thf(func_def_1, type, meq_ind: mu > mu > $i > $o).
% 0.22/0.49 thf(func_def_2, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.49 thf(func_def_4, type, mnot: ($i > $o) > $i > $o).
% 0.22/0.49 thf(func_def_5, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.49 thf(func_def_6, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.49 thf(func_def_7, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.49 thf(func_def_8, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.49 thf(func_def_9, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.49 thf(func_def_10, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.49 thf(func_def_11, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.22/0.49 thf(func_def_12, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.22/0.49 thf(func_def_13, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.22/0.49 thf(func_def_14, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.22/0.49 thf(func_def_15, type, mtrue: $i > $o).
% 0.22/0.49 thf(func_def_16, type, mfalse: $i > $o).
% 0.22/0.49 thf(func_def_17, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.22/0.49 thf(func_def_18, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.22/0.49 thf(func_def_19, type, mreflexive: ($i > $i > $o) > $o).
% 0.22/0.49 thf(func_def_20, type, msymmetric: ($i > $i > $o) > $o).
% 0.22/0.49 thf(func_def_21, type, mserial: ($i > $i > $o) > $o).
% 0.22/0.49 thf(func_def_22, type, mtransitive: ($i > $i > $o) > $o).
% 0.22/0.49 thf(func_def_23, type, meuclidean: ($i > $i > $o) > $o).
% 0.22/0.49 thf(func_def_24, type, mpartially_functional: ($i > $i > $o) > $o).
% 0.22/0.49 thf(func_def_25, type, mfunctional: ($i > $i > $o) > $o).
% 0.22/0.49 thf(func_def_26, type, mweakly_dense: ($i > $i > $o) > $o).
% 0.22/0.49 thf(func_def_27, type, mweakly_connected: ($i > $i > $o) > $o).
% 0.22/0.49 thf(func_def_28, type, mweakly_directed: ($i > $i > $o) > $o).
% 0.22/0.49 thf(func_def_29, type, mvalid: ($i > $o) > $o).
% 0.22/0.49 thf(func_def_30, type, minvalid: ($i > $o) > $o).
% 0.22/0.49 thf(func_def_31, type, msatisfiable: ($i > $o) > $o).
% 0.22/0.49 thf(func_def_32, type, mcountersatisfiable: ($i > $o) > $o).
% 0.22/0.49 thf(func_def_48, type, sK0: $i > $i > $o).
% 0.22/0.49 thf(func_def_50, type, sK2: $i > ($i > $o) > $i).
% 0.22/0.49 thf(func_def_51, type, sK3: $i > ($i > $o) > $i).
% 0.22/0.49 thf(func_def_55, type, ph7: !>[X0: $tType]:(X0)).
% 0.22/0.49 thf(f329,plain,(
% 0.22/0.49 $false),
% 0.22/0.49 inference(avatar_sat_refutation,[],[f239,f253,f262,f305,f316,f328])).
% 0.22/0.49 thf(f328,plain,(
% 0.22/0.49 spl1_4 | ~spl1_5 | ~spl1_8),
% 0.22/0.49 inference(avatar_split_clause,[],[f323,f312,f250,f247])).
% 0.22/0.49 thf(f247,plain,(
% 0.22/0.49 spl1_4 <=> ! [X2] : (((sK0 @ X2 @ sK6) = $false) | ((sK0 @ X2 @ sK5) = $false))),
% 0.22/0.49 introduced(avatar_definition,[new_symbols(naming,[spl1_4])])).
% 0.22/0.49 thf(f250,plain,(
% 0.22/0.49 spl1_5 <=> ! [X0,X1] : (((sK0 @ X0 @ X1) = $false) | ((sK0 @ sK5 @ (sK3 @ X1 @ (sK0 @ sK5))) = $true) | ($false = (sK0 @ X0 @ sK5)))),
% 0.22/0.49 introduced(avatar_definition,[new_symbols(naming,[spl1_5])])).
% 0.22/0.49 thf(f312,plain,(
% 0.22/0.49 spl1_8 <=> ((sK0 @ sK5 @ (sK3 @ sK6 @ (sK0 @ sK5))) = $false)),
% 0.22/0.49 introduced(avatar_definition,[new_symbols(naming,[spl1_8])])).
% 0.22/0.49 thf(f323,plain,(
% 0.22/0.49 ( ! [X0 : $i] : (($false = (sK0 @ X0 @ sK5)) | ((sK0 @ X0 @ sK6) = $false)) ) | (~spl1_5 | ~spl1_8)),
% 0.22/0.49 inference(trivial_inequality_removal,[],[f318])).
% 0.22/0.49 thf(f318,plain,(
% 0.22/0.49 ( ! [X0 : $i] : (((sK0 @ X0 @ sK6) = $false) | ($false = (sK0 @ X0 @ sK5)) | ($false = $true)) ) | (~spl1_5 | ~spl1_8)),
% 0.22/0.49 inference(superposition,[],[f314,f251])).
% 0.22/0.49 thf(f251,plain,(
% 0.22/0.49 ( ! [X0 : $i,X1 : $i] : (((sK0 @ sK5 @ (sK3 @ X1 @ (sK0 @ sK5))) = $true) | ($false = (sK0 @ X0 @ sK5)) | ((sK0 @ X0 @ X1) = $false)) ) | ~spl1_5),
% 0.22/0.49 inference(avatar_component_clause,[],[f250])).
% 0.22/0.49 thf(f314,plain,(
% 0.22/0.49 ((sK0 @ sK5 @ (sK3 @ sK6 @ (sK0 @ sK5))) = $false) | ~spl1_8),
% 0.22/0.49 inference(avatar_component_clause,[],[f312])).
% 0.22/0.49 thf(f316,plain,(
% 0.22/0.49 spl1_4 | spl1_8 | ~spl1_7),
% 0.22/0.49 inference(avatar_split_clause,[],[f309,f302,f312,f247])).
% 0.22/0.49 thf(f302,plain,(
% 0.22/0.49 spl1_7 <=> ! [X2,X1] : (((sK0 @ X2 @ X1) = $false) | ((sK0 @ X1 @ (sK3 @ X1 @ (sK0 @ sK5))) = $true) | ((sK0 @ X2 @ sK5) = $false))),
% 0.22/0.49 introduced(avatar_definition,[new_symbols(naming,[spl1_7])])).
% 0.22/0.49 thf(f309,plain,(
% 0.22/0.49 ( ! [X0 : $i] : (((sK0 @ X0 @ sK6) = $false) | ((sK0 @ sK5 @ (sK3 @ sK6 @ (sK0 @ sK5))) = $false) | ($false = (sK0 @ X0 @ sK5))) ) | ~spl1_7),
% 0.22/0.49 inference(trivial_inequality_removal,[],[f307])).
% 0.22/0.49 thf(f307,plain,(
% 0.22/0.49 ( ! [X0 : $i] : (((sK0 @ sK5 @ (sK3 @ sK6 @ (sK0 @ sK5))) = $false) | ($false = $true) | ((sK0 @ X0 @ sK6) = $false) | ($false = (sK0 @ X0 @ sK5))) ) | ~spl1_7),
% 0.22/0.49 inference(superposition,[],[f303,f188])).
% 0.22/0.49 thf(f188,plain,(
% 0.22/0.49 ( ! [X1 : $i] : (((sK0 @ sK6 @ X1) = $false) | ((sK0 @ sK5 @ X1) = $false)) )),
% 0.22/0.49 inference(binary_proxy_clausification,[],[f187])).
% 0.22/0.49 thf(f187,plain,(
% 0.22/0.49 ( ! [X1 : $i] : ((((sK0 @ sK6 @ X1) & (sK0 @ sK5 @ X1)) = $false)) )),
% 0.22/0.49 inference(beta_eta_normalization,[],[f186])).
% 0.22/0.49 thf(f186,plain,(
% 0.22/0.49 ( ! [X1 : $i] : ((((^[Y0 : $i]: ((sK0 @ sK6 @ Y0) & (sK0 @ sK5 @ Y0))) @ X1) = $false)) )),
% 0.22/0.49 inference(pi_clausification,[],[f182])).
% 0.22/0.49 thf(f182,plain,(
% 0.22/0.49 ((?? @ $i @ (^[Y0 : $i]: ((sK0 @ sK6 @ Y0) & (sK0 @ sK5 @ Y0)))) = $false)),
% 0.22/0.49 inference(binary_proxy_clausification,[],[f181])).
% 0.22/0.49 thf(f181,plain,(
% 0.22/0.49 ((((sK0 @ sK4 @ sK5) & (sK0 @ sK4 @ sK6)) => (?? @ $i @ (^[Y0 : $i]: ((sK0 @ sK6 @ Y0) & (sK0 @ sK5 @ Y0))))) = $false)),
% 0.22/0.49 inference(beta_eta_normalization,[],[f180])).
% 0.22/0.49 thf(f180,plain,(
% 0.22/0.49 (((^[Y0 : $i]: (((sK0 @ sK4 @ sK5) & (sK0 @ sK4 @ Y0)) => (?? @ $i @ (^[Y1 : $i]: ((sK0 @ Y0 @ Y1) & (sK0 @ sK5 @ Y1)))))) @ sK6) = $false)),
% 0.22/0.49 inference(sigma_clausification,[],[f179])).
% 0.22/0.49 thf(f179,plain,(
% 0.22/0.49 ((!! @ $i @ (^[Y0 : $i]: (((sK0 @ sK4 @ sK5) & (sK0 @ sK4 @ Y0)) => (?? @ $i @ (^[Y1 : $i]: ((sK0 @ Y0 @ Y1) & (sK0 @ sK5 @ Y1))))))) = $false)),
% 0.22/0.49 inference(beta_eta_normalization,[],[f178])).
% 0.22/0.49 thf(f178,plain,(
% 0.22/0.49 (((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((sK0 @ sK4 @ Y0) & (sK0 @ sK4 @ Y1)) => (?? @ $i @ (^[Y2 : $i]: ((sK0 @ Y1 @ Y2) & (sK0 @ Y0 @ Y2)))))))) @ sK5) = $false)),
% 0.22/0.49 inference(sigma_clausification,[],[f177])).
% 0.22/0.49 thf(f177,plain,(
% 0.22/0.49 ($false = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((sK0 @ sK4 @ Y0) & (sK0 @ sK4 @ Y1)) => (?? @ $i @ (^[Y2 : $i]: ((sK0 @ Y1 @ Y2) & (sK0 @ Y0 @ Y2))))))))))),
% 0.22/0.49 inference(beta_eta_normalization,[],[f176])).
% 0.22/0.49 thf(f176,plain,(
% 0.22/0.49 (((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK0 @ Y0 @ Y1) & (sK0 @ Y0 @ Y2)) => (?? @ $i @ (^[Y3 : $i]: ((sK0 @ Y2 @ Y3) & (sK0 @ Y1 @ Y3)))))))))) @ sK4) = $false)),
% 0.22/0.49 inference(sigma_clausification,[],[f175])).
% 0.22/0.49 thf(f175,plain,(
% 0.22/0.49 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK0 @ Y0 @ Y1) & (sK0 @ Y0 @ Y2)) => (?? @ $i @ (^[Y3 : $i]: ((sK0 @ Y2 @ Y3) & (sK0 @ Y1 @ Y3))))))))))) != $true)),
% 0.22/0.49 inference(beta_eta_normalization,[],[f140])).
% 0.22/0.49 thf(f140,plain,(
% 0.22/0.49 (((^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((Y0 @ Y1 @ Y2) & (Y0 @ Y1 @ Y3)) => (?? @ $i @ (^[Y4 : $i]: ((Y0 @ Y3 @ Y4) & (Y0 @ Y2 @ Y4)))))))))))) @ sK0) != $true)),
% 0.22/0.49 inference(definition_unfolding,[],[f117,f120])).
% 0.22/0.49 thf(f120,plain,(
% 0.22/0.49 (mweakly_directed = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((Y0 @ Y1 @ Y2) & (Y0 @ Y1 @ Y3)) => (?? @ $i @ (^[Y4 : $i]: ((Y0 @ Y3 @ Y4) & (Y0 @ Y2 @ Y4)))))))))))))),
% 0.22/0.49 inference(cnf_transformation,[],[f90])).
% 0.22/0.49 thf(f90,plain,(
% 0.22/0.49 (mweakly_directed = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((Y0 @ Y1 @ Y2) & (Y0 @ Y1 @ Y3)) => (?? @ $i @ (^[Y4 : $i]: ((Y0 @ Y3 @ Y4) & (Y0 @ Y2 @ Y4)))))))))))))),
% 0.22/0.49 inference(fool_elimination,[],[f89])).
% 0.22/0.49 thf(f89,plain,(
% 0.22/0.49 (mweakly_directed = (^[X0 : $i > $i > $o] : (! [X1,X2,X3] : (((X0 @ X3 @ X1) & (X0 @ X3 @ X2)) => ? [X4] : ((X0 @ X2 @ X4) & (X0 @ X1 @ X4))))))),
% 0.22/0.49 inference(rectify,[],[f27])).
% 0.22/0.49 thf(f27,axiom,(
% 0.22/0.49 (mweakly_directed = (^[X6 : $i > $i > $o] : (! [X10,X9,X8] : (((X6 @ X8 @ X10) & (X6 @ X8 @ X9)) => ? [X7] : ((X6 @ X9 @ X7) & (X6 @ X10 @ X7))))))),
% 0.22/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mweakly_directed)).
% 0.22/0.49 thf(f117,plain,(
% 0.22/0.49 ((mweakly_directed @ sK0) != $true)),
% 0.22/0.49 inference(cnf_transformation,[],[f97])).
% 0.22/0.49 thf(f97,plain,(
% 0.22/0.49 ((mweakly_directed @ sK0) != $true) & ($true = (mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mdia @ sK0 @ (mbox @ sK0 @ Y0)) @ (mbox @ sK0 @ (mdia @ sK0 @ Y0)))))))),
% 0.22/0.49 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f95,f96])).
% 0.22/0.49 thf(f96,plain,(
% 0.22/0.49 ? [X0 : $i > $i > $o] : (((mweakly_directed @ X0) != $true) & ((mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mdia @ X0 @ (mbox @ X0 @ Y0)) @ (mbox @ X0 @ (mdia @ X0 @ Y0)))))) = $true)) => (((mweakly_directed @ sK0) != $true) & ($true = (mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mdia @ sK0 @ (mbox @ sK0 @ Y0)) @ (mbox @ sK0 @ (mdia @ sK0 @ Y0))))))))),
% 0.22/0.49 introduced(choice_axiom,[])).
% 0.22/0.49 thf(f95,plain,(
% 0.22/0.49 ? [X0 : $i > $i > $o] : (((mweakly_directed @ X0) != $true) & ((mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mdia @ X0 @ (mbox @ X0 @ Y0)) @ (mbox @ X0 @ (mdia @ X0 @ Y0)))))) = $true))),
% 0.22/0.49 inference(ennf_transformation,[],[f88])).
% 0.22/0.49 thf(f88,plain,(
% 0.22/0.49 ~! [X0 : $i > $i > $o] : (((mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mdia @ X0 @ (mbox @ X0 @ Y0)) @ (mbox @ X0 @ (mdia @ X0 @ Y0)))))) = $true) => ((mweakly_directed @ X0) = $true))),
% 0.22/0.49 inference(fool_elimination,[],[f87])).
% 0.22/0.49 thf(f87,plain,(
% 0.22/0.49 ~! [X0 : $i > $i > $o] : ((mvalid @ (mforall_prop @ (^[X1 : $i > $o] : (mimplies @ (mdia @ X0 @ (mbox @ X0 @ X1)) @ (mbox @ X0 @ (mdia @ X0 @ X1)))))) => (mweakly_directed @ X0))),
% 0.22/0.49 inference(rectify,[],[f33])).
% 0.22/0.49 thf(f33,negated_conjecture,(
% 0.22/0.49 ~! [X6 : $i > $i > $o] : ((mvalid @ (mforall_prop @ (^[X11 : $i > $o] : (mimplies @ (mdia @ X6 @ (mbox @ X6 @ X11)) @ (mbox @ X6 @ (mdia @ X6 @ X11)))))) => (mweakly_directed @ X6))),
% 0.22/0.49 inference(negated_conjecture,[],[f32])).
% 0.22/0.49 thf(f32,conjecture,(
% 0.22/0.49 ! [X6 : $i > $i > $o] : ((mvalid @ (mforall_prop @ (^[X11 : $i > $o] : (mimplies @ (mdia @ X6 @ (mbox @ X6 @ X11)) @ (mbox @ X6 @ (mdia @ X6 @ X11)))))) => (mweakly_directed @ X6))),
% 0.22/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)).
% 0.22/0.49 thf(f303,plain,(
% 0.22/0.49 ( ! [X2 : $i,X1 : $i] : (((sK0 @ X1 @ (sK3 @ X1 @ (sK0 @ sK5))) = $true) | ((sK0 @ X2 @ X1) = $false) | ((sK0 @ X2 @ sK5) = $false)) ) | ~spl1_7),
% 0.22/0.49 inference(avatar_component_clause,[],[f302])).
% 0.22/0.49 thf(f305,plain,(
% 0.22/0.49 spl1_4 | spl1_7 | ~spl1_3),
% 0.22/0.49 inference(avatar_split_clause,[],[f299,f236,f302,f247])).
% 0.22/0.49 thf(f236,plain,(
% 0.22/0.49 spl1_3 <=> ! [X2,X3] : (($false = (sK0 @ X3 @ sK6)) | ($false = (sK0 @ sK5 @ (sK2 @ X2 @ (sK0 @ sK5)))) | ((sK0 @ X3 @ X2) = $false))),
% 0.22/0.49 introduced(avatar_definition,[new_symbols(naming,[spl1_3])])).
% 0.22/0.49 thf(f299,plain,(
% 0.22/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((sK0 @ X2 @ sK5) = $false) | ((sK0 @ X2 @ sK6) = $false) | ((sK0 @ X1 @ X0) = $false) | ((sK0 @ X0 @ (sK3 @ X0 @ (sK0 @ sK5))) = $true) | ((sK0 @ X1 @ sK5) = $false)) ) | ~spl1_3),
% 0.22/0.49 inference(trivial_inequality_removal,[],[f292])).
% 0.22/0.49 thf(f292,plain,(
% 0.22/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((sK0 @ X0 @ (sK3 @ X0 @ (sK0 @ sK5))) = $true) | ((sK0 @ X2 @ sK5) = $false) | ((sK0 @ X2 @ sK6) = $false) | ((sK0 @ X1 @ sK5) = $false) | ($false = $true) | ((sK0 @ X1 @ X0) = $false)) ) | ~spl1_3),
% 0.22/0.49 inference(superposition,[],[f174,f237])).
% 0.22/0.49 thf(f237,plain,(
% 0.22/0.49 ( ! [X2 : $i,X3 : $i] : (($false = (sK0 @ sK5 @ (sK2 @ X2 @ (sK0 @ sK5)))) | ($false = (sK0 @ X3 @ sK6)) | ((sK0 @ X3 @ X2) = $false)) ) | ~spl1_3),
% 0.22/0.49 inference(avatar_component_clause,[],[f236])).
% 0.22/0.49 thf(f174,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (((sK0 @ X4 @ (sK2 @ X4 @ X2)) = $true) | ((sK0 @ X3 @ (sK3 @ X3 @ X2)) = $true) | ((sK0 @ X1 @ X3) = $false) | ($false = (sK0 @ X1 @ X4))) )),
% 0.22/0.49 inference(not_proxy_clausification,[],[f171])).
% 0.22/0.49 thf(f171,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (((sK0 @ X4 @ (sK2 @ X4 @ X2)) = $true) | ($false = (sK0 @ X1 @ X4)) | ((sK0 @ X1 @ X3) = $false) | ($false = (~ (sK0 @ X3 @ (sK3 @ X3 @ X2))))) )),
% 0.22/0.49 inference(binary_proxy_clausification,[],[f170])).
% 0.22/0.49 thf(f170,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (((sK0 @ X4 @ (sK2 @ X4 @ X2)) = $true) | (((~ (X2 @ (sK3 @ X3 @ X2))) | (~ (sK0 @ X3 @ (sK3 @ X3 @ X2)))) = $false) | ($false = (sK0 @ X1 @ X4)) | ((sK0 @ X1 @ X3) = $false)) )),
% 0.22/0.49 inference(not_proxy_clausification,[],[f169])).
% 0.22/0.49 thf(f169,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (($false = (sK0 @ X1 @ X4)) | ((~ (sK0 @ X4 @ (sK2 @ X4 @ X2))) = $false) | ((sK0 @ X1 @ X3) = $false) | (((~ (X2 @ (sK3 @ X3 @ X2))) | (~ (sK0 @ X3 @ (sK3 @ X3 @ X2)))) = $false)) )),
% 0.22/0.49 inference(not_proxy_clausification,[],[f162])).
% 0.22/0.49 thf(f162,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (((~ (sK0 @ X1 @ X4)) = $true) | ((sK0 @ X1 @ X3) = $false) | ((~ (sK0 @ X4 @ (sK2 @ X4 @ X2))) = $false) | (((~ (X2 @ (sK3 @ X3 @ X2))) | (~ (sK0 @ X3 @ (sK3 @ X3 @ X2)))) = $false)) )),
% 0.22/0.49 inference(binary_proxy_clausification,[],[f161])).
% 0.22/0.49 thf(f161,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (($false = ((X2 @ (sK2 @ X4 @ X2)) | (~ (sK0 @ X4 @ (sK2 @ X4 @ X2))))) | ((sK0 @ X1 @ X3) = $false) | ((~ (sK0 @ X1 @ X4)) = $true) | (((~ (X2 @ (sK3 @ X3 @ X2))) | (~ (sK0 @ X3 @ (sK3 @ X3 @ X2)))) = $false)) )),
% 0.22/0.49 inference(beta_eta_normalization,[],[f160])).
% 0.22/0.49 thf(f160,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (($false = ((X2 @ (sK2 @ X4 @ X2)) | (~ (sK0 @ X4 @ (sK2 @ X4 @ X2))))) | (((^[Y0 : $i]: ((~ (X2 @ Y0)) | (~ (sK0 @ X3 @ Y0)))) @ (sK3 @ X3 @ X2)) = $false) | ((~ (sK0 @ X1 @ X4)) = $true) | ((sK0 @ X1 @ X3) = $false)) )),
% 0.22/0.49 inference(sigma_clausification,[],[f159])).
% 0.22/0.49 thf(f159,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((~ (X2 @ Y0)) | (~ (sK0 @ X3 @ Y0))))) = $false) | ($false = ((X2 @ (sK2 @ X4 @ X2)) | (~ (sK0 @ X4 @ (sK2 @ X4 @ X2))))) | ((sK0 @ X1 @ X3) = $false) | ((~ (sK0 @ X1 @ X4)) = $true)) )),
% 0.22/0.49 inference(not_proxy_clausification,[],[f158])).
% 0.22/0.49 thf(f158,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (((~ (!! @ $i @ (^[Y0 : $i]: ((~ (X2 @ Y0)) | (~ (sK0 @ X3 @ Y0)))))) = $true) | ((~ (sK0 @ X1 @ X4)) = $true) | ($false = ((X2 @ (sK2 @ X4 @ X2)) | (~ (sK0 @ X4 @ (sK2 @ X4 @ X2))))) | ((sK0 @ X1 @ X3) = $false)) )),
% 0.22/0.49 inference(beta_eta_normalization,[],[f157])).
% 0.22/0.49 thf(f157,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : ((((^[Y0 : $i]: ((X2 @ Y0) | (~ (sK0 @ X4 @ Y0)))) @ (sK2 @ X4 @ X2)) = $false) | ((sK0 @ X1 @ X3) = $false) | ((~ (sK0 @ X1 @ X4)) = $true) | ((~ (!! @ $i @ (^[Y0 : $i]: ((~ (X2 @ Y0)) | (~ (sK0 @ X3 @ Y0)))))) = $true)) )),
% 0.22/0.49 inference(sigma_clausification,[],[f156])).
% 0.22/0.49 thf(f156,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((X2 @ Y0) | (~ (sK0 @ X4 @ Y0))))) = $false) | ((~ (sK0 @ X1 @ X4)) = $true) | ((sK0 @ X1 @ X3) = $false) | ((~ (!! @ $i @ (^[Y0 : $i]: ((~ (X2 @ Y0)) | (~ (sK0 @ X3 @ Y0)))))) = $true)) )),
% 0.22/0.49 inference(not_proxy_clausification,[],[f155])).
% 0.22/0.49 thf(f155,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (((~ (!! @ $i @ (^[Y0 : $i]: ((X2 @ Y0) | (~ (sK0 @ X4 @ Y0)))))) = $true) | ((~ (sK0 @ X1 @ X4)) = $true) | ((sK0 @ X1 @ X3) = $false) | ((~ (!! @ $i @ (^[Y0 : $i]: ((~ (X2 @ Y0)) | (~ (sK0 @ X3 @ Y0)))))) = $true)) )),
% 0.22/0.49 inference(binary_proxy_clausification,[],[f154])).
% 0.22/0.49 thf(f154,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (((sK0 @ X1 @ X3) = $false) | (((~ (!! @ $i @ (^[Y0 : $i]: ((X2 @ Y0) | (~ (sK0 @ X4 @ Y0)))))) | (~ (sK0 @ X1 @ X4))) = $true) | ((~ (!! @ $i @ (^[Y0 : $i]: ((~ (X2 @ Y0)) | (~ (sK0 @ X3 @ Y0)))))) = $true)) )),
% 0.22/0.49 inference(not_proxy_clausification,[],[f153])).
% 0.22/0.49 thf(f153,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (((~ (sK0 @ X1 @ X3)) = $true) | (((~ (!! @ $i @ (^[Y0 : $i]: ((X2 @ Y0) | (~ (sK0 @ X4 @ Y0)))))) | (~ (sK0 @ X1 @ X4))) = $true) | ((~ (!! @ $i @ (^[Y0 : $i]: ((~ (X2 @ Y0)) | (~ (sK0 @ X3 @ Y0)))))) = $true)) )),
% 0.22/0.49 inference(beta_eta_normalization,[],[f152])).
% 0.22/0.49 thf(f152,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (((~ (sK0 @ X1 @ X3)) = $true) | ($true = ((^[Y0 : $i]: ((~ (!! @ $i @ (^[Y1 : $i]: ((X2 @ Y1) | (~ (sK0 @ Y0 @ Y1)))))) | (~ (sK0 @ X1 @ Y0)))) @ X4)) | ((~ (!! @ $i @ (^[Y0 : $i]: ((~ (X2 @ Y0)) | (~ (sK0 @ X3 @ Y0)))))) = $true)) )),
% 0.22/0.49 inference(pi_clausification,[],[f151])).
% 0.22/0.49 thf(f151,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: ((~ (!! @ $i @ (^[Y1 : $i]: ((X2 @ Y1) | (~ (sK0 @ Y0 @ Y1)))))) | (~ (sK0 @ X1 @ Y0)))))) | ((~ (sK0 @ X1 @ X3)) = $true) | ((~ (!! @ $i @ (^[Y0 : $i]: ((~ (X2 @ Y0)) | (~ (sK0 @ X3 @ Y0)))))) = $true)) )),
% 0.22/0.49 inference(binary_proxy_clausification,[],[f150])).
% 0.22/0.49 thf(f150,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i] : ((((~ (!! @ $i @ (^[Y0 : $i]: ((~ (X2 @ Y0)) | (~ (sK0 @ X3 @ Y0)))))) | (~ (sK0 @ X1 @ X3))) = $true) | ($true = (!! @ $i @ (^[Y0 : $i]: ((~ (!! @ $i @ (^[Y1 : $i]: ((X2 @ Y1) | (~ (sK0 @ Y0 @ Y1)))))) | (~ (sK0 @ X1 @ Y0))))))) )),
% 0.22/0.49 inference(beta_eta_normalization,[],[f149])).
% 0.22/0.49 thf(f149,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: ((~ (!! @ $i @ (^[Y1 : $i]: ((X2 @ Y1) | (~ (sK0 @ Y0 @ Y1)))))) | (~ (sK0 @ X1 @ Y0)))))) | (((^[Y0 : $i]: ((~ (!! @ $i @ (^[Y1 : $i]: ((~ (X2 @ Y1)) | (~ (sK0 @ Y0 @ Y1)))))) | (~ (sK0 @ X1 @ Y0)))) @ X3) = $true)) )),
% 0.22/0.49 inference(pi_clausification,[],[f148])).
% 0.22/0.49 thf(f148,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((~ (!! @ $i @ (^[Y1 : $i]: ((~ (X2 @ Y1)) | (~ (sK0 @ Y0 @ Y1)))))) | (~ (sK0 @ X1 @ Y0))))) = $true) | ($true = (!! @ $i @ (^[Y0 : $i]: ((~ (!! @ $i @ (^[Y1 : $i]: ((X2 @ Y1) | (~ (sK0 @ Y0 @ Y1)))))) | (~ (sK0 @ X1 @ Y0))))))) )),
% 0.22/0.49 inference(binary_proxy_clausification,[],[f147])).
% 0.22/0.49 thf(f147,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X1 : $i] : ((((!! @ $i @ (^[Y0 : $i]: ((~ (!! @ $i @ (^[Y1 : $i]: ((X2 @ Y1) | (~ (sK0 @ Y0 @ Y1)))))) | (~ (sK0 @ X1 @ Y0))))) | (!! @ $i @ (^[Y0 : $i]: ((~ (!! @ $i @ (^[Y1 : $i]: ((~ (X2 @ Y1)) | (~ (sK0 @ Y0 @ Y1)))))) | (~ (sK0 @ X1 @ Y0)))))) = $true)) )),
% 0.22/0.49 inference(beta_eta_normalization,[],[f146])).
% 0.22/0.49 thf(f146,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X1 : $i] : ((((^[Y0 : $i > $o]: ((!! @ $i @ (^[Y1 : $i]: ((~ (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (sK0 @ Y1 @ Y2)))))) | (~ (sK0 @ X1 @ Y1))))) | (!! @ $i @ (^[Y1 : $i]: ((~ (!! @ $i @ (^[Y2 : $i]: ((~ (Y0 @ Y2)) | (~ (sK0 @ Y1 @ Y2)))))) | (~ (sK0 @ X1 @ Y1))))))) @ X2) = $true)) )),
% 0.22/0.49 inference(pi_clausification,[],[f145])).
% 0.22/0.49 thf(f145,plain,(
% 0.22/0.49 ( ! [X1 : $i] : (((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((!! @ $i @ (^[Y1 : $i]: ((~ (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (sK0 @ Y1 @ Y2)))))) | (~ (sK0 @ X1 @ Y1))))) | (!! @ $i @ (^[Y1 : $i]: ((~ (!! @ $i @ (^[Y2 : $i]: ((~ (Y0 @ Y2)) | (~ (sK0 @ Y1 @ Y2)))))) | (~ (sK0 @ X1 @ Y1)))))))) = $true)) )),
% 0.22/0.49 inference(beta_eta_normalization,[],[f144])).
% 0.22/0.49 thf(f144,plain,(
% 0.22/0.49 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((!! @ $i @ (^[Y2 : $i]: ((~ (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (sK0 @ Y2 @ Y3)))))) | (~ (sK0 @ Y0 @ Y2))))) | (!! @ $i @ (^[Y2 : $i]: ((~ (!! @ $i @ (^[Y3 : $i]: ((~ (Y1 @ Y3)) | (~ (sK0 @ Y2 @ Y3)))))) | (~ (sK0 @ Y0 @ Y2))))))))) @ X1) = $true)) )),
% 0.22/0.49 inference(pi_clausification,[],[f143])).
% 0.22/0.49 thf(f143,plain,(
% 0.22/0.49 ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((!! @ $i @ (^[Y2 : $i]: ((~ (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (sK0 @ Y2 @ Y3)))))) | (~ (sK0 @ Y0 @ Y2))))) | (!! @ $i @ (^[Y2 : $i]: ((~ (!! @ $i @ (^[Y3 : $i]: ((~ (Y1 @ Y3)) | (~ (sK0 @ Y2 @ Y3)))))) | (~ (sK0 @ Y0 @ Y2)))))))))) = $true)),
% 0.22/0.49 inference(boolean_simplification,[],[f142])).
% 0.22/0.49 thf(f142,plain,(
% 0.22/0.49 ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((~ (~ (!! @ $i @ (^[Y2 : $i]: ((~ (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (sK0 @ Y2 @ Y3)))))) | (~ (sK0 @ Y0 @ Y2))))))) | (!! @ $i @ (^[Y2 : $i]: ((~ (!! @ $i @ (^[Y3 : $i]: ((~ (Y1 @ Y3)) | (~ (sK0 @ Y2 @ Y3)))))) | (~ (sK0 @ Y0 @ Y2)))))))))) = $true)),
% 0.22/0.49 inference(beta_eta_normalization,[],[f141])).
% 0.22/0.49 thf(f141,plain,(
% 0.22/0.49 (((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : ($i > $o) > $i > $o]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (Y0 @ Y2 @ Y1)))))) @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i]: ((Y3 @ Y5) | (Y4 @ Y5))))))) @ ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (~ (Y3 @ Y4))))) @ Y1) @ Y2)))) @ ((^[Y1 : $i > $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (~ (Y3 @ Y4))))) @ ((^[Y3 : $i > $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (!! @ $i @ (^[Y6 : $i]: ((Y4 @ Y6) | (~ (Y3 @ Y5 @ Y6)))))))))) @ Y1 @ ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (~ (Y3 @ Y4))))) @ Y2)))))) @ sK0 @ ((^[Y1 : $i > $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: ((Y2 @ Y4) | (~ (Y1 @ Y3 @ Y4)))))))))) @ sK0 @ Y0)) @ ((^[Y1 : $i > $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: ((Y2 @ Y4) | (~ (Y1 @ Y3 @ Y4)))))))))) @ sK0 @ ((^[Y1 : $i > $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (~ (Y3 @ Y4))))) @ ((^[Y3 : $i > $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (!! @ $i @ (^[Y6 : $i]: ((Y4 @ Y6) | (~ (Y3 @ Y5 @ Y6)))))))))) @ Y1 @ ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (~ (Y3 @ Y4))))) @ Y2)))))) @ sK0 @ Y0)))))) = $true)),
% 0.22/0.49 inference(definition_unfolding,[],[f116,f111,f104,f132,f139,f130,f130,f139])).
% 0.22/0.49 thf(f130,plain,(
% 0.22/0.49 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (Y0 @ Y2 @ Y3)))))))))))),
% 0.22/0.49 inference(cnf_transformation,[],[f49])).
% 0.22/0.49 thf(f49,plain,(
% 0.22/0.49 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (Y0 @ Y2 @ Y3)))))))))))),
% 0.22/0.49 inference(fool_elimination,[],[f48])).
% 0.22/0.49 thf(f48,plain,(
% 0.22/0.49 ((^[X0 : $i > $i > $o, X1 : $i > $o, X2 : $i] : (! [X3] : (~(X0 @ X2 @ X3) | (X1 @ X3)))) = mbox)),
% 0.22/0.49 inference(rectify,[],[f16])).
% 0.22/0.49 thf(f16,axiom,(
% 0.22/0.49 ((^[X6 : $i > $i > $o, X3 : $i > $o, X2 : $i] : (! [X7] : (~(X6 @ X2 @ X7) | (X3 @ X7)))) = mbox)),
% 0.22/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mbox)).
% 0.22/0.49 thf(f139,plain,(
% 0.22/0.49 (mdia = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ ((^[Y2 : $i > $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (!! @ $i @ (^[Y5 : $i]: ((Y3 @ Y5) | (~ (Y2 @ Y4 @ Y5)))))))))) @ Y0 @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y1)))))))),
% 0.22/0.49 inference(definition_unfolding,[],[f101,f98,f130,f98])).
% 0.22/0.49 thf(f98,plain,(
% 0.22/0.49 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.22/0.49 inference(cnf_transformation,[],[f59])).
% 0.22/0.49 thf(f59,plain,(
% 0.22/0.49 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.22/0.49 inference(fool_elimination,[],[f58])).
% 0.22/0.49 thf(f58,plain,(
% 0.22/0.49 ((^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))) = mnot)),
% 0.22/0.49 inference(rectify,[],[f3])).
% 0.22/0.49 thf(f3,axiom,(
% 0.22/0.49 ((^[X3 : $i > $o, X2 : $i] : (~(X3 @ X2))) = mnot)),
% 0.22/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mnot)).
% 0.22/0.49 thf(f101,plain,(
% 0.22/0.49 (mdia = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: (mnot @ (mbox @ Y0 @ (mnot @ Y1)))))))),
% 0.22/0.49 inference(cnf_transformation,[],[f84])).
% 0.22/0.49 thf(f84,plain,(
% 0.22/0.49 (mdia = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: (mnot @ (mbox @ Y0 @ (mnot @ Y1)))))))),
% 0.22/0.49 inference(fool_elimination,[],[f83])).
% 0.22/0.49 thf(f83,plain,(
% 0.22/0.49 (mdia = (^[X0 : $i > $i > $o, X1 : $i > $o] : (mnot @ (mbox @ X0 @ (mnot @ X1)))))),
% 0.22/0.49 inference(rectify,[],[f17])).
% 0.22/0.49 thf(f17,axiom,(
% 0.22/0.49 (mdia = (^[X6 : $i > $i > $o, X3 : $i > $o] : (mnot @ (mbox @ X6 @ (mnot @ X3)))))),
% 0.22/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mdia)).
% 0.22/0.49 thf(f132,plain,(
% 0.22/0.49 (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.22/0.49 inference(definition_unfolding,[],[f119,f110,f98])).
% 0.22/0.49 thf(f110,plain,(
% 0.22/0.49 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) | (Y1 @ Y2))))))))),
% 0.22/0.49 inference(cnf_transformation,[],[f53])).
% 0.22/0.49 thf(f53,plain,(
% 0.22/0.49 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) | (Y1 @ Y2))))))))),
% 0.22/0.49 inference(fool_elimination,[],[f52])).
% 0.22/0.49 thf(f52,plain,(
% 0.22/0.49 ((^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X1 @ X2) | (X0 @ X2))) = mor)),
% 0.22/0.49 inference(rectify,[],[f4])).
% 0.22/0.49 thf(f4,axiom,(
% 0.22/0.49 ((^[X3 : $i > $o, X4 : $i > $o, X2 : $i] : ((X4 @ X2) | (X3 @ X2))) = mor)),
% 0.22/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mor)).
% 0.22/0.49 thf(f119,plain,(
% 0.22/0.49 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.22/0.49 inference(cnf_transformation,[],[f68])).
% 0.22/0.49 thf(f68,plain,(
% 0.22/0.49 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.22/0.49 inference(fool_elimination,[],[f67])).
% 0.22/0.49 thf(f67,plain,(
% 0.22/0.49 ((^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)) = mimplies)),
% 0.22/0.49 inference(rectify,[],[f6])).
% 0.22/0.49 thf(f6,axiom,(
% 0.22/0.49 ((^[X3 : $i > $o, X4 : $i > $o] : (mor @ (mnot @ X3) @ X4)) = mimplies)),
% 0.22/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mimplies)).
% 0.22/0.49 thf(f104,plain,(
% 0.22/0.49 (mforall_prop = (^[Y0 : ($i > $o) > $i > $o]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (Y0 @ Y2 @ Y1)))))))),
% 0.22/0.49 inference(cnf_transformation,[],[f82])).
% 0.22/0.49 thf(f82,plain,(
% 0.22/0.49 (mforall_prop = (^[Y0 : ($i > $o) > $i > $o]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (Y0 @ Y2 @ Y1)))))))),
% 0.22/0.49 inference(fool_elimination,[],[f81])).
% 0.22/0.49 thf(f81,plain,(
% 0.22/0.49 ((^[X0 : ($i > $o) > $i > $o, X1 : $i] : (! [X2 : $i > $o] : (X0 @ X2 @ X1))) = mforall_prop)),
% 0.22/0.49 inference(rectify,[],[f11])).
% 0.22/0.49 thf(f11,axiom,(
% 0.22/0.49 ((^[X3 : ($i > $o) > $i > $o, X2 : $i] : (! [X5 : $i > $o] : (X3 @ X5 @ X2))) = mforall_prop)),
% 0.22/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mforall_prop)).
% 0.22/0.49 thf(f111,plain,(
% 0.22/0.49 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.22/0.49 inference(cnf_transformation,[],[f47])).
% 0.22/0.49 thf(f47,plain,(
% 0.22/0.49 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.22/0.49 inference(fool_elimination,[],[f46])).
% 0.22/0.49 thf(f46,plain,(
% 0.22/0.49 ((^[X0 : $i > $o] : (! [X1] : (X0 @ X1))) = mvalid)),
% 0.22/0.49 inference(rectify,[],[f28])).
% 0.22/0.49 thf(f28,axiom,(
% 0.22/0.49 ((^[X3 : $i > $o] : (! [X2] : (X3 @ X2))) = mvalid)),
% 0.22/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mvalid)).
% 0.22/0.49 thf(f116,plain,(
% 0.22/0.49 ($true = (mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mdia @ sK0 @ (mbox @ sK0 @ Y0)) @ (mbox @ sK0 @ (mdia @ sK0 @ Y0)))))))),
% 0.22/0.49 inference(cnf_transformation,[],[f97])).
% 0.22/0.49 thf(f262,plain,(
% 0.22/0.49 ~spl1_4),
% 0.22/0.49 inference(avatar_contradiction_clause,[],[f261])).
% 0.22/0.49 thf(f261,plain,(
% 0.22/0.49 $false | ~spl1_4),
% 0.22/0.49 inference(trivial_inequality_removal,[],[f260])).
% 0.22/0.49 thf(f260,plain,(
% 0.22/0.49 ($false = $true) | ~spl1_4),
% 0.22/0.49 inference(backward_demodulation,[],[f185,f259])).
% 0.22/0.49 thf(f259,plain,(
% 0.22/0.49 ($false = (sK0 @ sK4 @ sK5)) | ~spl1_4),
% 0.22/0.49 inference(trivial_inequality_removal,[],[f255])).
% 0.22/0.49 thf(f255,plain,(
% 0.22/0.49 ($false = $true) | ($false = (sK0 @ sK4 @ sK5)) | ~spl1_4),
% 0.22/0.49 inference(superposition,[],[f248,f184])).
% 0.22/0.49 thf(f184,plain,(
% 0.22/0.49 ((sK0 @ sK4 @ sK6) = $true)),
% 0.22/0.49 inference(binary_proxy_clausification,[],[f183])).
% 0.22/0.49 thf(f183,plain,(
% 0.22/0.49 (((sK0 @ sK4 @ sK5) & (sK0 @ sK4 @ sK6)) = $true)),
% 0.22/0.49 inference(binary_proxy_clausification,[],[f181])).
% 0.22/0.49 thf(f248,plain,(
% 0.22/0.49 ( ! [X2 : $i] : (((sK0 @ X2 @ sK6) = $false) | ((sK0 @ X2 @ sK5) = $false)) ) | ~spl1_4),
% 0.22/0.49 inference(avatar_component_clause,[],[f247])).
% 0.22/0.49 thf(f185,plain,(
% 0.22/0.49 ((sK0 @ sK4 @ sK5) = $true)),
% 0.22/0.49 inference(binary_proxy_clausification,[],[f183])).
% 0.22/0.49 thf(f253,plain,(
% 0.22/0.49 spl1_5 | spl1_4 | ~spl1_3),
% 0.22/0.49 inference(avatar_split_clause,[],[f243,f236,f247,f250])).
% 0.22/0.49 thf(f243,plain,(
% 0.22/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((sK0 @ X1 @ X2) = $false) | ((sK0 @ sK5 @ (sK3 @ X2 @ (sK0 @ sK5))) = $true) | ((sK0 @ X1 @ sK5) = $false) | ($false = (sK0 @ X0 @ sK5)) | ((sK0 @ X0 @ sK6) = $false)) ) | ~spl1_3),
% 0.22/0.49 inference(trivial_inequality_removal,[],[f241])).
% 0.22/0.49 thf(f241,plain,(
% 0.22/0.49 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((sK0 @ X1 @ X2) = $false) | ((sK0 @ X1 @ sK5) = $false) | ($false = $true) | ($false = (sK0 @ X0 @ sK5)) | ((sK0 @ sK5 @ (sK3 @ X2 @ (sK0 @ sK5))) = $true) | ((sK0 @ X0 @ sK6) = $false)) ) | ~spl1_3),
% 0.22/0.49 inference(superposition,[],[f237,f173])).
% 0.22/0.49 thf(f173,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (((sK0 @ X4 @ (sK2 @ X4 @ X2)) = $true) | ($false = (sK0 @ X1 @ X4)) | ((sK0 @ X1 @ X3) = $false) | ($true = (X2 @ (sK3 @ X3 @ X2)))) )),
% 0.22/0.49 inference(not_proxy_clausification,[],[f172])).
% 0.22/0.49 thf(f172,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (((sK0 @ X1 @ X3) = $false) | ($false = (~ (X2 @ (sK3 @ X3 @ X2)))) | ((sK0 @ X4 @ (sK2 @ X4 @ X2)) = $true) | ($false = (sK0 @ X1 @ X4))) )),
% 0.22/0.49 inference(binary_proxy_clausification,[],[f170])).
% 0.22/0.49 thf(f239,plain,(
% 0.22/0.49 spl1_3 | spl1_3),
% 0.22/0.49 inference(avatar_split_clause,[],[f223,f236,f236])).
% 0.22/0.49 thf(f223,plain,(
% 0.22/0.49 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (((sK0 @ sK5 @ (sK2 @ X0 @ (sK0 @ sK5))) = $false) | ((sK0 @ sK5 @ (sK2 @ X3 @ (sK0 @ sK5))) = $false) | ($false = (sK0 @ X2 @ X3)) | ($false = (sK0 @ X1 @ sK6)) | ((sK0 @ X2 @ sK6) = $false) | ((sK0 @ X1 @ X0) = $false)) )),
% 0.22/0.49 inference(trivial_inequality_removal,[],[f220])).
% 0.22/0.49 thf(f220,plain,(
% 0.22/0.49 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (((sK0 @ sK5 @ (sK2 @ X3 @ (sK0 @ sK5))) = $false) | ((sK0 @ X2 @ sK6) = $false) | ($false = (sK0 @ X1 @ sK6)) | ($false = (sK0 @ X2 @ X3)) | ((sK0 @ sK5 @ (sK2 @ X0 @ (sK0 @ sK5))) = $false) | ($false = $true) | ((sK0 @ X1 @ X0) = $false)) )),
% 0.22/0.49 inference(superposition,[],[f212,f167])).
% 0.22/0.49 thf(f167,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (($true = (X2 @ (sK3 @ X3 @ X2))) | ((sK0 @ X1 @ X3) = $false) | ($false = (sK0 @ X1 @ X4)) | ($false = (X2 @ (sK2 @ X4 @ X2)))) )),
% 0.22/0.49 inference(not_proxy_clausification,[],[f166])).
% 0.22/0.49 thf(f166,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (($false = (X2 @ (sK2 @ X4 @ X2))) | ((sK0 @ X1 @ X3) = $false) | ($false = (~ (X2 @ (sK3 @ X3 @ X2)))) | ($false = (sK0 @ X1 @ X4))) )),
% 0.22/0.49 inference(binary_proxy_clausification,[],[f164])).
% 0.22/0.49 thf(f164,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : ((((~ (X2 @ (sK3 @ X3 @ X2))) | (~ (sK0 @ X3 @ (sK3 @ X3 @ X2)))) = $false) | ($false = (X2 @ (sK2 @ X4 @ X2))) | ($false = (sK0 @ X1 @ X4)) | ((sK0 @ X1 @ X3) = $false)) )),
% 0.22/0.49 inference(not_proxy_clausification,[],[f163])).
% 0.22/0.49 thf(f163,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (((~ (sK0 @ X1 @ X4)) = $true) | ((sK0 @ X1 @ X3) = $false) | ($false = (X2 @ (sK2 @ X4 @ X2))) | (((~ (X2 @ (sK3 @ X3 @ X2))) | (~ (sK0 @ X3 @ (sK3 @ X3 @ X2)))) = $false)) )),
% 0.22/0.49 inference(binary_proxy_clausification,[],[f161])).
% 0.22/0.49 thf(f212,plain,(
% 0.22/0.49 ( ! [X2 : $i,X0 : $i > $o,X1 : $i] : (($false = (sK0 @ sK5 @ (sK3 @ sK6 @ X0))) | ((X0 @ (sK2 @ X2 @ X0)) = $false) | ($false = (sK0 @ X1 @ sK6)) | ((sK0 @ X1 @ X2) = $false)) )),
% 0.22/0.49 inference(trivial_inequality_removal,[],[f208])).
% 0.22/0.49 thf(f208,plain,(
% 0.22/0.49 ( ! [X2 : $i,X0 : $i > $o,X1 : $i] : (((sK0 @ X1 @ X2) = $false) | ($false = (sK0 @ sK5 @ (sK3 @ sK6 @ X0))) | ($false = $true) | ((X0 @ (sK2 @ X2 @ X0)) = $false) | ($false = (sK0 @ X1 @ sK6))) )),
% 0.22/0.49 inference(superposition,[],[f168,f188])).
% 0.22/0.49 thf(f168,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (((sK0 @ X3 @ (sK3 @ X3 @ X2)) = $true) | ((sK0 @ X1 @ X3) = $false) | ($false = (sK0 @ X1 @ X4)) | ($false = (X2 @ (sK2 @ X4 @ X2)))) )),
% 0.22/0.49 inference(not_proxy_clausification,[],[f165])).
% 0.22/0.49 thf(f165,plain,(
% 0.22/0.49 ( ! [X2 : $i > $o,X3 : $i,X1 : $i,X4 : $i] : (($false = (sK0 @ X1 @ X4)) | ($false = (~ (sK0 @ X3 @ (sK3 @ X3 @ X2)))) | ($false = (X2 @ (sK2 @ X4 @ X2))) | ((sK0 @ X1 @ X3) = $false)) )),
% 0.22/0.49 inference(binary_proxy_clausification,[],[f164])).
% 0.22/0.49 % SZS output end Proof for theBenchmark
% 0.22/0.49 % (2531)------------------------------
% 0.22/0.49 % (2531)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.49 % (2531)Termination reason: Refutation
% 0.22/0.49
% 0.22/0.49 % (2531)Memory used [KB]: 5884
% 0.22/0.49 % (2531)Time elapsed: 0.047 s
% 0.22/0.49 % (2531)Instructions burned: 33 (million)
% 0.22/0.49 % (2531)------------------------------
% 0.22/0.49 % (2531)------------------------------
% 0.22/0.49 % (2504)Success in time 0.118 s
% 0.22/0.49 % Vampire---4.8 exiting
%------------------------------------------------------------------------------