TSTP Solution File: SWW592_2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWW592_2 : TPTP v8.2.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Jun 24 18:17:45 EDT 2024
% Result : Theorem 1.87s 1.14s
% Output : CNFRefutation 1.87s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW592_2 : TPTP v8.2.0. Released v6.1.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jun 19 05:22:09 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.20/0.47 Running TFA theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa --heuristic_context casc_unsat /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.87/1.14 % SZS status Started for theBenchmark.p
% 1.87/1.14 % SZS status Theorem for theBenchmark.p
% 1.87/1.14
% 1.87/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.87/1.14
% 1.87/1.14 ------ iProver source info
% 1.87/1.14
% 1.87/1.14 git: date: 2024-06-12 09:56:46 +0000
% 1.87/1.14 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 1.87/1.14 git: non_committed_changes: false
% 1.87/1.14
% 1.87/1.14 ------ Parsing...
% 1.87/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.87/1.14
% 1.87/1.14 ------ Preprocessing...
% 1.87/1.14
% 1.87/1.14 % SZS status Theorem for theBenchmark.p
% 1.87/1.14
% 1.87/1.14 % SZS output start CNFRefutation for theBenchmark.p
% 1.87/1.14
% 1.87/1.14 tff(f27,axiom,(
% 1.87/1.14 ! [X1 : t1] : mk_t1(1,0,0,1) = power1(X1,0)),
% 1.87/1.14 file('/export/starexec/sandbox/benchmark/theBenchmark.p',power_0)).
% 1.87/1.14
% 1.87/1.14 tff(f34,conjecture,(
% 1.87/1.14 ! [X8 : $int] : ($lesseq(0,X8) => (0 = X8 => power1(mk_t1(1,1,1,0),X8) = mk_t1($sum(1,0),0,0,1)))),
% 1.87/1.14 file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_logfib)).
% 1.87/1.14
% 1.87/1.14 tff(f35,negated_conjecture,(
% 1.87/1.14 ~! [X8 : $int] : ($lesseq(0,X8) => (0 = X8 => power1(mk_t1(1,1,1,0),X8) = mk_t1($sum(1,0),0,0,1)))),
% 1.87/1.14 inference(negated_conjecture,[],[f34])).
% 1.87/1.14
% 1.87/1.14 tff(f46,plain,(
% 1.87/1.14 ~! [X8 : $int] : (~$less(X8,0) => (0 = X8 => power1(mk_t1(1,1,1,0),X8) = mk_t1($sum(1,0),0,0,1)))),
% 1.87/1.14 inference(theory_normalization,[],[f35])).
% 1.87/1.14
% 1.87/1.14 tff(f47,plain,(
% 1.87/1.14 ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 1.87/1.14 introduced(theory_axiom_138,[])).
% 1.87/1.14
% 1.87/1.14 tff(f48,plain,(
% 1.87/1.14 ( ! [X2 : $int,X0 : $int,X1 : $int] : ($sum(X0,$sum(X1,X2)) = $sum($sum(X0,X1),X2)) )),
% 1.87/1.14 introduced(theory_axiom_139,[])).
% 1.87/1.14
% 1.87/1.14 tff(f58,plain,(
% 1.87/1.14 ( ! [X0 : $int,X1 : $int] : ($product(X0,X1) = $product(X1,X0)) )),
% 1.87/1.14 introduced(theory_axiom_138,[])).
% 1.87/1.14
% 1.87/1.14 tff(f59,plain,(
% 1.87/1.14 ( ! [X2 : $int,X0 : $int,X1 : $int] : ($product(X0,$product(X1,X2)) = $product($product(X0,X1),X2)) )),
% 1.87/1.14 introduced(theory_axiom_139,[])).
% 1.87/1.14
% 1.87/1.14 tff(f91,plain,(
% 1.87/1.14 ! [X0 : t1] : mk_t1(1,0,0,1) = power1(X0,0)),
% 1.87/1.14 inference(rectify,[],[f27])).
% 1.87/1.14
% 1.87/1.14 tff(f98,plain,(
% 1.87/1.14 ~! [X0 : $int] : (~$less(X0,0) => (0 = X0 => mk_t1($sum(1,0),0,0,1) = power1(mk_t1(1,1,1,0),X0)))),
% 1.87/1.14 inference(rectify,[],[f46])).
% 1.87/1.14
% 1.87/1.14 tff(f114,plain,(
% 1.87/1.14 ? [X0 : $int] : ((mk_t1($sum(1,0),0,0,1) != power1(mk_t1(1,1,1,0),X0) & 0 = X0) & ~$less(X0,0))),
% 1.87/1.14 inference(ennf_transformation,[],[f98])).
% 1.87/1.14
% 1.87/1.14 tff(f115,plain,(
% 1.87/1.14 ? [X0 : $int] : (mk_t1($sum(1,0),0,0,1) != power1(mk_t1(1,1,1,0),X0) & 0 = X0 & ~$less(X0,0))),
% 1.87/1.14 inference(flattening,[],[f114])).
% 1.87/1.14
% 1.87/1.14 tff(f118,plain,(
% 1.87/1.14 ? [X0 : $int] : (mk_t1($sum(1,0),0,0,1) != power1(mk_t1(1,1,1,0),X0) & 0 = X0 & ~$less(X0,0)) => (mk_t1($sum(1,0),0,0,1) != power1(mk_t1(1,1,1,0),sK0) & 0 = sK0 & ~$less(sK0,0))),
% 1.87/1.14 introduced(choice_axiom,[])).
% 1.87/1.14
% 1.87/1.14 tff(f119,plain,(
% 1.87/1.14 mk_t1($sum(1,0),0,0,1) != power1(mk_t1(1,1,1,0),sK0) & 0 = sK0 & ~$less(sK0,0)),
% 1.87/1.14 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f115,f118])).
% 1.87/1.14
% 1.87/1.14 tff(f149,plain,(
% 1.87/1.14 ( ! [X0 : t1] : (mk_t1(1,0,0,1) = power1(X0,0)) )),
% 1.87/1.14 inference(cnf_transformation,[],[f91])).
% 1.87/1.14
% 1.87/1.14 tff(f157,plain,(
% 1.87/1.14 0 = sK0),
% 1.87/1.14 inference(cnf_transformation,[],[f119])).
% 1.87/1.14
% 1.87/1.14 tff(f158,plain,(
% 1.87/1.14 mk_t1($sum(1,0),0,0,1) != power1(mk_t1(1,1,1,0),sK0)),
% 1.87/1.14 inference(cnf_transformation,[],[f119])).
% 1.87/1.14
% 1.87/1.14 tff(f167,plain,(
% 1.87/1.14 mk_t1($sum(1,0),0,0,1) != power1(mk_t1(1,1,1,0),0)),
% 1.87/1.14 inference(definition_unfolding,[],[f158,f157])).
% 1.87/1.14
% 1.87/1.14 cnf(c_59,plain,
% 1.87/1.14 ($product_int($product_int(X0_3,X1_3),X2_3) = $product_int(X0_3,$product_int(X1_3,X2_3))),
% 1.87/1.14 inference(cnf_transformation,[],[f59])).
% 1.87/1.14
% 1.87/1.14 cnf(c_60,plain,
% 1.87/1.14 ($product_int(X0_3,X1_3) = $product_int(X1_3,X0_3)),
% 1.87/1.14 inference(cnf_transformation,[],[f58])).
% 1.87/1.14
% 1.87/1.14 cnf(c_70,plain,
% 1.87/1.14 ($sum_int($sum_int(X0_3,X1_3),X2_3) = $sum_int(X0_3,$sum_int(X1_3,X2_3))),
% 1.87/1.14 inference(cnf_transformation,[],[f48])).
% 1.87/1.14
% 1.87/1.14 cnf(c_71,plain,
% 1.87/1.14 ($sum_int(X0_3,X1_3) = $sum_int(X1_3,X0_3)),
% 1.87/1.14 inference(cnf_transformation,[],[f47])).
% 1.87/1.14
% 1.87/1.14 cnf(c_100,plain,
% 1.87/1.14 (mk_t1(1,0,0,1) = power1(X0_17,0)),
% 1.87/1.14 inference(cnf_transformation,[],[f149])).
% 1.87/1.14
% 1.87/1.14 cnf(c_107,negated_conjecture,
% 1.87/1.14 (mk_t1($sum_int(1,0),0,0,1) != power1(mk_t1(1,1,1,0),0)),
% 1.87/1.14 inference(cnf_transformation,[],[f167])).
% 1.87/1.14
% 1.87/1.14 cnf(c_156,negated_conjecture,
% 1.87/1.14 (mk_t1($sum_int(0,1),0,0,1) != power1(mk_t1(1,1,1,0),0)),
% 1.87/1.14 inference(theory_normalisation,[status(thm)],[c_107,c_59,c_60,c_70,c_71])).
% 1.87/1.14
% 1.87/1.14 cnf(c_595,plain,
% 1.87/1.14 (power1(mk_t1(1,1,1,0),0) != mk_t1(1,0,0,1)),
% 1.87/1.14 inference(smt_theory_normalisation,[status(thm)],[c_156])).
% 1.87/1.14
% 1.87/1.14 cnf(c_596,plain,
% 1.87/1.14 (mk_t1(1,0,0,1) != mk_t1(1,0,0,1)),
% 1.87/1.14 inference(demodulation,[status(thm)],[c_595,c_100])).
% 1.87/1.14
% 1.87/1.14 cnf(c_597,plain,
% 1.87/1.14 ($false),
% 1.87/1.14 inference(equality_resolution_simp,[status(thm)],[c_596])).
% 1.87/1.14
% 1.87/1.14
% 1.87/1.14 % SZS output end CNFRefutation for theBenchmark.p
% 1.87/1.14
% 1.87/1.14
%------------------------------------------------------------------------------