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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO534^1 : TPTP v8.2.0. Released v5.2.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 : n009.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 09:06:07 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SYO534^1 : TPTP v8.2.0. Released v5.2.0.
% 0.06/0.14  % 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.13/0.34  % Computer : n009.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon May 20 09:44:53 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.35  This is a TH0_THM_EQU_NAR problem
% 0.13/0.35  Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.37  % (9228)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.13/0.37  % (9229)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.13/0.37  % (9231)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.37  % (9233)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.13/0.37  % (9231)Instruction limit reached!
% 0.13/0.37  % (9231)------------------------------
% 0.13/0.37  % (9231)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37  % (9231)Termination reason: Unknown
% 0.13/0.37  % (9231)Termination phase: Property scanning
% 0.13/0.37  
% 0.13/0.37  % (9231)Memory used [KB]: 895
% 0.13/0.37  % (9231)Time elapsed: 0.003 s
% 0.13/0.37  % (9231)Instructions burned: 2 (million)
% 0.13/0.37  % (9231)------------------------------
% 0.13/0.37  % (9231)------------------------------
% 0.13/0.37  % (9229)Instruction limit reached!
% 0.13/0.37  % (9229)------------------------------
% 0.13/0.37  % (9229)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37  % (9229)Termination reason: Unknown
% 0.13/0.37  % (9229)Termination phase: Saturation
% 0.13/0.37  
% 0.13/0.37  % (9229)Memory used [KB]: 5500
% 0.13/0.37  % (9229)Time elapsed: 0.005 s
% 0.13/0.37  % (9229)Instructions burned: 4 (million)
% 0.13/0.37  % (9229)------------------------------
% 0.13/0.37  % (9229)------------------------------
% 0.13/0.37  % (9233)Refutation not found, incomplete strategy
% 0.13/0.37  % (9233)------------------------------
% 0.13/0.37  % (9233)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37  % (9233)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.37  
% 0.13/0.37  
% 0.13/0.37  % (9233)Memory used [KB]: 5500
% 0.13/0.37  % (9233)Time elapsed: 0.004 s
% 0.13/0.37  % (9233)Instructions burned: 2 (million)
% 0.13/0.37  % (9233)------------------------------
% 0.13/0.37  % (9233)------------------------------
% 0.13/0.37  % (9230)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.20/0.38  % (9234)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.20/0.38  % (9235)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.20/0.38  % (9232)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.20/0.38  % (9235)Instruction limit reached!
% 0.20/0.38  % (9235)------------------------------
% 0.20/0.38  % (9235)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38  % (9235)Termination reason: Unknown
% 0.20/0.38  % (9235)Termination phase: Saturation
% 0.20/0.38  
% 0.20/0.38  % (9235)Memory used [KB]: 5500
% 0.20/0.38  % (9235)Time elapsed: 0.004 s
% 0.20/0.38  % (9235)Instructions burned: 3 (million)
% 0.20/0.38  % (9235)------------------------------
% 0.20/0.38  % (9235)------------------------------
% 0.20/0.38  % (9232)Instruction limit reached!
% 0.20/0.38  % (9232)------------------------------
% 0.20/0.38  % (9232)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38  % (9232)Termination reason: Unknown
% 0.20/0.38  % (9232)Termination phase: Function definition elimination
% 0.20/0.38  
% 0.20/0.38  % (9232)Memory used [KB]: 895
% 0.20/0.38  % (9232)Time elapsed: 0.004 s
% 0.20/0.38  % (9232)Instructions burned: 2 (million)
% 0.20/0.38  % (9232)------------------------------
% 0.20/0.38  % (9232)------------------------------
% 0.20/0.38  % (9236)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.20/0.38  % (9238)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.20/0.38  % (9238)Instruction limit reached!
% 0.20/0.38  % (9238)------------------------------
% 0.20/0.38  % (9238)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38  % (9238)Termination reason: Unknown
% 0.20/0.38  % (9238)Termination phase: Saturation
% 0.20/0.38  
% 0.20/0.38  % (9238)Memory used [KB]: 5500
% 0.20/0.38  % (9238)Time elapsed: 0.003 s
% 0.20/0.38  % (9238)Instructions burned: 3 (million)
% 0.20/0.38  % (9238)------------------------------
% 0.20/0.38  % (9238)------------------------------
% 0.20/0.39  % (9237)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.20/0.39  % (9230)Instruction limit reached!
% 0.20/0.39  % (9230)------------------------------
% 0.20/0.39  % (9230)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.39  % (9230)Termination reason: Unknown
% 0.20/0.39  % (9230)Termination phase: Saturation
% 0.20/0.39  
% 0.20/0.39  % (9230)Memory used [KB]: 5628
% 0.20/0.39  % (9230)Time elapsed: 0.021 s
% 0.20/0.39  % (9230)Instructions burned: 27 (million)
% 0.20/0.39  % (9230)------------------------------
% 0.20/0.39  % (9230)------------------------------
% 0.20/0.39  % (9234)Instruction limit reached!
% 0.20/0.39  % (9234)------------------------------
% 0.20/0.39  % (9234)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.39  % (9234)Termination reason: Unknown
% 0.20/0.39  % (9234)Termination phase: Saturation
% 0.20/0.39  
% 0.20/0.39  % (9234)Memory used [KB]: 5628
% 0.20/0.39  % (9234)Time elapsed: 0.014 s
% 0.20/0.39  % (9234)Instructions burned: 19 (million)
% 0.20/0.39  % (9234)------------------------------
% 0.20/0.39  % (9234)------------------------------
% 0.20/0.39  % (9237)Refutation not found, incomplete strategy
% 0.20/0.39  % (9237)------------------------------
% 0.20/0.39  % (9237)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.39  % (9237)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.39  
% 0.20/0.39  
% 0.20/0.39  % (9237)Memory used [KB]: 5500
% 0.20/0.39  % (9237)Time elapsed: 0.010 s
% 0.20/0.39  % (9237)Instructions burned: 12 (million)
% 0.20/0.39  % (9237)------------------------------
% 0.20/0.39  % (9237)------------------------------
% 0.20/0.39  % (9239)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.20/0.40  % (9240)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.20/0.40  % (9240)First to succeed.
% 0.20/0.40  % (9241)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.20/0.40  % (9240)Refutation found. Thanks to Tanya!
% 0.20/0.40  % SZS status Theorem for theBenchmark
% 0.20/0.40  % SZS output start Proof for theBenchmark
% 0.20/0.40  thf(func_def_0, type, eps: ($i > $o) > $i).
% 0.20/0.40  thf(func_def_2, type, epsa: ($i > $i > $i > $o) > $i).
% 0.20/0.40  thf(func_def_3, type, epsb: ($i > $i > $i > $o) > $i).
% 0.20/0.40  thf(func_def_4, type, epsc: ($i > $i > $i > $o) > $i).
% 0.20/0.40  thf(func_def_5, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.20/0.40  thf(func_def_14, type, sK0: $i > $i > $i > $o).
% 0.20/0.40  thf(func_def_18, type, ph4: !>[X0: $tType]:(X0)).
% 0.20/0.40  thf(f55,plain,(
% 0.20/0.40    $false),
% 0.20/0.40    inference(trivial_inequality_removal,[],[f54])).
% 0.20/0.40  thf(f54,plain,(
% 0.20/0.40    ($true = $false)),
% 0.20/0.40    inference(backward_demodulation,[],[f25,f53])).
% 0.20/0.40  thf(f53,plain,(
% 0.20/0.40    ( ! [X2 : $i,X3 : $i,X1 : $i] : (((sK0 @ X1 @ X3 @ X2) = $false)) )),
% 0.20/0.40    inference(trivial_inequality_removal,[],[f52])).
% 0.20/0.40  thf(f52,plain,(
% 0.20/0.40    ( ! [X2 : $i,X3 : $i,X1 : $i] : (((sK0 @ X1 @ X3 @ X2) = $false) | ($true = $false)) )),
% 0.20/0.40    inference(backward_demodulation,[],[f47,f51])).
% 0.20/0.40  thf(f51,plain,(
% 0.20/0.40    ( ! [X2 : $i,X1 : $i] : (((sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (sK0 @ Y0 @ Y2 @ Y1))))))) @ X1 @ X2) = $false)) )),
% 0.20/0.40    inference(trivial_inequality_removal,[],[f50])).
% 0.20/0.40  thf(f50,plain,(
% 0.20/0.40    ( ! [X2 : $i,X1 : $i] : (($true = $false) | ((sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (sK0 @ Y0 @ Y2 @ Y1))))))) @ X1 @ X2) = $false)) )),
% 0.20/0.40    inference(forward_demodulation,[],[f38,f48])).
% 0.20/0.40  thf(f48,plain,(
% 0.20/0.40    ( ! [X1 : $i] : (((sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (sK0 @ Y0 @ Y2 @ Y1))))))) @ (eps @ (^[Y0 : $i]: (?? @ $i @ (sK0 @ (eps @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (sK0 @ Y1 @ Y3 @ Y2))))))) @ Y0)))) @ X1) = $false)) )),
% 0.20/0.40    inference(subsumption_resolution,[],[f35,f32])).
% 0.20/0.40  thf(f32,plain,(
% 0.20/0.40    ((sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (sK0 @ Y0 @ Y2 @ Y1))))))) @ (eps @ (^[Y0 : $i]: (?? @ $i @ (sK0 @ (eps @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (sK0 @ Y1 @ Y3 @ Y2))))))) @ Y0)))) @ (eps @ (sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (sK0 @ Y0 @ Y2 @ Y1))))))) @ (eps @ (^[Y0 : $i]: (?? @ $i @ (sK0 @ (eps @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (sK0 @ Y1 @ Y3 @ Y2))))))) @ Y0))))))) != $true)),
% 0.20/0.40    inference(beta_eta_normalization,[],[f31])).
% 0.20/0.40  thf(f31,plain,(
% 0.20/0.40    ($true != (sK0 @ ((^[Y0 : $i > $i > $i > $o]: (eps @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (Y0 @ Y1 @ Y3 @ Y2)))))))) @ sK0) @ ((^[Y0 : $i > $i > $i > $o]: (eps @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (Y0 @ ((^[Y3 : $i > $i > $i > $o]: (eps @ (^[Y4 : $i]: (?? @ $i @ (^[Y5 : $i]: (?? @ $i @ (^[Y6 : $i]: (Y3 @ Y4 @ Y6 @ Y5)))))))) @ Y0) @ Y1 @ Y2)))))) @ sK0) @ ((^[Y0 : $i > $i > $i > $o]: (eps @ (^[Y1 : $i]: (Y0 @ ((^[Y2 : $i > $i > $i > $o]: (eps @ (^[Y3 : $i]: (?? @ $i @ (^[Y4 : $i]: (?? @ $i @ (^[Y5 : $i]: (Y2 @ Y3 @ Y5 @ Y4)))))))) @ Y0) @ ((^[Y2 : $i > $i > $i > $o]: (eps @ (^[Y3 : $i]: (?? @ $i @ (^[Y4 : $i]: (Y2 @ ((^[Y5 : $i > $i > $i > $o]: (eps @ (^[Y6 : $i]: (?? @ $i @ (^[Y7 : $i]: (?? @ $i @ (^[Y8 : $i]: (Y5 @ Y6 @ Y8 @ Y7)))))))) @ Y2) @ Y3 @ Y4)))))) @ Y0) @ Y1)))) @ sK0)))),
% 0.20/0.40    inference(definition_unfolding,[],[f26,f24,f29,f30])).
% 0.20/0.40  thf(f30,plain,(
% 0.20/0.40    (epsc = (^[Y0 : $i > $i > $i > $o]: (eps @ (^[Y1 : $i]: (Y0 @ ((^[Y2 : $i > $i > $i > $o]: (eps @ (^[Y3 : $i]: (?? @ $i @ (^[Y4 : $i]: (?? @ $i @ (^[Y5 : $i]: (Y2 @ Y3 @ Y5 @ Y4)))))))) @ Y0) @ ((^[Y2 : $i > $i > $i > $o]: (eps @ (^[Y3 : $i]: (?? @ $i @ (^[Y4 : $i]: (Y2 @ ((^[Y5 : $i > $i > $i > $o]: (eps @ (^[Y6 : $i]: (?? @ $i @ (^[Y7 : $i]: (?? @ $i @ (^[Y8 : $i]: (Y5 @ Y6 @ Y8 @ Y7)))))))) @ Y2) @ Y3 @ Y4)))))) @ Y0) @ Y1)))))),
% 0.20/0.40    inference(definition_unfolding,[],[f23,f24,f29])).
% 0.20/0.40  thf(f23,plain,(
% 0.20/0.40    (epsc = (^[Y0 : $i > $i > $i > $o]: (eps @ (^[Y1 : $i]: (Y0 @ (epsa @ Y0) @ (epsb @ Y0) @ Y1)))))),
% 0.20/0.40    inference(cnf_transformation,[],[f13])).
% 0.20/0.40  thf(f13,plain,(
% 0.20/0.40    (epsc = (^[Y0 : $i > $i > $i > $o]: (eps @ (^[Y1 : $i]: (Y0 @ (epsa @ Y0) @ (epsb @ Y0) @ Y1)))))),
% 0.20/0.40    inference(fool_elimination,[],[f12])).
% 0.20/0.40  thf(f12,plain,(
% 0.20/0.40    (epsc = (^[X0 : $i > $i > $i > $o] : (eps @ (^[X1 : $i] : (X0 @ (epsa @ X0) @ (epsb @ X0) @ X1)))))),
% 0.20/0.40    inference(rectify,[],[f4])).
% 0.20/0.40  thf(f4,axiom,(
% 0.20/0.40    (epsc = (^[X2 : $i > $i > $i > $o] : (eps @ (^[X4 : $i] : (X2 @ (epsa @ X2) @ (epsb @ X2) @ X4)))))),
% 0.20/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p',epscd)).
% 0.20/0.40  thf(f29,plain,(
% 0.20/0.40    (epsb = (^[Y0 : $i > $i > $i > $o]: (eps @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (Y0 @ ((^[Y3 : $i > $i > $i > $o]: (eps @ (^[Y4 : $i]: (?? @ $i @ (^[Y5 : $i]: (?? @ $i @ (^[Y6 : $i]: (Y3 @ Y4 @ Y6 @ Y5)))))))) @ Y0) @ Y1 @ Y2)))))))),
% 0.20/0.40    inference(definition_unfolding,[],[f28,f24])).
% 0.20/0.40  thf(f28,plain,(
% 0.20/0.40    (epsb = (^[Y0 : $i > $i > $i > $o]: (eps @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (Y0 @ (epsa @ Y0) @ Y1 @ Y2)))))))),
% 0.20/0.40    inference(cnf_transformation,[],[f17])).
% 0.20/0.40  thf(f17,plain,(
% 0.20/0.40    (epsb = (^[Y0 : $i > $i > $i > $o]: (eps @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (Y0 @ (epsa @ Y0) @ Y1 @ Y2)))))))),
% 0.20/0.40    inference(fool_elimination,[],[f16])).
% 0.20/0.40  thf(f16,plain,(
% 0.20/0.40    ((^[X0 : $i > $i > $i > $o] : (eps @ (^[X1 : $i] : (? [X2] : (X0 @ (epsa @ X0) @ X1 @ X2))))) = epsb)),
% 0.20/0.40    inference(rectify,[],[f3])).
% 0.20/0.40  thf(f3,axiom,(
% 0.20/0.40    ((^[X2 : $i > $i > $i > $o] : (eps @ (^[X3 : $i] : (? [X4] : (X2 @ (epsa @ X2) @ X3 @ X4))))) = epsb)),
% 0.20/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p',epsbd)).
% 0.20/0.40  thf(f24,plain,(
% 0.20/0.40    (epsa = (^[Y0 : $i > $i > $i > $o]: (eps @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (Y0 @ Y1 @ Y3 @ Y2)))))))))),
% 0.20/0.40    inference(cnf_transformation,[],[f9])).
% 0.20/0.40  thf(f9,plain,(
% 0.20/0.40    (epsa = (^[Y0 : $i > $i > $i > $o]: (eps @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (Y0 @ Y1 @ Y3 @ Y2)))))))))),
% 0.20/0.40    inference(fool_elimination,[],[f8])).
% 0.20/0.40  thf(f8,plain,(
% 0.20/0.40    (epsa = (^[X0 : $i > $i > $i > $o] : (eps @ (^[X1 : $i] : (? [X2,X3] : (X0 @ X1 @ X2 @ X3))))))),
% 0.20/0.40    inference(rectify,[],[f2])).
% 0.20/0.40  thf(f2,axiom,(
% 0.20/0.40    (epsa = (^[X2 : $i > $i > $i > $o] : (eps @ (^[X1 : $i] : (? [X3,X4] : (X2 @ X1 @ X3 @ X4))))))),
% 0.20/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p',epsad)).
% 0.20/0.40  thf(f26,plain,(
% 0.20/0.40    ($true != (sK0 @ (epsa @ sK0) @ (epsb @ sK0) @ (epsc @ sK0)))),
% 0.20/0.40    inference(cnf_transformation,[],[f22])).
% 0.20/0.40  thf(f22,plain,(
% 0.20/0.40    ($true != (sK0 @ (epsa @ sK0) @ (epsb @ sK0) @ (epsc @ sK0))) & ($true = (sK0 @ sK2 @ sK1 @ sK3))),
% 0.20/0.40    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f19,f21,f20])).
% 0.20/0.40  thf(f20,plain,(
% 0.20/0.40    ? [X0 : $i > $i > $i > $o] : (($true != (X0 @ (epsa @ X0) @ (epsb @ X0) @ (epsc @ X0))) & ? [X1,X2,X3] : ((X0 @ X2 @ X1 @ X3) = $true)) => (($true != (sK0 @ (epsa @ sK0) @ (epsb @ sK0) @ (epsc @ sK0))) & ? [X3,X2,X1] : ($true = (sK0 @ X2 @ X1 @ X3)))),
% 0.20/0.40    introduced(choice_axiom,[])).
% 0.20/0.40  thf(f21,plain,(
% 0.20/0.40    ? [X3,X2,X1] : ($true = (sK0 @ X2 @ X1 @ X3)) => ($true = (sK0 @ sK2 @ sK1 @ sK3))),
% 0.20/0.40    introduced(choice_axiom,[])).
% 0.20/0.40  thf(f19,plain,(
% 0.20/0.40    ? [X0 : $i > $i > $i > $o] : (($true != (X0 @ (epsa @ X0) @ (epsb @ X0) @ (epsc @ X0))) & ? [X1,X2,X3] : ((X0 @ X2 @ X1 @ X3) = $true))),
% 0.20/0.40    inference(ennf_transformation,[],[f11])).
% 0.20/0.40  thf(f11,plain,(
% 0.20/0.40    ~! [X0 : $i > $i > $i > $o] : (? [X1,X2,X3] : ((X0 @ X2 @ X1 @ X3) = $true) => ($true = (X0 @ (epsa @ X0) @ (epsb @ X0) @ (epsc @ X0))))),
% 0.20/0.40    inference(fool_elimination,[],[f10])).
% 0.20/0.40  thf(f10,plain,(
% 0.20/0.40    ~! [X0 : $i > $i > $i > $o] : (? [X1,X2,X3] : (X0 @ X2 @ X1 @ X3) => (X0 @ (epsa @ X0) @ (epsb @ X0) @ (epsc @ X0)))),
% 0.20/0.40    inference(rectify,[],[f6])).
% 0.20/0.40  thf(f6,negated_conjecture,(
% 0.20/0.40    ~! [X2 : $i > $i > $i > $o] : (? [X3,X1,X4] : (X2 @ X1 @ X3 @ X4) => (X2 @ (epsa @ X2) @ (epsb @ X2) @ (epsc @ X2)))),
% 0.20/0.40    inference(negated_conjecture,[],[f5])).
% 0.20/0.40  thf(f5,conjecture,(
% 0.20/0.40    ! [X2 : $i > $i > $i > $o] : (? [X3,X1,X4] : (X2 @ X1 @ X3 @ X4) => (X2 @ (epsa @ X2) @ (epsb @ X2) @ (epsc @ X2)))),
% 0.20/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)).
% 0.20/0.40  thf(f35,plain,(
% 0.20/0.40    ( ! [X1 : $i] : (((sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (sK0 @ Y0 @ Y2 @ Y1))))))) @ (eps @ (^[Y0 : $i]: (?? @ $i @ (sK0 @ (eps @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (sK0 @ Y1 @ Y3 @ Y2))))))) @ Y0)))) @ X1) = $false) | ((sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (sK0 @ Y0 @ Y2 @ Y1))))))) @ (eps @ (^[Y0 : $i]: (?? @ $i @ (sK0 @ (eps @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (sK0 @ Y1 @ Y3 @ Y2))))))) @ Y0)))) @ (eps @ (sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (sK0 @ Y0 @ Y2 @ Y1))))))) @ (eps @ (^[Y0 : $i]: (?? @ $i @ (sK0 @ (eps @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (sK0 @ Y1 @ Y3 @ Y2))))))) @ Y0))))))) = $true)) )),
% 0.20/0.40    introduced(choice_axiom,[])).
% 0.20/0.40  thf(f38,plain,(
% 0.20/0.40    ( ! [X2 : $i,X1 : $i] : (((sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (sK0 @ Y0 @ Y2 @ Y1))))))) @ X1 @ X2) = $false) | ($true = (sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (sK0 @ Y0 @ Y2 @ Y1))))))) @ (eps @ (^[Y0 : $i]: (?? @ $i @ (sK0 @ (eps @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (sK0 @ Y1 @ Y3 @ Y2))))))) @ Y0)))) @ sK5))) )),
% 0.20/0.40    inference(pi_clausification,[],[f37])).
% 0.20/0.40  thf(f37,plain,(
% 0.20/0.40    ( ! [X1 : $i] : (((?? @ $i @ (sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (sK0 @ Y0 @ Y2 @ Y1))))))) @ X1)) = $false) | ($true = (sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (sK0 @ Y0 @ Y2 @ Y1))))))) @ (eps @ (^[Y0 : $i]: (?? @ $i @ (sK0 @ (eps @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (sK0 @ Y1 @ Y3 @ Y2))))))) @ Y0)))) @ sK5))) )),
% 0.20/0.40    inference(sigma_clausification,[],[f36])).
% 0.20/0.40  thf(f36,plain,(
% 0.20/0.40    ( ! [X1 : $i] : (($true = (?? @ $i @ (sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (sK0 @ Y0 @ Y2 @ Y1))))))) @ (eps @ (^[Y0 : $i]: (?? @ $i @ (sK0 @ (eps @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (sK0 @ Y1 @ Y3 @ Y2))))))) @ Y0))))))) | ((?? @ $i @ (sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (sK0 @ Y0 @ Y2 @ Y1))))))) @ X1)) = $false)) )),
% 0.20/0.40    inference(beta_eta_normalization,[],[f34])).
% 0.20/0.40  thf(f34,plain,(
% 0.20/0.40    ( ! [X1 : $i] : ((((^[Y0 : $i]: (?? @ $i @ (sK0 @ (eps @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (sK0 @ Y1 @ Y3 @ Y2))))))) @ Y0))) @ (eps @ (^[Y0 : $i]: (?? @ $i @ (sK0 @ (eps @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (sK0 @ Y1 @ Y3 @ Y2))))))) @ Y0))))) = $true) | (((^[Y0 : $i]: (?? @ $i @ (sK0 @ (eps @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (sK0 @ Y1 @ Y3 @ Y2))))))) @ Y0))) @ X1) = $false)) )),
% 0.20/0.40    introduced(choice_axiom,[])).
% 0.20/0.40  thf(f47,plain,(
% 0.20/0.40    ( ! [X2 : $i,X3 : $i,X1 : $i] : (((sK0 @ X1 @ X3 @ X2) = $false) | ((sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (sK0 @ Y0 @ Y2 @ Y1))))))) @ sK7 @ sK6) = $true)) )),
% 0.20/0.40    inference(beta_eta_normalization,[],[f46])).
% 0.20/0.40  thf(f46,plain,(
% 0.20/0.40    ( ! [X2 : $i,X3 : $i,X1 : $i] : (((sK0 @ X1 @ X3 @ X2) = $false) | ($true = ((^[Y0 : $i]: (sK0 @ (eps @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (sK0 @ Y1 @ Y3 @ Y2))))))) @ Y0 @ sK6)) @ sK7))) )),
% 0.20/0.40    inference(sigma_clausification,[],[f45])).
% 0.20/0.40  thf(f45,plain,(
% 0.20/0.40    ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = (?? @ $i @ (^[Y0 : $i]: (sK0 @ (eps @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (sK0 @ Y1 @ Y3 @ Y2))))))) @ Y0 @ sK6)))) | ((sK0 @ X1 @ X3 @ X2) = $false)) )),
% 0.20/0.40    inference(beta_eta_normalization,[],[f44])).
% 0.20/0.40  thf(f44,plain,(
% 0.20/0.40    ( ! [X2 : $i,X3 : $i,X1 : $i] : (((sK0 @ X1 @ X3 @ X2) = $false) | ($true = ((^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (sK0 @ (eps @ (^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (?? @ $i @ (^[Y4 : $i]: (sK0 @ Y2 @ Y4 @ Y3))))))) @ Y1 @ Y0)))) @ sK6))) )),
% 0.20/0.40    inference(sigma_clausification,[],[f43])).
% 0.20/0.40  thf(f43,plain,(
% 0.20/0.40    ( ! [X2 : $i,X3 : $i,X1 : $i] : (((?? @ $i @ (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (sK0 @ (eps @ (^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (?? @ $i @ (^[Y4 : $i]: (sK0 @ Y2 @ Y4 @ Y3))))))) @ Y1 @ Y0))))) = $true) | ((sK0 @ X1 @ X3 @ X2) = $false)) )),
% 0.20/0.40    inference(beta_eta_normalization,[],[f42])).
% 0.20/0.40  thf(f42,plain,(
% 0.20/0.40    ( ! [X2 : $i,X3 : $i,X1 : $i] : (((?? @ $i @ (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (sK0 @ (eps @ (^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (?? @ $i @ (^[Y4 : $i]: (sK0 @ Y2 @ Y4 @ Y3))))))) @ Y1 @ Y0))))) = $true) | (((^[Y0 : $i]: (sK0 @ X1 @ Y0 @ X2)) @ X3) = $false)) )),
% 0.20/0.40    inference(pi_clausification,[],[f41])).
% 0.20/0.40  thf(f41,plain,(
% 0.20/0.40    ( ! [X2 : $i,X1 : $i] : (((?? @ $i @ (^[Y0 : $i]: (sK0 @ X1 @ Y0 @ X2))) = $false) | ((?? @ $i @ (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (sK0 @ (eps @ (^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (?? @ $i @ (^[Y4 : $i]: (sK0 @ Y2 @ Y4 @ Y3))))))) @ Y1 @ Y0))))) = $true)) )),
% 0.20/0.40    inference(beta_eta_normalization,[],[f40])).
% 0.20/0.40  thf(f40,plain,(
% 0.20/0.40    ( ! [X2 : $i,X1 : $i] : (((?? @ $i @ (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (sK0 @ (eps @ (^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (?? @ $i @ (^[Y4 : $i]: (sK0 @ Y2 @ Y4 @ Y3))))))) @ Y1 @ Y0))))) = $true) | (((^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (sK0 @ X1 @ Y1 @ Y0)))) @ X2) = $false)) )),
% 0.20/0.40    inference(pi_clausification,[],[f39])).
% 0.20/0.40  thf(f39,plain,(
% 0.20/0.40    ( ! [X1 : $i] : (((?? @ $i @ (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (sK0 @ X1 @ Y1 @ Y0))))) = $false) | ((?? @ $i @ (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (sK0 @ (eps @ (^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (?? @ $i @ (^[Y4 : $i]: (sK0 @ Y2 @ Y4 @ Y3))))))) @ Y1 @ Y0))))) = $true)) )),
% 0.20/0.40    inference(beta_eta_normalization,[],[f33])).
% 0.20/0.40  thf(f33,plain,(
% 0.20/0.40    ( ! [X1 : $i] : ((((^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (sK0 @ Y0 @ Y2 @ Y1)))))) @ (eps @ (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (sK0 @ Y0 @ Y2 @ Y1)))))))) = $true) | (((^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (sK0 @ Y0 @ Y2 @ Y1)))))) @ X1) = $false)) )),
% 0.20/0.40    introduced(choice_axiom,[])).
% 0.20/0.40  thf(f25,plain,(
% 0.20/0.40    ($true = (sK0 @ sK2 @ sK1 @ sK3))),
% 0.20/0.40    inference(cnf_transformation,[],[f22])).
% 0.20/0.40  % SZS output end Proof for theBenchmark
% 0.20/0.40  % (9240)------------------------------
% 0.20/0.40  % (9240)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40  % (9240)Termination reason: Refutation
% 0.20/0.40  
% 0.20/0.40  % (9240)Memory used [KB]: 1023
% 0.20/0.40  % (9240)Time elapsed: 0.008 s
% 0.20/0.40  % (9240)Instructions burned: 5 (million)
% 0.20/0.40  % (9240)------------------------------
% 0.20/0.40  % (9240)------------------------------
% 0.20/0.40  % (9227)Success in time 0.036 s
% 0.20/0.40  % Vampire---4.8 exiting
%------------------------------------------------------------------------------