TSTP Solution File: SEU739^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU739^2 : 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/sandbox2/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 03:51:09 EDT 2024
% Result : Theorem 0.12s 0.30s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SEU739^2 : TPTP v8.2.0. Released v3.7.0.
% 0.00/0.09 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.09/0.28 % Computer : n009.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Sun May 19 18:12:52 EDT 2024
% 0.09/0.28 % CPUTime :
% 0.09/0.28 This is a TH0_THM_EQU_NAR problem
% 0.09/0.28 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.30 % (8527)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.12/0.30 % (8525)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.12/0.30 % (8528)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.12/0.30 % (8529)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.12/0.30 % (8530)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.12/0.30 % (8531)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.12/0.30 % (8528)Instruction limit reached!
% 0.12/0.30 % (8528)------------------------------
% 0.12/0.30 % (8528)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.30 % (8528)Termination reason: Unknown
% 0.12/0.30 % (8528)Termination phase: Saturation
% 0.12/0.30
% 0.12/0.30 % (8528)Memory used [KB]: 5500
% 0.12/0.30 % (8528)Time elapsed: 0.002 s
% 0.12/0.30 % (8529)Instruction limit reached!
% 0.12/0.30 % (8529)------------------------------
% 0.12/0.30 % (8529)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.30 % (8529)Termination reason: Unknown
% 0.12/0.30 % (8529)Termination phase: Saturation
% 0.12/0.30
% 0.12/0.30 % (8529)Memory used [KB]: 5500
% 0.12/0.30 % (8529)Time elapsed: 0.003 s
% 0.12/0.30 % (8529)Instructions burned: 3 (million)
% 0.12/0.30 % (8529)------------------------------
% 0.12/0.30 % (8529)------------------------------
% 0.12/0.30 % (8528)Instructions burned: 3 (million)
% 0.12/0.30 % (8528)------------------------------
% 0.12/0.30 % (8528)------------------------------
% 0.12/0.30 % (8525)First to succeed.
% 0.12/0.30 % (8527)Also succeeded, but the first one will report.
% 0.12/0.30 % (8525)Refutation found. Thanks to Tanya!
% 0.12/0.30 % SZS status Theorem for theBenchmark
% 0.12/0.30 % SZS output start Proof for theBenchmark
% 0.12/0.30 thf(func_def_0, type, in: $i > $i > $o).
% 0.12/0.30 thf(func_def_1, type, powerset: $i > $i).
% 0.12/0.30 thf(func_def_2, type, binunion: $i > $i > $i).
% 0.12/0.30 thf(f35,plain,(
% 0.12/0.30 $false),
% 0.12/0.30 inference(trivial_inequality_removal,[],[f34])).
% 0.12/0.30 thf(f34,plain,(
% 0.12/0.30 ($true = $false)),
% 0.12/0.30 inference(superposition,[],[f19,f32])).
% 0.12/0.30 thf(f32,plain,(
% 0.12/0.30 ((in @ sK3 @ sK2) = $false)),
% 0.12/0.30 inference(trivial_inequality_removal,[],[f31])).
% 0.12/0.30 thf(f31,plain,(
% 0.12/0.30 ($true != $true) | ((in @ sK3 @ sK2) = $false)),
% 0.12/0.30 inference(superposition,[],[f18,f30])).
% 0.12/0.30 thf(f30,plain,(
% 0.12/0.30 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = (in @ X2 @ (binunion @ X3 @ X1))) | ((in @ X2 @ X1) = $false)) )),
% 0.12/0.30 inference(binary_proxy_clausification,[],[f29])).
% 0.12/0.30 thf(f29,plain,(
% 0.12/0.30 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = ((in @ X2 @ X1) => (in @ X2 @ (binunion @ X3 @ X1))))) )),
% 0.12/0.30 inference(beta_eta_normalization,[],[f28])).
% 0.12/0.30 thf(f28,plain,(
% 0.12/0.30 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: ((in @ X2 @ X1) => (in @ X2 @ (binunion @ Y0 @ X1)))) @ X3))) )),
% 0.12/0.30 inference(pi_clausification,[],[f27])).
% 0.12/0.30 thf(f27,plain,(
% 0.12/0.30 ( ! [X2 : $i,X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: ((in @ X2 @ X1) => (in @ X2 @ (binunion @ Y0 @ X1))))))) )),
% 0.12/0.30 inference(beta_eta_normalization,[],[f26])).
% 0.12/0.30 thf(f26,plain,(
% 0.12/0.30 ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ X1) => (in @ Y0 @ (binunion @ Y1 @ X1)))))) @ X2))) )),
% 0.12/0.30 inference(pi_clausification,[],[f25])).
% 0.12/0.30 thf(f25,plain,(
% 0.12/0.30 ( ! [X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ X1) => (in @ Y0 @ (binunion @ Y1 @ X1))))))))) )),
% 0.12/0.30 inference(beta_eta_normalization,[],[f24])).
% 0.12/0.30 thf(f24,plain,(
% 0.12/0.30 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y0) => (in @ Y1 @ (binunion @ Y2 @ Y0)))))))) @ X1))) )),
% 0.12/0.30 inference(pi_clausification,[],[f23])).
% 0.12/0.30 thf(f23,plain,(
% 0.12/0.30 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y0) => (in @ Y1 @ (binunion @ Y2 @ Y0))))))))) = $true)),
% 0.12/0.30 inference(definition_unfolding,[],[f22,f21])).
% 0.12/0.30 thf(f21,plain,(
% 0.12/0.30 (binunionIR = $true)),
% 0.12/0.30 inference(cnf_transformation,[],[f15])).
% 0.12/0.30 thf(f15,plain,(
% 0.12/0.30 (binunionIR = $true) & (((($true = (in @ sK3 @ sK1)) & ($true = (in @ sK3 @ sK2)) & ($true != (in @ sK3 @ (binunion @ sK0 @ sK2)))) & ($true = (in @ sK2 @ (powerset @ sK1)))) & ($true = (in @ sK0 @ (powerset @ sK1))))),
% 0.12/0.30 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f11,f14,f13,f12])).
% 0.12/0.30 thf(f12,plain,(
% 0.12/0.30 ? [X0,X1] : (? [X2] : (? [X3] : (($true = (in @ X3 @ X1)) & ($true = (in @ X3 @ X2)) & ($true != (in @ X3 @ (binunion @ X0 @ X2)))) & ($true = (in @ X2 @ (powerset @ X1)))) & ($true = (in @ X0 @ (powerset @ X1)))) => (? [X2] : (? [X3] : (($true = (in @ X3 @ sK1)) & ($true = (in @ X3 @ X2)) & ($true != (in @ X3 @ (binunion @ sK0 @ X2)))) & ($true = (in @ X2 @ (powerset @ sK1)))) & ($true = (in @ sK0 @ (powerset @ sK1))))),
% 0.12/0.30 introduced(choice_axiom,[])).
% 0.12/0.30 thf(f13,plain,(
% 0.12/0.30 ? [X2] : (? [X3] : (($true = (in @ X3 @ sK1)) & ($true = (in @ X3 @ X2)) & ($true != (in @ X3 @ (binunion @ sK0 @ X2)))) & ($true = (in @ X2 @ (powerset @ sK1)))) => (? [X3] : (($true = (in @ X3 @ sK1)) & ($true = (in @ X3 @ sK2)) & ($true != (in @ X3 @ (binunion @ sK0 @ sK2)))) & ($true = (in @ sK2 @ (powerset @ sK1))))),
% 0.12/0.30 introduced(choice_axiom,[])).
% 0.12/0.30 thf(f14,plain,(
% 0.12/0.30 ? [X3] : (($true = (in @ X3 @ sK1)) & ($true = (in @ X3 @ sK2)) & ($true != (in @ X3 @ (binunion @ sK0 @ sK2)))) => (($true = (in @ sK3 @ sK1)) & ($true = (in @ sK3 @ sK2)) & ($true != (in @ sK3 @ (binunion @ sK0 @ sK2))))),
% 0.12/0.30 introduced(choice_axiom,[])).
% 0.12/0.30 thf(f11,plain,(
% 0.12/0.30 (binunionIR = $true) & ? [X0,X1] : (? [X2] : (? [X3] : (($true = (in @ X3 @ X1)) & ($true = (in @ X3 @ X2)) & ($true != (in @ X3 @ (binunion @ X0 @ X2)))) & ($true = (in @ X2 @ (powerset @ X1)))) & ($true = (in @ X0 @ (powerset @ X1))))),
% 0.12/0.30 inference(flattening,[],[f10])).
% 0.12/0.30 thf(f10,plain,(
% 0.12/0.30 ? [X0,X1] : (? [X2] : (? [X3] : ((($true = (in @ X3 @ X2)) & ($true != (in @ X3 @ (binunion @ X0 @ X2)))) & ($true = (in @ X3 @ X1))) & ($true = (in @ X2 @ (powerset @ X1)))) & ($true = (in @ X0 @ (powerset @ X1)))) & (binunionIR = $true)),
% 0.12/0.30 inference(ennf_transformation,[],[f9])).
% 0.12/0.30 thf(f9,plain,(
% 0.12/0.30 ~((binunionIR = $true) => ! [X0,X1] : (($true = (in @ X0 @ (powerset @ X1))) => ! [X2] : (($true = (in @ X2 @ (powerset @ X1))) => ! [X3] : (($true = (in @ X3 @ X1)) => (($true != (in @ X3 @ (binunion @ X0 @ X2))) => ($true != (in @ X3 @ X2)))))))),
% 0.12/0.30 inference(flattening,[],[f8])).
% 0.12/0.30 thf(f8,plain,(
% 0.12/0.30 ~((binunionIR = $true) => ! [X0,X1] : (($true = (in @ X0 @ (powerset @ X1))) => ! [X2] : (($true = (in @ X2 @ (powerset @ X1))) => ! [X3] : (($true = (in @ X3 @ X1)) => (~($true = (in @ X3 @ (binunion @ X0 @ X2))) => ~($true = (in @ X3 @ X2)))))))),
% 0.12/0.30 inference(fool_elimination,[],[f7])).
% 0.12/0.30 thf(f7,plain,(
% 0.12/0.30 ~(binunionIR => ! [X0,X1] : ((in @ X0 @ (powerset @ X1)) => ! [X2] : ((in @ X2 @ (powerset @ X1)) => ! [X3] : ((in @ X3 @ X1) => (~(in @ X3 @ (binunion @ X0 @ X2)) => ~(in @ X3 @ X2))))))),
% 0.12/0.30 inference(rectify,[],[f3])).
% 0.12/0.30 thf(f3,negated_conjecture,(
% 0.12/0.30 ~(binunionIR => ! [X3,X0] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ X0) => (~(in @ X2 @ (binunion @ X3 @ X4)) => ~(in @ X2 @ X4))))))),
% 0.12/0.30 inference(negated_conjecture,[],[f2])).
% 0.12/0.30 thf(f2,conjecture,(
% 0.12/0.30 binunionIR => ! [X3,X0] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ X0) => (~(in @ X2 @ (binunion @ X3 @ X4)) => ~(in @ X2 @ X4)))))),
% 0.12/0.30 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionTIRcontra)).
% 0.12/0.30 thf(f22,plain,(
% 0.12/0.30 (binunionIR = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y0) => (in @ Y1 @ (binunion @ Y2 @ Y0))))))))))),
% 0.12/0.30 inference(cnf_transformation,[],[f6])).
% 0.12/0.30 thf(f6,plain,(
% 0.12/0.30 (binunionIR = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y0) => (in @ Y1 @ (binunion @ Y2 @ Y0))))))))))),
% 0.12/0.30 inference(fool_elimination,[],[f5])).
% 0.12/0.30 thf(f5,plain,(
% 0.12/0.30 (! [X0,X1,X2] : ((in @ X1 @ X2) => (in @ X1 @ (binunion @ X0 @ X2))) = binunionIR)),
% 0.12/0.30 inference(rectify,[],[f1])).
% 0.12/0.30 thf(f1,axiom,(
% 0.12/0.30 (! [X0,X2,X1] : ((in @ X2 @ X1) => (in @ X2 @ (binunion @ X0 @ X1))) = binunionIR)),
% 0.12/0.30 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionIR)).
% 0.12/0.30 thf(f18,plain,(
% 0.12/0.30 ($true != (in @ sK3 @ (binunion @ sK0 @ sK2)))),
% 0.12/0.30 inference(cnf_transformation,[],[f15])).
% 0.12/0.30 thf(f19,plain,(
% 0.12/0.30 ($true = (in @ sK3 @ sK2))),
% 0.12/0.30 inference(cnf_transformation,[],[f15])).
% 0.12/0.30 % SZS output end Proof for theBenchmark
% 0.12/0.30 % (8525)------------------------------
% 0.12/0.30 % (8525)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.30 % (8525)Termination reason: Refutation
% 0.12/0.30
% 0.12/0.30 % (8525)Memory used [KB]: 5500
% 0.12/0.30 % (8525)Time elapsed: 0.003 s
% 0.12/0.30 % (8525)Instructions burned: 2 (million)
% 0.12/0.30 % (8525)------------------------------
% 0.12/0.30 % (8525)------------------------------
% 0.12/0.30 % (8524)Success in time 0.005 s
% 0.12/0.30 % Vampire---4.8 exiting
%------------------------------------------------------------------------------