TSTP Solution File: SEU525^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU525^1 : TPTP v8.2.0. Released v3.7.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 : n015.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 03:49:21 EDT 2024
% Result : Theorem 0.22s 0.42s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU525^1 : TPTP v8.2.0. Released v3.7.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.14/0.36 % Computer : n015.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 17:41:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_EQU_NAR problem
% 0.14/0.36 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.14/0.38 % (3580)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.38 % (3580)Instruction limit reached!
% 0.14/0.38 % (3580)------------------------------
% 0.14/0.38 % (3580)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (3580)Termination reason: Unknown
% 0.14/0.38 % (3580)Termination phase: shuffling
% 0.14/0.38
% 0.14/0.38 % (3580)Memory used [KB]: 1023
% 0.14/0.38 % (3580)Time elapsed: 0.003 s
% 0.14/0.38 % (3580)Instructions burned: 3 (million)
% 0.14/0.38 % (3580)------------------------------
% 0.14/0.38 % (3580)------------------------------
% 0.14/0.38 % (3577)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.38 % (3579)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.38 % (3581)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.38 % (3582)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 % (3583)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.38 % (3581)Instruction limit reached!
% 0.14/0.38 % (3581)------------------------------
% 0.14/0.38 % (3581)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (3581)Termination reason: Unknown
% 0.14/0.38 % (3581)Termination phase: shuffling
% 0.14/0.38
% 0.14/0.38 % (3581)Memory used [KB]: 1023
% 0.14/0.38 % (3584)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.38 % (3581)Time elapsed: 0.003 s
% 0.14/0.38 % (3581)Instructions burned: 2 (million)
% 0.14/0.38 % (3581)------------------------------
% 0.14/0.38 % (3581)------------------------------
% 0.14/0.39 % (3584)Instruction limit reached!
% 0.14/0.39 % (3584)------------------------------
% 0.14/0.39 % (3584)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (3584)Termination reason: Unknown
% 0.14/0.39 % (3584)Termination phase: shuffling
% 0.14/0.39
% 0.14/0.39 % (3584)Memory used [KB]: 1151
% 0.14/0.39 % (3584)Time elapsed: 0.004 s
% 0.14/0.39 % (3584)Instructions burned: 4 (million)
% 0.14/0.39 % (3584)------------------------------
% 0.14/0.39 % (3584)------------------------------
% 0.14/0.39 % (3578)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.39 % (3578)Instruction limit reached!
% 0.14/0.39 % (3578)------------------------------
% 0.14/0.39 % (3578)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (3578)Termination reason: Unknown
% 0.14/0.39 % (3578)Termination phase: shuffling
% 0.14/0.39
% 0.14/0.39 % (3578)Memory used [KB]: 1151
% 0.14/0.39 % (3578)Time elapsed: 0.005 s
% 0.14/0.39 % (3578)Instructions burned: 5 (million)
% 0.14/0.39 % (3578)------------------------------
% 0.14/0.39 % (3578)------------------------------
% 0.14/0.39 % (3585)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.14/0.39 % (3583)Instruction limit reached!
% 0.14/0.39 % (3583)------------------------------
% 0.14/0.39 % (3583)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (3583)Termination reason: Unknown
% 0.14/0.39 % (3583)Termination phase: Property scanning
% 0.14/0.39
% 0.14/0.39 % (3583)Memory used [KB]: 1535
% 0.14/0.39 % (3583)Time elapsed: 0.012 s
% 0.14/0.39 % (3583)Instructions burned: 18 (million)
% 0.14/0.39 % (3583)------------------------------
% 0.14/0.39 % (3583)------------------------------
% 0.14/0.40 % (3579)Instruction limit reached!
% 0.14/0.40 % (3579)------------------------------
% 0.14/0.40 % (3579)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (3579)Termination reason: Unknown
% 0.14/0.40 % (3579)Termination phase: Saturation
% 0.14/0.40
% 0.14/0.40 % (3579)Memory used [KB]: 5756
% 0.14/0.40 % (3579)Time elapsed: 0.016 s
% 0.14/0.40 % (3579)Instructions burned: 28 (million)
% 0.14/0.40 % (3579)------------------------------
% 0.14/0.40 % (3579)------------------------------
% 0.14/0.40 % (3586)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.40 % (3587)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.40 % (3587)Instruction limit reached!
% 0.14/0.40 % (3587)------------------------------
% 0.14/0.40 % (3587)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (3587)Termination reason: Unknown
% 0.14/0.40 % (3587)Termination phase: shuffling
% 0.14/0.40
% 0.14/0.40 % (3587)Memory used [KB]: 1151
% 0.14/0.40 % (3587)Time elapsed: 0.004 s
% 0.14/0.40 % (3587)Instructions burned: 4 (million)
% 0.14/0.40 % (3587)------------------------------
% 0.14/0.40 % (3587)------------------------------
% 0.14/0.40 % (3588)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 % (3585)Instruction limit reached!
% 0.22/0.41 % (3585)------------------------------
% 0.22/0.41 % (3585)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.41 % (3586)Instruction limit reached!
% 0.22/0.41 % (3586)------------------------------
% 0.22/0.41 % (3586)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.41 % (3585)Termination reason: Unknown
% 0.22/0.41 % (3585)Termination phase: Saturation
% 0.22/0.41
% 0.22/0.41 % (3585)Memory used [KB]: 6012
% 0.22/0.41 % (3585)Time elapsed: 0.015 s
% 0.22/0.41 % (3585)Instructions burned: 37 (million)
% 0.22/0.41 % (3585)------------------------------
% 0.22/0.41 % (3585)------------------------------
% 0.22/0.41 % (3586)Termination reason: Unknown
% 0.22/0.41 % (3586)Termination phase: Preprocessing 3
% 0.22/0.41
% 0.22/0.41 % (3586)Memory used [KB]: 1407
% 0.22/0.41 % (3586)Time elapsed: 0.011 s
% 0.22/0.41 % (3586)Instructions burned: 15 (million)
% 0.22/0.41 % (3586)------------------------------
% 0.22/0.41 % (3586)------------------------------
% 0.22/0.41 % (3589)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 % (3591)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.41 % (3589)Instruction limit reached!
% 0.22/0.41 % (3589)------------------------------
% 0.22/0.41 % (3589)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.41 % (3589)Termination reason: Unknown
% 0.22/0.41 % (3589)Termination phase: Property scanning
% 0.22/0.41
% 0.22/0.41 % (3589)Memory used [KB]: 1151
% 0.22/0.41 % (3589)Time elapsed: 0.006 s
% 0.22/0.41 % (3589)Instructions burned: 8 (million)
% 0.22/0.41 % (3589)------------------------------
% 0.22/0.41 % (3589)------------------------------
% 0.22/0.42 % (3592)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 % (3577)First to succeed.
% 0.22/0.42 % (3593)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 % (3592)Instruction limit reached!
% 0.22/0.42 % (3592)------------------------------
% 0.22/0.42 % (3592)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.42 % (3592)Termination reason: Unknown
% 0.22/0.42 % (3591)Instruction limit reached!
% 0.22/0.42 % (3591)------------------------------
% 0.22/0.42 % (3591)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.42 % (3592)Termination phase: shuffling
% 0.22/0.42
% 0.22/0.42 % (3592)Memory used [KB]: 1151
% 0.22/0.42 % (3592)Time elapsed: 0.004 s
% 0.22/0.42 % (3592)Instructions burned: 4 (million)
% 0.22/0.42 % (3592)------------------------------
% 0.22/0.42 % (3592)------------------------------
% 0.22/0.42 % (3591)Termination reason: Unknown
% 0.22/0.42 % (3591)Termination phase: Function definition elimination
% 0.22/0.42
% 0.22/0.42 % (3591)Memory used [KB]: 1151
% 0.22/0.42 % (3591)Time elapsed: 0.010 s
% 0.22/0.42 % (3591)Instructions burned: 16 (million)
% 0.22/0.42 % (3591)------------------------------
% 0.22/0.42 % (3591)------------------------------
% 0.22/0.42 % (3593)Instruction limit reached!
% 0.22/0.42 % (3593)------------------------------
% 0.22/0.42 % (3593)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.42 % (3593)Termination reason: Unknown
% 0.22/0.42 % (3593)Termination phase: shuffling
% 0.22/0.42
% 0.22/0.42 % (3593)Memory used [KB]: 1151
% 0.22/0.42 % (3593)Time elapsed: 0.003 s
% 0.22/0.42 % (3593)Instructions burned: 4 (million)
% 0.22/0.42 % (3593)------------------------------
% 0.22/0.42 % (3593)------------------------------
% 0.22/0.42 % (3577)Refutation found. Thanks to Tanya!
% 0.22/0.42 % SZS status Theorem for theBenchmark
% 0.22/0.42 % SZS output start Proof for theBenchmark
% 0.22/0.42 thf(func_def_0, type, in: $i > $i > $o).
% 0.22/0.42 thf(func_def_1, type, exu: ($i > $o) > $o).
% 0.22/0.42 thf(func_def_6, type, setadjoin: $i > $i > $i).
% 0.22/0.42 thf(func_def_8, type, powerset: $i > $i).
% 0.22/0.42 thf(func_def_10, type, setunion: $i > $i).
% 0.22/0.42 thf(func_def_19, type, descr: ($i > $o) > $i).
% 0.22/0.42 thf(func_def_21, type, dsetconstr: $i > ($i > $o) > $i).
% 0.22/0.42 thf(func_def_26, type, prop2set: $o > $i).
% 0.22/0.42 thf(func_def_36, type, nonempty: $i > $o).
% 0.22/0.42 thf(func_def_69, type, sK0: $i > $o).
% 0.22/0.42 thf(func_def_70, type, sK1: $i > $i).
% 0.22/0.42 thf(func_def_72, type, sK3: $i > $i).
% 0.22/0.42 thf(func_def_73, type, sK4: $i > $i > $i).
% 0.22/0.42 thf(func_def_74, type, sK5: $i > $i > $i).
% 0.22/0.42 thf(func_def_76, type, sK6: ($i > $i > $o) > $i > $i).
% 0.22/0.42 thf(func_def_77, type, sK7: ($i > $i > $o) > $i > $i).
% 0.22/0.42 thf(func_def_78, type, sK8: ($i > $i > $o) > $i > $i > $i).
% 0.22/0.42 thf(func_def_79, type, sK9: $i > ($i > $i > $o) > $i > $i).
% 0.22/0.42 thf(func_def_80, type, sK10: $i > ($i > $i > $o) > $i > $i).
% 0.22/0.42 thf(func_def_81, type, sK11: $i > $i).
% 0.22/0.42 thf(func_def_82, type, sK12: $i > $i > $i).
% 0.22/0.42 thf(func_def_83, type, sK13: $i > $i > $i).
% 0.22/0.42 thf(func_def_84, type, sK14: $i > $i > $i).
% 0.22/0.42 thf(func_def_86, type, sK16: ($i > $o) > $i).
% 0.22/0.42 thf(func_def_87, type, sK17: ($i > $o) > $i > $i).
% 0.22/0.42 thf(func_def_88, type, sK18: $i > $i).
% 0.22/0.42 thf(func_def_89, type, sK19: $i > $i).
% 0.22/0.42 thf(func_def_90, type, sK20: $i > $i).
% 0.22/0.42 thf(func_def_91, type, sK21: $i > $i > $i).
% 0.22/0.42 thf(func_def_92, type, sK22: $i > $i).
% 0.22/0.42 thf(func_def_93, type, sK23: $i > $i > $i > $i).
% 0.22/0.42 thf(func_def_94, type, sK24: $i > $i > $i).
% 0.22/0.42 thf(func_def_95, type, sK25: $i > $i > $i).
% 0.22/0.42 thf(func_def_96, type, sK26: $i > $i > $i).
% 0.22/0.42 thf(func_def_97, type, sK27: $i > $i > $i).
% 0.22/0.42 thf(func_def_98, type, sK28: $o > $i > $i > $i).
% 0.22/0.42 thf(func_def_99, type, sK29: ($i > $o) > $i > $i).
% 0.22/0.42 thf(f798,plain,(
% 0.22/0.42 $false),
% 0.22/0.42 inference(trivial_inequality_removal,[],[f794])).
% 0.22/0.42 thf(f794,plain,(
% 0.22/0.42 (sK15 != sK15) | ($true != $true)),
% 0.22/0.42 inference(superposition,[],[f793,f467])).
% 0.22/0.42 thf(f467,plain,(
% 0.22/0.42 ($true = (sK0 @ sK15))),
% 0.22/0.42 inference(binary_proxy_clausification,[],[f465])).
% 0.22/0.42 thf(f465,plain,(
% 0.22/0.42 ($true = ((sK0 @ sK15) & (!! @ $i @ (^[Y0 : $i]: ((sK0 @ Y0) => (sK15 = Y0))))))),
% 0.22/0.42 inference(beta_eta_normalization,[],[f464])).
% 0.22/0.42 thf(f464,plain,(
% 0.22/0.42 ($true = ((^[Y0 : $i]: ((sK0 @ Y0) & (!! @ $i @ (^[Y1 : $i]: ((sK0 @ Y1) => (Y0 = Y1)))))) @ sK15))),
% 0.22/0.42 inference(sigma_clausification,[],[f463])).
% 0.22/0.42 thf(f463,plain,(
% 0.22/0.42 ($true = (?? @ $i @ (^[Y0 : $i]: ((sK0 @ Y0) & (!! @ $i @ (^[Y1 : $i]: ((sK0 @ Y1) => (Y0 = Y1))))))))),
% 0.22/0.42 inference(beta_eta_normalization,[],[f254])).
% 0.22/0.42 thf(f254,plain,(
% 0.22/0.42 ($true = ((^[Y0 : $i > $o]: (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2)))))))) @ (^[Y0 : $i]: (sK0 @ Y0))))),
% 0.22/0.42 inference(definition_unfolding,[],[f179,f158])).
% 0.22/0.42 thf(f158,plain,(
% 0.22/0.42 (exu = (^[Y0 : $i > $o]: (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2)))))))))),
% 0.22/0.42 inference(cnf_transformation,[],[f59])).
% 0.22/0.42 thf(f59,plain,(
% 0.22/0.42 (exu = (^[Y0 : $i > $o]: (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2)))))))))),
% 0.22/0.42 inference(fool_elimination,[],[f58])).
% 0.22/0.42 thf(f58,plain,(
% 0.22/0.42 (exu = (^[X0 : $i > $o] : (? [X1] : (! [X2] : ((X0 @ X2) => (X1 = X2)) & (X0 @ X1)))))),
% 0.22/0.42 inference(rectify,[],[f1])).
% 0.22/0.42 thf(f1,axiom,(
% 0.22/0.42 (exu = (^[X0 : $i > $o] : (? [X1] : (! [X2] : ((X0 @ X2) => (X1 = X2)) & (X0 @ X1)))))),
% 0.22/0.42 file('/export/starexec/sandbox/benchmark/theBenchmark.p',exu)).
% 0.22/0.42 thf(f179,plain,(
% 0.22/0.42 ($true = (exu @ (^[Y0 : $i]: (sK0 @ Y0))))),
% 0.22/0.42 inference(cnf_transformation,[],[f139])).
% 0.22/0.42 thf(f139,plain,(
% 0.22/0.42 (omegaSAx = $true) & (setadjoinIR = $true) & (noeltsimpempty = $true) & (dsetconstrER = $true) & (wellorderingAx = $true) & (notinemptyset = $true) & (emptyInPowerset = $true) & (omega0Ax = $true) & (setextAx = $true) & (foundationAx = $true) & (exuE1 = $true) & (powersetI = $true) & (dsetconstrI = $true) & (prop2setE = $true) & (emptysetAx = $true) & (setbeta = $true) & (setadjoinIL = $true) & (powersetAx = $true) & (setadjoinE = $true) & (dsetconstrEL = $true) & (nonemptyI1 = $true) & (emptyinPowerset = $true) & (setunionAx = $true) & (setext = $true) & (emptyI = $true) & (setunionE = $true) & (replAx = $true) & (emptyinunitempty = $true) & (nonemptyI = $true) & (setunionI = $true) & (nonemptyE1 = $true) & (descrp = $true) & (emptysetE = $true) & (($true = (exu @ (^[Y0 : $i]: (sK0 @ Y0)))) & ! [X1] : ((($true != (sK0 @ (sK1 @ X1))) | ((sK1 @ X1) != X1)) & (($true = (sK0 @ (sK1 @ X1))) | ((sK1 @ X1) = X1)))) & (subPowSU = $true) & (setadjoinAx = $true) & (setoftrueEq = $true) & (omegaIndAx = $true) & (exuE3e = $true) & (emptysetimpfalse = $true) & (powersetE = $true) & (setadjoinOr = $true)),
% 0.22/0.42 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f136,f138,f137])).
% 0.22/0.42 thf(f137,plain,(
% 0.22/0.42 ? [X0 : $i > $o] : (($true = (exu @ (^[Y0 : $i]: (X0 @ Y0)))) & ! [X1] : ? [X2] : ((((X0 @ X2) != $true) | (X1 != X2)) & (((X0 @ X2) = $true) | (X1 = X2)))) => (($true = (exu @ (^[Y0 : $i]: (sK0 @ Y0)))) & ! [X1] : ? [X2] : ((((sK0 @ X2) != $true) | (X1 != X2)) & (((sK0 @ X2) = $true) | (X1 = X2))))),
% 0.22/0.42 introduced(choice_axiom,[])).
% 0.22/0.42 thf(f138,plain,(
% 0.22/0.42 ! [X1] : (? [X2] : ((((sK0 @ X2) != $true) | (X1 != X2)) & (((sK0 @ X2) = $true) | (X1 = X2))) => ((($true != (sK0 @ (sK1 @ X1))) | ((sK1 @ X1) != X1)) & (($true = (sK0 @ (sK1 @ X1))) | ((sK1 @ X1) = X1))))),
% 0.22/0.42 introduced(choice_axiom,[])).
% 0.22/0.42 thf(f136,plain,(
% 0.22/0.42 (omegaSAx = $true) & (setadjoinIR = $true) & (noeltsimpempty = $true) & (dsetconstrER = $true) & (wellorderingAx = $true) & (notinemptyset = $true) & (emptyInPowerset = $true) & (omega0Ax = $true) & (setextAx = $true) & (foundationAx = $true) & (exuE1 = $true) & (powersetI = $true) & (dsetconstrI = $true) & (prop2setE = $true) & (emptysetAx = $true) & (setbeta = $true) & (setadjoinIL = $true) & (powersetAx = $true) & (setadjoinE = $true) & (dsetconstrEL = $true) & (nonemptyI1 = $true) & (emptyinPowerset = $true) & (setunionAx = $true) & (setext = $true) & (emptyI = $true) & (setunionE = $true) & (replAx = $true) & (emptyinunitempty = $true) & (nonemptyI = $true) & (setunionI = $true) & (nonemptyE1 = $true) & (descrp = $true) & (emptysetE = $true) & ? [X0 : $i > $o] : (($true = (exu @ (^[Y0 : $i]: (X0 @ Y0)))) & ! [X1] : ? [X2] : ((((X0 @ X2) != $true) | (X1 != X2)) & (((X0 @ X2) = $true) | (X1 = X2)))) & (subPowSU = $true) & (setadjoinAx = $true) & (setoftrueEq = $true) & (omegaIndAx = $true) & (exuE3e = $true) & (emptysetimpfalse = $true) & (powersetE = $true) & (setadjoinOr = $true)),
% 0.22/0.42 inference(nnf_transformation,[],[f135])).
% 0.22/0.42 thf(f135,plain,(
% 0.22/0.42 (omegaSAx = $true) & (setadjoinIR = $true) & (noeltsimpempty = $true) & (dsetconstrER = $true) & (wellorderingAx = $true) & (notinemptyset = $true) & (emptyInPowerset = $true) & (omega0Ax = $true) & (setextAx = $true) & (foundationAx = $true) & (exuE1 = $true) & (powersetI = $true) & (dsetconstrI = $true) & (prop2setE = $true) & (emptysetAx = $true) & (setbeta = $true) & (setadjoinIL = $true) & (powersetAx = $true) & (setadjoinE = $true) & (dsetconstrEL = $true) & (nonemptyI1 = $true) & (emptyinPowerset = $true) & (setunionAx = $true) & (setext = $true) & (emptyI = $true) & (setunionE = $true) & (replAx = $true) & (emptyinunitempty = $true) & (nonemptyI = $true) & (setunionI = $true) & (nonemptyE1 = $true) & (descrp = $true) & (emptysetE = $true) & ? [X0 : $i > $o] : (($true = (exu @ (^[Y0 : $i]: (X0 @ Y0)))) & ! [X1] : ? [X2] : ((X1 = X2) <~> ((X0 @ X2) = $true))) & (subPowSU = $true) & (setadjoinAx = $true) & (setoftrueEq = $true) & (omegaIndAx = $true) & (exuE3e = $true) & (emptysetimpfalse = $true) & (powersetE = $true) & (setadjoinOr = $true)),
% 0.22/0.42 inference(flattening,[],[f134])).
% 0.22/0.42 thf(f134,plain,(
% 0.22/0.42 ((((((((((((((((((((((((((((((((((((((((? [X0 : $i > $o] : (($true = (exu @ (^[Y0 : $i]: (X0 @ Y0)))) & ! [X1] : ? [X2] : ((X1 = X2) <~> ((X0 @ X2) = $true))) & (subPowSU = $true)) & (setunionE = $true)) & (setunionI = $true)) & (powersetE = $true)) & (emptyInPowerset = $true)) & (emptyinPowerset = $true)) & (powersetI = $true)) & (setoftrueEq = $true)) & (setadjoinOr = $true)) & (setadjoinE = $true)) & (setadjoinIR = $true)) & (emptyinunitempty = $true)) & (setadjoinIL = $true)) & (nonemptyI1 = $true)) & (nonemptyI = $true)) & (nonemptyE1 = $true)) & (setbeta = $true)) & (noeltsimpempty = $true)) & (emptyI = $true)) & (setext = $true)) & (exuE3e = $true)) & (notinemptyset = $true)) & (emptysetimpfalse = $true)) & (emptysetE = $true)) & (prop2setE = $true)) & (exuE1 = $true)) & (dsetconstrER = $true)) & (dsetconstrEL = $true)) & (dsetconstrI = $true)) & (descrp = $true)) & (wellorderingAx = $true)) & (foundationAx = $true)) & (replAx = $true)) & (omegaIndAx = $true)) & (omegaSAx = $true)) & (omega0Ax = $true)) & (setunionAx = $true)) & (powersetAx = $true)) & (setadjoinAx = $true)) & (emptysetAx = $true)) & (setextAx = $true)),
% 0.22/0.42 inference(ennf_transformation,[],[f133])).
% 0.22/0.42 thf(f133,plain,(
% 0.22/0.42 ~((setextAx = $true) => ((emptysetAx = $true) => ((setadjoinAx = $true) => ((powersetAx = $true) => ((setunionAx = $true) => ((omega0Ax = $true) => ((omegaSAx = $true) => ((omegaIndAx = $true) => ((replAx = $true) => ((foundationAx = $true) => ((wellorderingAx = $true) => ((descrp = $true) => ((dsetconstrI = $true) => ((dsetconstrEL = $true) => ((dsetconstrER = $true) => ((exuE1 = $true) => ((prop2setE = $true) => ((emptysetE = $true) => ((emptysetimpfalse = $true) => ((notinemptyset = $true) => ((exuE3e = $true) => ((setext = $true) => ((emptyI = $true) => ((noeltsimpempty = $true) => ((setbeta = $true) => ((nonemptyE1 = $true) => ((nonemptyI = $true) => ((nonemptyI1 = $true) => ((setadjoinIL = $true) => ((emptyinunitempty = $true) => ((setadjoinIR = $true) => ((setadjoinE = $true) => ((setadjoinOr = $true) => ((setoftrueEq = $true) => ((powersetI = $true) => ((emptyinPowerset = $true) => ((emptyInPowerset = $true) => ((powersetE = $true) => ((setunionI = $true) => ((setunionE = $true) => ((subPowSU = $true) => ! [X0 : $i > $o] : (($true = (exu @ (^[Y0 : $i]: (X0 @ Y0)))) => ? [X1] : ! [X2] : (((X0 @ X2) = $true) <=> (X1 = X2))))))))))))))))))))))))))))))))))))))))))))),
% 0.22/0.42 inference(rectify,[],[f101])).
% 0.22/0.42 thf(f101,plain,(
% 0.22/0.42 ~((setextAx = $true) => ((emptysetAx = $true) => ((setadjoinAx = $true) => ((powersetAx = $true) => ((setunionAx = $true) => ((omega0Ax = $true) => ((omegaSAx = $true) => ((omegaIndAx = $true) => ((replAx = $true) => ((foundationAx = $true) => ((wellorderingAx = $true) => ((descrp = $true) => ((dsetconstrI = $true) => ((dsetconstrEL = $true) => ((dsetconstrER = $true) => ((exuE1 = $true) => ((prop2setE = $true) => ((emptysetE = $true) => ((emptysetimpfalse = $true) => ((notinemptyset = $true) => ((exuE3e = $true) => ((setext = $true) => ((emptyI = $true) => ((noeltsimpempty = $true) => ((setbeta = $true) => ((nonemptyE1 = $true) => ((nonemptyI = $true) => ((nonemptyI1 = $true) => ((setadjoinIL = $true) => ((emptyinunitempty = $true) => ((setadjoinIR = $true) => ((setadjoinE = $true) => ((setadjoinOr = $true) => ((setoftrueEq = $true) => ((powersetI = $true) => ((emptyinPowerset = $true) => ((emptyInPowerset = $true) => ((powersetE = $true) => ((setunionI = $true) => ((setunionE = $true) => ((subPowSU = $true) => ! [X0 : $i > $o] : (($true = (exu @ (^[Y0 : $i]: (X0 @ Y0)))) => ? [X2] : ! [X3] : ((X2 = X3) <=> ((X0 @ X3) = $true))))))))))))))))))))))))))))))))))))))))))))),
% 0.22/0.42 inference(fool_elimination,[],[f100])).
% 0.22/0.42 thf(f100,plain,(
% 0.22/0.42 ~(setextAx => (emptysetAx => (setadjoinAx => (powersetAx => (setunionAx => (omega0Ax => (omegaSAx => (omegaIndAx => (replAx => (foundationAx => (wellorderingAx => (descrp => (dsetconstrI => (dsetconstrEL => (dsetconstrER => (exuE1 => (prop2setE => (emptysetE => (emptysetimpfalse => (notinemptyset => (exuE3e => (setext => (emptyI => (noeltsimpempty => (setbeta => (nonemptyE1 => (nonemptyI => (nonemptyI1 => (setadjoinIL => (emptyinunitempty => (setadjoinIR => (setadjoinE => (setadjoinOr => (setoftrueEq => (powersetI => (emptyinPowerset => (emptyInPowerset => (powersetE => (setunionI => (setunionE => (subPowSU => ! [X0 : $i > $o] : ((exu @ (^[X1 : $i] : (X0 @ X1))) => ? [X2] : ! [X3] : ((X2 = X3) <=> (X0 @ X3))))))))))))))))))))))))))))))))))))))))))))),
% 0.22/0.42 inference(rectify,[],[f46])).
% 0.22/0.42 thf(f46,negated_conjecture,(
% 0.22/0.42 ~(setextAx => (emptysetAx => (setadjoinAx => (powersetAx => (setunionAx => (omega0Ax => (omegaSAx => (omegaIndAx => (replAx => (foundationAx => (wellorderingAx => (descrp => (dsetconstrI => (dsetconstrEL => (dsetconstrER => (exuE1 => (prop2setE => (emptysetE => (emptysetimpfalse => (notinemptyset => (exuE3e => (setext => (emptyI => (noeltsimpempty => (setbeta => (nonemptyE1 => (nonemptyI => (nonemptyI1 => (setadjoinIL => (emptyinunitempty => (setadjoinIR => (setadjoinE => (setadjoinOr => (setoftrueEq => (powersetI => (emptyinPowerset => (emptyInPowerset => (powersetE => (setunionI => (setunionE => (subPowSU => ! [X0 : $i > $o] : ((exu @ (^[X1 : $i] : (X0 @ X1))) => ? [X1] : ! [X2] : ((X1 = X2) <=> (X0 @ X2))))))))))))))))))))))))))))))))))))))))))))),
% 0.22/0.42 inference(negated_conjecture,[],[f45])).
% 0.22/0.42 thf(f45,conjecture,(
% 0.22/0.42 setextAx => (emptysetAx => (setadjoinAx => (powersetAx => (setunionAx => (omega0Ax => (omegaSAx => (omegaIndAx => (replAx => (foundationAx => (wellorderingAx => (descrp => (dsetconstrI => (dsetconstrEL => (dsetconstrER => (exuE1 => (prop2setE => (emptysetE => (emptysetimpfalse => (notinemptyset => (exuE3e => (setext => (emptyI => (noeltsimpempty => (setbeta => (nonemptyE1 => (nonemptyI => (nonemptyI1 => (setadjoinIL => (emptyinunitempty => (setadjoinIR => (setadjoinE => (setadjoinOr => (setoftrueEq => (powersetI => (emptyinPowerset => (emptyInPowerset => (powersetE => (setunionI => (setunionE => (subPowSU => ! [X0 : $i > $o] : ((exu @ (^[X1 : $i] : (X0 @ X1))) => ? [X1] : ! [X2] : ((X1 = X2) <=> (X0 @ X2)))))))))))))))))))))))))))))))))))))))))))),
% 0.22/0.42 file('/export/starexec/sandbox/benchmark/theBenchmark.p',exuE2)).
% 0.22/0.42 thf(f793,plain,(
% 0.22/0.42 ( ! [X0 : $i] : (((sK0 @ X0) != $true) | (sK15 != X0)) )),
% 0.22/0.42 inference(trivial_inequality_removal,[],[f789])).
% 0.22/0.42 thf(f789,plain,(
% 0.22/0.42 ( ! [X0 : $i] : ((sK15 != X0) | ((sK0 @ X0) != $true) | (X0 != X0)) )),
% 0.22/0.42 inference(superposition,[],[f178,f785])).
% 0.22/0.42 thf(f785,plain,(
% 0.22/0.42 ( ! [X0 : $i] : (((sK1 @ X0) = X0) | (sK15 != X0)) )),
% 0.22/0.42 inference(equality_factoring,[],[f783])).
% 0.22/0.42 thf(f783,plain,(
% 0.22/0.42 ( ! [X0 : $i] : ((sK15 = (sK1 @ X0)) | ((sK1 @ X0) = X0)) )),
% 0.22/0.42 inference(trivial_inequality_removal,[],[f781])).
% 0.22/0.42 thf(f781,plain,(
% 0.22/0.42 ( ! [X0 : $i] : (((sK1 @ X0) = X0) | (sK15 = (sK1 @ X0)) | ($true = $false)) )),
% 0.22/0.42 inference(superposition,[],[f471,f177])).
% 0.22/0.42 thf(f177,plain,(
% 0.22/0.42 ( ! [X1 : $i] : (($true = (sK0 @ (sK1 @ X1))) | ((sK1 @ X1) = X1)) )),
% 0.22/0.42 inference(cnf_transformation,[],[f139])).
% 0.22/0.42 thf(f471,plain,(
% 0.22/0.42 ( ! [X1 : $i] : (((sK0 @ X1) = $false) | (sK15 = X1)) )),
% 0.22/0.42 inference(equality_proxy_clausification,[],[f470])).
% 0.22/0.42 thf(f470,plain,(
% 0.22/0.42 ( ! [X1 : $i] : (((sK0 @ X1) = $false) | ($true = (sK15 = X1))) )),
% 0.22/0.42 inference(binary_proxy_clausification,[],[f469])).
% 0.22/0.42 thf(f469,plain,(
% 0.22/0.42 ( ! [X1 : $i] : (($true = ((sK0 @ X1) => (sK15 = X1)))) )),
% 0.22/0.42 inference(beta_eta_normalization,[],[f468])).
% 0.22/0.42 thf(f468,plain,(
% 0.22/0.42 ( ! [X1 : $i] : ((((^[Y0 : $i]: ((sK0 @ Y0) => (sK15 = Y0))) @ X1) = $true)) )),
% 0.22/0.42 inference(pi_clausification,[],[f466])).
% 0.22/0.42 thf(f466,plain,(
% 0.22/0.42 ($true = (!! @ $i @ (^[Y0 : $i]: ((sK0 @ Y0) => (sK15 = Y0)))))),
% 0.22/0.42 inference(binary_proxy_clausification,[],[f465])).
% 0.22/0.42 thf(f178,plain,(
% 0.22/0.42 ( ! [X1 : $i] : (($true != (sK0 @ (sK1 @ X1))) | ((sK1 @ X1) != X1)) )),
% 0.22/0.42 inference(cnf_transformation,[],[f139])).
% 0.22/0.42 % SZS output end Proof for theBenchmark
% 0.22/0.42 % (3577)------------------------------
% 0.22/0.42 % (3577)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.42 % (3577)Termination reason: Refutation
% 0.22/0.42
% 0.22/0.42 % (3577)Memory used [KB]: 6140
% 0.22/0.42 % (3577)Time elapsed: 0.040 s
% 0.22/0.42 % (3577)Instructions burned: 65 (million)
% 0.22/0.42 % (3577)------------------------------
% 0.22/0.42 % (3577)------------------------------
% 0.22/0.42 % (3576)Success in time 0.038 s
% 0.22/0.42 % Vampire---4.8 exiting
%------------------------------------------------------------------------------