TSTP Solution File: AGT028^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : AGT028^2 : 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 : n016.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 : Mon May 20 17:58:46 EDT 2024
% Result : Theorem 0.13s 0.41s
% Output : Refutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : AGT028^2 : TPTP v8.2.0. Released v5.2.0.
% 0.11/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.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 18:55:37 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 % (1609)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 % (1614)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.13/0.37 % (1610)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.13/0.37 % (1611)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.37 % (1612)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.13/0.37 % (1613)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 % (1615)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.13/0.37 % (1608)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 % (1611)Instruction limit reached!
% 0.13/0.37 % (1611)------------------------------
% 0.13/0.37 % (1611)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (1611)Termination reason: Unknown
% 0.13/0.37 % (1611)Termination phase: shuffling
% 0.13/0.37 % (1612)Instruction limit reached!
% 0.13/0.37 % (1612)------------------------------
% 0.13/0.37 % (1612)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (1612)Termination reason: Unknown
% 0.13/0.37 % (1612)Termination phase: shuffling
% 0.13/0.37
% 0.13/0.37 % (1612)Memory used [KB]: 1023
% 0.13/0.37 % (1612)Time elapsed: 0.003 s
% 0.13/0.37 % (1612)Instructions burned: 3 (million)
% 0.13/0.37 % (1612)------------------------------
% 0.13/0.37 % (1612)------------------------------
% 0.13/0.37
% 0.13/0.37 % (1611)Memory used [KB]: 1023
% 0.13/0.37 % (1611)Time elapsed: 0.003 s
% 0.13/0.37 % (1611)Instructions burned: 2 (million)
% 0.13/0.37 % (1611)------------------------------
% 0.13/0.37 % (1611)------------------------------
% 0.13/0.37 % (1615)Instruction limit reached!
% 0.13/0.37 % (1615)------------------------------
% 0.13/0.37 % (1615)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (1615)Termination reason: Unknown
% 0.13/0.37 % (1615)Termination phase: shuffling
% 0.13/0.37
% 0.13/0.37 % (1615)Memory used [KB]: 1023
% 0.13/0.37 % (1615)Time elapsed: 0.004 s
% 0.13/0.37 % (1615)Instructions burned: 3 (million)
% 0.13/0.37 % (1615)------------------------------
% 0.13/0.37 % (1615)------------------------------
% 0.13/0.37 % (1609)Instruction limit reached!
% 0.13/0.37 % (1609)------------------------------
% 0.13/0.37 % (1609)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (1609)Termination reason: Unknown
% 0.13/0.37 % (1609)Termination phase: shuffling
% 0.13/0.37
% 0.13/0.37 % (1609)Memory used [KB]: 1023
% 0.13/0.37 % (1609)Time elapsed: 0.004 s
% 0.13/0.37 % (1609)Instructions burned: 4 (million)
% 0.13/0.37 % (1609)------------------------------
% 0.13/0.37 % (1609)------------------------------
% 0.13/0.38 % (1613)Refutation not found, incomplete strategy
% 0.13/0.38 % (1613)------------------------------
% 0.13/0.38 % (1613)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (1613)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 % (1613)Memory used [KB]: 5628
% 0.13/0.38 % (1613)Time elapsed: 0.009 s
% 0.13/0.38 % (1613)Instructions burned: 12 (million)
% 0.13/0.38 % (1613)------------------------------
% 0.13/0.38 % (1613)------------------------------
% 0.13/0.38 % (1614)Instruction limit reached!
% 0.13/0.38 % (1614)------------------------------
% 0.13/0.38 % (1614)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (1614)Termination reason: Unknown
% 0.13/0.38 % (1614)Termination phase: Property scanning
% 0.13/0.38
% 0.13/0.38 % (1614)Memory used [KB]: 1151
% 0.13/0.38 % (1614)Time elapsed: 0.011 s
% 0.13/0.38 % (1614)Instructions burned: 19 (million)
% 0.13/0.38 % (1614)------------------------------
% 0.13/0.38 % (1614)------------------------------
% 0.13/0.39 % (1610)Instruction limit reached!
% 0.13/0.39 % (1610)------------------------------
% 0.13/0.39 % (1610)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.39 % (1610)Termination reason: Unknown
% 0.13/0.39 % (1610)Termination phase: Saturation
% 0.13/0.39
% 0.13/0.39 % (1610)Memory used [KB]: 5756
% 0.13/0.39 % (1610)Time elapsed: 0.015 s
% 0.13/0.39 % (1610)Instructions burned: 28 (million)
% 0.13/0.39 % (1610)------------------------------
% 0.13/0.39 % (1610)------------------------------
% 0.13/0.39 % (1619)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.13/0.39 % (1617)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.13/0.39 % (1618)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.13/0.39 % (1616)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.13/0.39 % (1618)Instruction limit reached!
% 0.13/0.39 % (1618)------------------------------
% 0.13/0.39 % (1618)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.39 % (1618)Termination reason: Unknown
% 0.13/0.39 % (1618)Termination phase: shuffling
% 0.13/0.39
% 0.13/0.39 % (1618)Memory used [KB]: 1023
% 0.13/0.39 % (1618)Time elapsed: 0.003 s
% 0.13/0.39 % (1618)Instructions burned: 3 (million)
% 0.13/0.39 % (1618)------------------------------
% 0.13/0.39 % (1618)------------------------------
% 0.13/0.40 % (1617)Instruction limit reached!
% 0.13/0.40 % (1617)------------------------------
% 0.13/0.40 % (1617)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.40 % (1617)Termination reason: Unknown
% 0.13/0.40 % (1617)Termination phase: Property scanning
% 0.13/0.40
% 0.13/0.40 % (1617)Memory used [KB]: 1151
% 0.13/0.40 % (1617)Time elapsed: 0.009 s
% 0.13/0.40 % (1617)Instructions burned: 16 (million)
% 0.13/0.40 % (1617)------------------------------
% 0.13/0.40 % (1617)------------------------------
% 0.13/0.40 % (1620)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.13/0.40 % (1621)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.13/0.40 % (1620)Instruction limit reached!
% 0.13/0.40 % (1620)------------------------------
% 0.13/0.40 % (1620)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.40 % (1620)Termination reason: Unknown
% 0.13/0.40 % (1620)Termination phase: Property scanning
% 0.13/0.40
% 0.13/0.40 % (1620)Memory used [KB]: 1151
% 0.13/0.40 % (1620)Time elapsed: 0.005 s
% 0.13/0.40 % (1620)Instructions burned: 7 (million)
% 0.13/0.40 % (1620)------------------------------
% 0.13/0.40 % (1620)------------------------------
% 0.13/0.40 % (1622)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.13/0.40 % (1622)Instruction limit reached!
% 0.13/0.40 % (1622)------------------------------
% 0.13/0.40 % (1622)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.40 % (1622)Termination reason: Unknown
% 0.13/0.40 % (1622)Termination phase: shuffling
% 0.13/0.40
% 0.13/0.40 % (1622)Memory used [KB]: 1151
% 0.13/0.40 % (1622)Time elapsed: 0.004 s
% 0.13/0.40 % (1622)Instructions burned: 5 (million)
% 0.13/0.40 % (1622)------------------------------
% 0.13/0.40 % (1622)------------------------------
% 0.13/0.40 % (1608)First to succeed.
% 0.13/0.40 % (1621)Instruction limit reached!
% 0.13/0.40 % (1621)------------------------------
% 0.13/0.40 % (1621)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.40 % (1621)Termination reason: Unknown
% 0.13/0.40 % (1621)Termination phase: Property scanning
% 0.13/0.40
% 0.13/0.40 % (1621)Memory used [KB]: 1151
% 0.13/0.40 % (1621)Time elapsed: 0.010 s
% 0.13/0.40 % (1621)Instructions burned: 16 (million)
% 0.13/0.40 % (1621)------------------------------
% 0.13/0.40 % (1621)------------------------------
% 0.13/0.41 % (1623)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.13/0.41 % (1608)Refutation found. Thanks to Tanya!
% 0.13/0.41 % SZS status Theorem for theBenchmark
% 0.13/0.41 % SZS output start Proof for theBenchmark
% 0.13/0.41 thf(type_def_5, type, mu: $tType).
% 0.13/0.41 thf(func_def_0, type, mu: $tType).
% 0.13/0.41 thf(func_def_1, type, meq_ind: mu > mu > $i > $o).
% 0.13/0.41 thf(func_def_2, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
% 0.13/0.41 thf(func_def_4, type, mnot: ($i > $o) > $i > $o).
% 0.13/0.41 thf(func_def_5, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.13/0.41 thf(func_def_6, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.13/0.41 thf(func_def_7, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.13/0.41 thf(func_def_8, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
% 0.13/0.41 thf(func_def_9, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.13/0.41 thf(func_def_10, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
% 0.13/0.41 thf(func_def_11, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.13/0.41 thf(func_def_12, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.13/0.41 thf(func_def_13, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.13/0.41 thf(func_def_14, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.13/0.41 thf(func_def_15, type, mtrue: $i > $o).
% 0.13/0.41 thf(func_def_16, type, mfalse: $i > $o).
% 0.13/0.41 thf(func_def_17, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.13/0.41 thf(func_def_18, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.13/0.41 thf(func_def_19, type, mreflexive: ($i > $i > $o) > $o).
% 0.13/0.41 thf(func_def_20, type, msymmetric: ($i > $i > $o) > $o).
% 0.13/0.41 thf(func_def_21, type, mserial: ($i > $i > $o) > $o).
% 0.13/0.41 thf(func_def_22, type, mtransitive: ($i > $i > $o) > $o).
% 0.13/0.41 thf(func_def_23, type, meuclidean: ($i > $i > $o) > $o).
% 0.13/0.41 thf(func_def_24, type, mpartially_functional: ($i > $i > $o) > $o).
% 0.13/0.41 thf(func_def_25, type, mfunctional: ($i > $i > $o) > $o).
% 0.13/0.41 thf(func_def_26, type, mweakly_dense: ($i > $i > $o) > $o).
% 0.13/0.41 thf(func_def_27, type, mweakly_connected: ($i > $i > $o) > $o).
% 0.13/0.41 thf(func_def_28, type, mweakly_directed: ($i > $i > $o) > $o).
% 0.13/0.41 thf(func_def_29, type, mvalid: ($i > $o) > $o).
% 0.13/0.41 thf(func_def_30, type, minvalid: ($i > $o) > $o).
% 0.13/0.41 thf(func_def_31, type, msatisfiable: ($i > $o) > $o).
% 0.13/0.41 thf(func_def_32, type, mcountersatisfiable: ($i > $o) > $o).
% 0.13/0.41 thf(func_def_33, type, r1: $i > $i > $o).
% 0.13/0.41 thf(func_def_34, type, r2: $i > $i > $o).
% 0.13/0.41 thf(func_def_35, type, r3: $i > $i > $o).
% 0.13/0.41 thf(func_def_36, type, r4: $i > $i > $o).
% 0.13/0.41 thf(func_def_37, type, r5: $i > $i > $o).
% 0.13/0.41 thf(func_def_38, type, john: mu).
% 0.13/0.41 thf(func_def_39, type, tom: mu).
% 0.13/0.41 thf(func_def_40, type, peter: mu).
% 0.13/0.41 thf(func_def_41, type, mike: mu).
% 0.13/0.41 thf(func_def_42, type, good_in_maths: mu > $i > $o).
% 0.13/0.41 thf(func_def_43, type, maths_teacher: mu > $i > $o).
% 0.13/0.41 thf(func_def_44, type, mathematician: mu > $i > $o).
% 0.13/0.41 thf(func_def_45, type, maths_student: mu > $i > $o).
% 0.13/0.41 thf(func_def_46, type, good_in_physics: mu > $i > $o).
% 0.13/0.41 thf(func_def_47, type, physics_student: mu > $i > $o).
% 0.13/0.41 thf(func_def_64, type, sK1: $i > mu > $i).
% 0.13/0.41 thf(func_def_65, type, sK2: $i > mu > $i).
% 0.13/0.41 thf(func_def_66, type, sK3: $i > mu > $i).
% 0.13/0.41 thf(func_def_67, type, sK4: $i > mu > $i).
% 0.13/0.41 thf(func_def_68, type, sK5: $i > mu > $i).
% 0.13/0.41 thf(func_def_69, type, sK6: $i > mu > $i).
% 0.13/0.41 thf(func_def_70, type, sK7: $i > mu > $i).
% 0.13/0.41 thf(func_def_71, type, sK8: $i > mu > $i).
% 0.13/0.41 thf(func_def_72, type, sK9: $i > mu > $i).
% 0.13/0.41 thf(func_def_73, type, sK10: $i > mu > $i).
% 0.13/0.41 thf(func_def_74, type, sK11: $i > mu > $i).
% 0.13/0.41 thf(func_def_75, type, sK12: $i > mu > $i).
% 0.13/0.41 thf(func_def_76, type, sK13: $i > mu > $i).
% 0.13/0.41 thf(func_def_77, type, sK14: $i > mu > $i).
% 0.13/0.41 thf(func_def_78, type, sK15: $i > mu > $i).
% 0.13/0.41 thf(func_def_80, type, sK17: mu > $i).
% 0.13/0.41 thf(func_def_81, type, sK18: $i > mu > $i).
% 0.13/0.41 thf(f598,plain,(
% 0.13/0.41 $false),
% 0.13/0.41 inference(trivial_inequality_removal,[],[f596])).
% 0.13/0.41 thf(f596,plain,(
% 0.13/0.41 ($false = $true)),
% 0.13/0.41 inference(superposition,[],[f595,f489])).
% 0.13/0.41 thf(f489,plain,(
% 0.13/0.41 ( ! [X1 : $i] : (((maths_teacher @ john @ X1) = $true)) )),
% 0.13/0.41 inference(pi_clausification,[],[f488])).
% 0.13/0.41 thf(f488,plain,(
% 0.13/0.41 ((!! @ $i @ (maths_teacher @ john)) = $true)),
% 0.13/0.41 inference(beta_eta_normalization,[],[f239])).
% 0.13/0.41 thf(f239,plain,(
% 0.13/0.41 (((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ (maths_teacher @ john)) = $true)),
% 0.13/0.41 inference(definition_unfolding,[],[f207,f178])).
% 0.13/0.41 thf(f178,plain,(
% 0.13/0.41 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.13/0.41 inference(cnf_transformation,[],[f57])).
% 0.13/0.41 thf(f57,plain,(
% 0.13/0.41 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.13/0.41 inference(fool_elimination,[],[f56])).
% 0.13/0.41 thf(f56,plain,(
% 0.13/0.41 (mvalid = (^[X0 : $i > $o] : (! [X1] : (X0 @ X1))))),
% 0.13/0.41 inference(rectify,[],[f28])).
% 0.13/0.41 thf(f28,axiom,(
% 0.13/0.41 (mvalid = (^[X3 : $i > $o] : (! [X2] : (X3 @ X2))))),
% 0.13/0.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mvalid)).
% 0.13/0.41 thf(f207,plain,(
% 0.13/0.41 ((mvalid @ (maths_teacher @ john)) = $true)),
% 0.13/0.41 inference(cnf_transformation,[],[f150])).
% 0.13/0.41 thf(f150,plain,(
% 0.13/0.41 ((mvalid @ (maths_teacher @ john)) = $true)),
% 0.13/0.41 inference(fool_elimination,[],[f149])).
% 0.13/0.41 thf(f149,plain,(
% 0.13/0.41 (mvalid @ (maths_teacher @ john))),
% 0.13/0.41 inference(rectify,[],[f49])).
% 0.13/0.41 thf(f49,axiom,(
% 0.13/0.41 (mvalid @ (maths_teacher @ john))),
% 0.13/0.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_a6)).
% 0.13/0.41 thf(f595,plain,(
% 0.13/0.41 ( ! [X0 : mu] : (($false = (maths_teacher @ X0 @ sK16))) )),
% 0.13/0.41 inference(trivial_inequality_removal,[],[f592])).
% 0.13/0.41 thf(f592,plain,(
% 0.13/0.41 ( ! [X0 : mu] : (($false = $true) | ($false = (maths_teacher @ X0 @ sK16))) )),
% 0.13/0.41 inference(superposition,[],[f591,f566])).
% 0.13/0.41 thf(f566,plain,(
% 0.13/0.41 ( ! [X1 : mu] : (($false = (good_in_maths @ X1 @ (sK17 @ X1)))) )),
% 0.13/0.41 inference(binary_proxy_clausification,[],[f565])).
% 0.13/0.41 thf(f565,plain,(
% 0.13/0.41 ( ! [X1 : mu] : ((((~ (r4 @ sK16 @ (sK17 @ X1))) | (good_in_maths @ X1 @ (sK17 @ X1))) = $false)) )),
% 0.13/0.41 inference(beta_eta_normalization,[],[f564])).
% 0.13/0.41 thf(f564,plain,(
% 0.13/0.41 ( ! [X1 : mu] : ((((^[Y0 : $i]: ((~ (r4 @ sK16 @ Y0)) | (good_in_maths @ X1 @ Y0))) @ (sK17 @ X1)) = $false)) )),
% 0.13/0.41 inference(sigma_clausification,[],[f563])).
% 0.13/0.41 thf(f563,plain,(
% 0.13/0.41 ( ! [X1 : mu] : (($false = (!! @ $i @ (^[Y0 : $i]: ((~ (r4 @ sK16 @ Y0)) | (good_in_maths @ X1 @ Y0)))))) )),
% 0.13/0.41 inference(not_proxy_clausification,[],[f562])).
% 0.13/0.41 thf(f562,plain,(
% 0.13/0.41 ( ! [X1 : mu] : (($true = (~ (!! @ $i @ (^[Y0 : $i]: ((~ (r4 @ sK16 @ Y0)) | (good_in_maths @ X1 @ Y0))))))) )),
% 0.13/0.41 inference(beta_eta_normalization,[],[f561])).
% 0.13/0.41 thf(f561,plain,(
% 0.13/0.41 ( ! [X1 : mu] : (($true = ((^[Y0 : mu]: (~ (!! @ $i @ (^[Y1 : $i]: ((~ (r4 @ sK16 @ Y1)) | (good_in_maths @ Y0 @ Y1)))))) @ X1))) )),
% 0.13/0.41 inference(pi_clausification,[],[f560])).
% 0.13/0.41 thf(f560,plain,(
% 0.13/0.41 ((!! @ mu @ (^[Y0 : mu]: (~ (!! @ $i @ (^[Y1 : $i]: ((~ (r4 @ sK16 @ Y1)) | (good_in_maths @ Y0 @ Y1))))))) = $true)),
% 0.13/0.41 inference(not_proxy_clausification,[],[f559])).
% 0.13/0.41 thf(f559,plain,(
% 0.13/0.41 ($false = (~ (!! @ mu @ (^[Y0 : mu]: (~ (!! @ $i @ (^[Y1 : $i]: ((~ (r4 @ sK16 @ Y1)) | (good_in_maths @ Y0 @ Y1)))))))))),
% 0.13/0.41 inference(beta_eta_normalization,[],[f558])).
% 0.13/0.41 thf(f558,plain,(
% 0.13/0.41 ($false = ((^[Y0 : $i]: (~ (!! @ mu @ (^[Y1 : mu]: (~ (!! @ $i @ (^[Y2 : $i]: ((~ (r4 @ Y0 @ Y2)) | (good_in_maths @ Y1 @ Y2))))))))) @ sK16))),
% 0.13/0.41 inference(sigma_clausification,[],[f557])).
% 0.13/0.41 thf(f557,plain,(
% 0.13/0.41 ((!! @ $i @ (^[Y0 : $i]: (~ (!! @ mu @ (^[Y1 : mu]: (~ (!! @ $i @ (^[Y2 : $i]: ((~ (r4 @ Y0 @ Y2)) | (good_in_maths @ Y1 @ Y2)))))))))) != $true)),
% 0.13/0.41 inference(beta_eta_normalization,[],[f242])).
% 0.13/0.41 thf(f242,plain,(
% 0.13/0.41 ($true != ((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : mu > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ ((^[Y1 : mu > $i > $o]: ((^[Y2 : $i]: (!! @ mu @ (^[Y3 : mu]: (Y1 @ Y3 @ Y2)))))) @ (^[Y1 : mu]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ (Y0 @ Y1)))))) @ (^[Y0 : mu]: ((^[Y1 : $i > $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: ((~ (Y1 @ Y3 @ Y4)) | (Y2 @ Y4))))))))) @ r4 @ (good_in_maths @ Y0))))))),
% 0.13/0.41 inference(definition_unfolding,[],[f210,f178,f217,f200])).
% 0.13/0.41 thf(f200,plain,(
% 0.13/0.41 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (Y0 @ Y2 @ Y3)) | (Y1 @ Y3))))))))))),
% 0.13/0.41 inference(cnf_transformation,[],[f139])).
% 0.13/0.41 thf(f139,plain,(
% 0.13/0.41 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (Y0 @ Y2 @ Y3)) | (Y1 @ Y3))))))))))),
% 0.13/0.41 inference(fool_elimination,[],[f138])).
% 0.13/0.41 thf(f138,plain,(
% 0.13/0.41 (mbox = (^[X0 : $i > $i > $o, X1 : $i > $o, X2 : $i] : (! [X3] : ((X1 @ X3) | ~(X0 @ X2 @ X3)))))),
% 0.13/0.41 inference(rectify,[],[f16])).
% 0.13/0.41 thf(f16,axiom,(
% 0.13/0.41 (mbox = (^[X6 : $i > $i > $o, X3 : $i > $o, X2 : $i] : (! [X7] : ((X3 @ X7) | ~(X6 @ X2 @ X7)))))),
% 0.13/0.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mbox)).
% 0.13/0.41 thf(f217,plain,(
% 0.13/0.41 (mexists_ind = (^[Y0 : mu > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ ((^[Y1 : mu > $i > $o]: ((^[Y2 : $i]: (!! @ mu @ (^[Y3 : mu]: (Y1 @ Y3 @ Y2)))))) @ (^[Y1 : mu]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ (Y0 @ Y1)))))))),
% 0.13/0.41 inference(definition_unfolding,[],[f198,f201,f168,f201])).
% 0.13/0.41 thf(f168,plain,(
% 0.13/0.41 (mforall_ind = (^[Y0 : mu > $i > $o]: ((^[Y1 : $i]: (!! @ mu @ (^[Y2 : mu]: (Y0 @ Y2 @ Y1)))))))),
% 0.13/0.41 inference(cnf_transformation,[],[f65])).
% 0.13/0.41 thf(f65,plain,(
% 0.13/0.41 (mforall_ind = (^[Y0 : mu > $i > $o]: ((^[Y1 : $i]: (!! @ mu @ (^[Y2 : mu]: (Y0 @ Y2 @ Y1)))))))),
% 0.13/0.41 inference(fool_elimination,[],[f64])).
% 0.13/0.41 thf(f64,plain,(
% 0.13/0.41 ((^[X0 : mu > $i > $o, X1 : $i] : (! [X2 : mu] : (X0 @ X2 @ X1))) = mforall_ind)),
% 0.13/0.41 inference(rectify,[],[f10])).
% 0.13/0.41 thf(f10,axiom,(
% 0.13/0.41 ((^[X3 : mu > $i > $o, X2 : $i] : (! [X0 : mu] : (X3 @ X0 @ X2))) = mforall_ind)),
% 0.13/0.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mforall_ind)).
% 0.13/0.41 thf(f201,plain,(
% 0.13/0.41 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.13/0.41 inference(cnf_transformation,[],[f137])).
% 0.13/0.41 thf(f137,plain,(
% 0.13/0.41 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.13/0.41 inference(fool_elimination,[],[f136])).
% 0.13/0.41 thf(f136,plain,(
% 0.13/0.41 ((^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))) = mnot)),
% 0.13/0.41 inference(rectify,[],[f3])).
% 0.13/0.41 thf(f3,axiom,(
% 0.13/0.41 ((^[X3 : $i > $o, X2 : $i] : (~(X3 @ X2))) = mnot)),
% 0.13/0.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mnot)).
% 0.13/0.41 thf(f198,plain,(
% 0.13/0.41 (mexists_ind = (^[Y0 : mu > $i > $o]: (mnot @ (mforall_ind @ (^[Y1 : mu]: (mnot @ (Y0 @ Y1)))))))),
% 0.13/0.41 inference(cnf_transformation,[],[f148])).
% 0.13/0.41 thf(f148,plain,(
% 0.13/0.41 (mexists_ind = (^[Y0 : mu > $i > $o]: (mnot @ (mforall_ind @ (^[Y1 : mu]: (mnot @ (Y0 @ Y1)))))))),
% 0.13/0.41 inference(fool_elimination,[],[f147])).
% 0.13/0.41 thf(f147,plain,(
% 0.13/0.41 ((^[X0 : mu > $i > $o] : (mnot @ (mforall_ind @ (^[X1 : mu] : (mnot @ (X0 @ X1)))))) = mexists_ind)),
% 0.13/0.41 inference(rectify,[],[f12])).
% 0.13/0.41 thf(f12,axiom,(
% 0.13/0.41 ((^[X3 : mu > $i > $o] : (mnot @ (mforall_ind @ (^[X0 : mu] : (mnot @ (X3 @ X0)))))) = mexists_ind)),
% 0.13/0.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mexists_ind)).
% 0.13/0.41 thf(f210,plain,(
% 0.13/0.41 ((mvalid @ (mexists_ind @ (^[Y0 : mu]: (mbox @ r4 @ (good_in_maths @ Y0))))) != $true)),
% 0.13/0.41 inference(cnf_transformation,[],[f158])).
% 0.13/0.41 thf(f158,plain,(
% 0.13/0.41 ((mvalid @ (mexists_ind @ (^[Y0 : mu]: (mbox @ r4 @ (good_in_maths @ Y0))))) != $true)),
% 0.13/0.41 inference(flattening,[],[f99])).
% 0.13/0.41 thf(f99,plain,(
% 0.13/0.41 ~((mvalid @ (mexists_ind @ (^[Y0 : mu]: (mbox @ r4 @ (good_in_maths @ Y0))))) = $true)),
% 0.13/0.41 inference(fool_elimination,[],[f98])).
% 0.13/0.41 thf(f98,plain,(
% 0.13/0.41 ~(mvalid @ (mexists_ind @ (^[X0 : mu] : (mbox @ r4 @ (good_in_maths @ X0)))))),
% 0.13/0.41 inference(rectify,[],[f54])).
% 0.13/0.41 thf(f54,negated_conjecture,(
% 0.13/0.41 ~(mvalid @ (mexists_ind @ (^[X0 : mu] : (mbox @ r4 @ (good_in_maths @ X0)))))),
% 0.13/0.41 inference(negated_conjecture,[],[f53])).
% 0.13/0.41 thf(f53,conjecture,(
% 0.13/0.41 (mvalid @ (mexists_ind @ (^[X0 : mu] : (mbox @ r4 @ (good_in_maths @ X0)))))),
% 0.13/0.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)).
% 0.13/0.41 thf(f591,plain,(
% 0.13/0.41 ( ! [X0 : mu,X1 : mu] : (($true = (good_in_maths @ X1 @ (sK17 @ X0))) | ($false = (maths_teacher @ X1 @ sK16))) )),
% 0.13/0.41 inference(trivial_inequality_removal,[],[f589])).
% 0.13/0.41 thf(f589,plain,(
% 0.13/0.41 ( ! [X0 : mu,X1 : mu] : (($true = (good_in_maths @ X1 @ (sK17 @ X0))) | ($false = (maths_teacher @ X1 @ sK16)) | ($false = $true)) )),
% 0.13/0.41 inference(superposition,[],[f568,f538])).
% 0.13/0.41 thf(f538,plain,(
% 0.13/0.41 ( ! [X2 : mu,X3 : $i,X1 : $i] : (($false = (r4 @ X1 @ X3)) | ((maths_teacher @ X2 @ X1) = $false) | ((good_in_maths @ X2 @ X3) = $true)) )),
% 0.13/0.41 inference(not_proxy_clausification,[],[f537])).
% 0.13/0.41 thf(f537,plain,(
% 0.13/0.41 ( ! [X2 : mu,X3 : $i,X1 : $i] : (((good_in_maths @ X2 @ X3) = $true) | ((~ (r4 @ X1 @ X3)) = $true) | ((maths_teacher @ X2 @ X1) = $false)) )),
% 0.13/0.41 inference(binary_proxy_clausification,[],[f536])).
% 0.13/0.41 thf(f536,plain,(
% 0.13/0.41 ( ! [X2 : mu,X3 : $i,X1 : $i] : (($true = ((~ (r4 @ X1 @ X3)) | (good_in_maths @ X2 @ X3))) | ((maths_teacher @ X2 @ X1) = $false)) )),
% 0.13/0.41 inference(beta_eta_normalization,[],[f535])).
% 0.13/0.41 thf(f535,plain,(
% 0.13/0.41 ( ! [X2 : mu,X3 : $i,X1 : $i] : (((maths_teacher @ X2 @ X1) = $false) | ($true = ((^[Y0 : $i]: ((~ (r4 @ X1 @ Y0)) | (good_in_maths @ X2 @ Y0))) @ X3))) )),
% 0.13/0.41 inference(pi_clausification,[],[f534])).
% 0.13/0.41 thf(f534,plain,(
% 0.13/0.41 ( ! [X2 : mu,X1 : $i] : (((maths_teacher @ X2 @ X1) = $false) | ($true = (!! @ $i @ (^[Y0 : $i]: ((~ (r4 @ X1 @ Y0)) | (good_in_maths @ X2 @ Y0)))))) )),
% 0.13/0.41 inference(not_proxy_clausification,[],[f533])).
% 0.13/0.41 thf(f533,plain,(
% 0.13/0.41 ( ! [X2 : mu,X1 : $i] : (((~ (maths_teacher @ X2 @ X1)) = $true) | ($true = (!! @ $i @ (^[Y0 : $i]: ((~ (r4 @ X1 @ Y0)) | (good_in_maths @ X2 @ Y0)))))) )),
% 0.13/0.41 inference(binary_proxy_clausification,[],[f532])).
% 0.13/0.41 thf(f532,plain,(
% 0.13/0.41 ( ! [X2 : mu,X1 : $i] : (($true = ((!! @ $i @ (^[Y0 : $i]: ((~ (r4 @ X1 @ Y0)) | (good_in_maths @ X2 @ Y0)))) | (~ (maths_teacher @ X2 @ X1))))) )),
% 0.13/0.41 inference(beta_eta_normalization,[],[f531])).
% 0.13/0.41 thf(f531,plain,(
% 0.13/0.41 ( ! [X2 : mu,X1 : $i] : (($true = ((^[Y0 : mu]: ((!! @ $i @ (^[Y1 : $i]: ((~ (r4 @ X1 @ Y1)) | (good_in_maths @ Y0 @ Y1)))) | (~ (maths_teacher @ Y0 @ X1)))) @ X2))) )),
% 0.13/0.41 inference(pi_clausification,[],[f530])).
% 0.13/0.41 thf(f530,plain,(
% 0.13/0.41 ( ! [X1 : $i] : (($true = (!! @ mu @ (^[Y0 : mu]: ((!! @ $i @ (^[Y1 : $i]: ((~ (r4 @ X1 @ Y1)) | (good_in_maths @ Y0 @ Y1)))) | (~ (maths_teacher @ Y0 @ X1))))))) )),
% 0.13/0.41 inference(beta_eta_normalization,[],[f529])).
% 0.13/0.41 thf(f529,plain,(
% 0.13/0.41 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((!! @ $i @ (^[Y2 : $i]: ((~ (r4 @ Y0 @ Y2)) | (good_in_maths @ Y1 @ Y2)))) | (~ (maths_teacher @ Y1 @ Y0)))))) @ X1))) )),
% 0.13/0.41 inference(pi_clausification,[],[f528])).
% 0.13/0.41 thf(f528,plain,(
% 0.13/0.41 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((!! @ $i @ (^[Y2 : $i]: ((~ (r4 @ Y0 @ Y2)) | (good_in_maths @ Y1 @ Y2)))) | (~ (maths_teacher @ Y1 @ Y0))))))))),
% 0.13/0.41 inference(beta_eta_normalization,[],[f234])).
% 0.13/0.41 thf(f234,plain,(
% 0.13/0.41 (((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : mu > $i > $o]: ((^[Y1 : $i]: (!! @ mu @ (^[Y2 : mu]: (Y0 @ Y2 @ Y1)))))) @ (^[Y0 : mu]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i]: ((Y4 @ Y5) | (Y3 @ Y5))))))) @ ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (~ (Y3 @ Y4))))) @ Y1) @ Y2)))) @ (maths_teacher @ Y0) @ ((^[Y1 : $i > $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: ((~ (Y1 @ Y3 @ Y4)) | (Y2 @ Y4))))))))) @ r4 @ (good_in_maths @ Y0)))))) = $true)),
% 0.13/0.41 inference(definition_unfolding,[],[f197,f178,f168,f213,f200])).
% 0.13/0.41 thf(f213,plain,(
% 0.13/0.41 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ Y1)))))),
% 0.13/0.41 inference(definition_unfolding,[],[f177,f180,f201])).
% 0.13/0.41 thf(f180,plain,(
% 0.13/0.41 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.13/0.41 inference(cnf_transformation,[],[f73])).
% 0.13/0.41 thf(f73,plain,(
% 0.13/0.41 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.13/0.41 inference(fool_elimination,[],[f72])).
% 0.13/0.41 thf(f72,plain,(
% 0.13/0.41 (mor = (^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ X2))))),
% 0.13/0.41 inference(rectify,[],[f4])).
% 0.13/0.41 thf(f4,axiom,(
% 0.13/0.41 (mor = (^[X3 : $i > $o, X4 : $i > $o, X2 : $i] : ((X3 @ X2) | (X4 @ X2))))),
% 0.13/0.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mor)).
% 0.13/0.41 thf(f177,plain,(
% 0.13/0.41 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.13/0.41 inference(cnf_transformation,[],[f157])).
% 0.13/0.41 thf(f157,plain,(
% 0.13/0.41 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.13/0.41 inference(fool_elimination,[],[f156])).
% 0.13/0.41 thf(f156,plain,(
% 0.13/0.41 ((^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)) = mimplies)),
% 0.13/0.41 inference(rectify,[],[f6])).
% 0.13/0.41 thf(f6,axiom,(
% 0.13/0.41 ((^[X3 : $i > $o, X4 : $i > $o] : (mor @ (mnot @ X3) @ X4)) = mimplies)),
% 0.13/0.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mimplies)).
% 0.13/0.41 thf(f197,plain,(
% 0.13/0.41 ($true = (mvalid @ (mforall_ind @ (^[Y0 : mu]: (mimplies @ (maths_teacher @ Y0) @ (mbox @ r4 @ (good_in_maths @ Y0)))))))),
% 0.13/0.41 inference(cnf_transformation,[],[f117])).
% 0.13/0.41 thf(f117,plain,(
% 0.13/0.41 ($true = (mvalid @ (mforall_ind @ (^[Y0 : mu]: (mimplies @ (maths_teacher @ Y0) @ (mbox @ r4 @ (good_in_maths @ Y0)))))))),
% 0.13/0.41 inference(fool_elimination,[],[f116])).
% 0.13/0.41 thf(f116,plain,(
% 0.13/0.41 (mvalid @ (mforall_ind @ (^[X0 : mu] : (mimplies @ (maths_teacher @ X0) @ (mbox @ r4 @ (good_in_maths @ X0))))))),
% 0.13/0.41 inference(rectify,[],[f32])).
% 0.13/0.41 thf(f32,axiom,(
% 0.13/0.41 (mvalid @ (mforall_ind @ (^[X0 : mu] : (mimplies @ (maths_teacher @ X0) @ (mbox @ r4 @ (good_in_maths @ X0))))))),
% 0.13/0.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_r1)).
% 0.13/0.41 thf(f568,plain,(
% 0.13/0.41 ( ! [X1 : mu] : (($true = (r4 @ sK16 @ (sK17 @ X1)))) )),
% 0.13/0.41 inference(not_proxy_clausification,[],[f567])).
% 0.13/0.41 thf(f567,plain,(
% 0.13/0.41 ( ! [X1 : mu] : (((~ (r4 @ sK16 @ (sK17 @ X1))) = $false)) )),
% 0.13/0.41 inference(binary_proxy_clausification,[],[f565])).
% 0.13/0.41 % SZS output end Proof for theBenchmark
% 0.13/0.41 % (1608)------------------------------
% 0.13/0.41 % (1608)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.41 % (1608)Termination reason: Refutation
% 0.13/0.41
% 0.13/0.41 % (1608)Memory used [KB]: 6140
% 0.13/0.41 % (1608)Time elapsed: 0.036 s
% 0.13/0.41 % (1608)Instructions burned: 60 (million)
% 0.13/0.41 % (1608)------------------------------
% 0.13/0.41 % (1608)------------------------------
% 0.13/0.41 % (1607)Success in time 0.047 s
% 0.13/0.41 % Vampire---4.8 exiting
%------------------------------------------------------------------------------