TSTP Solution File: SWW632_2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWW632_2 : TPTP v8.1.2. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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 : Fri Sep 1 00:39:59 EDT 2023
% Result : Theorem 0.45s 1.16s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWW632_2 : TPTP v8.1.2. Released v6.1.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n023.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 : Sun Aug 27 20:37:56 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running TFA theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.45/1.16 % SZS status Started for theBenchmark.p
% 0.45/1.16 % SZS status Theorem for theBenchmark.p
% 0.45/1.16
% 0.45/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.45/1.16
% 0.45/1.16 ------ iProver source info
% 0.45/1.16
% 0.45/1.16 git: date: 2023-05-31 18:12:56 +0000
% 0.45/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.45/1.16 git: non_committed_changes: false
% 0.45/1.16 git: last_make_outside_of_git: false
% 0.45/1.16
% 0.45/1.16 ------ Parsing...
% 0.45/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.45/1.16
% 0.45/1.16 ------ Preprocessing... sup_sim: 2 sf_s rm: 18 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 9 0s sf_e pe_s pe_e
% 0.45/1.16
% 0.45/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.45/1.16
% 0.45/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.45/1.16 ------ Proving...
% 0.45/1.16 ------ Problem Properties
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16 clauses 54
% 0.45/1.16 conjectures 5
% 0.45/1.16 EPR 9
% 0.45/1.16 Horn 34
% 0.45/1.16 unary 24
% 0.45/1.16 binary 14
% 0.45/1.16 lits 102
% 0.45/1.16 lits eq 42
% 0.45/1.16 fd_pure 1
% 0.45/1.16 fd_pseudo 0
% 0.45/1.16 fd_cond 5
% 0.45/1.16 fd_pseudo_cond 2
% 0.45/1.16 AC symbols 2
% 0.45/1.16
% 0.45/1.16 ------ Input Options Time Limit: Unbounded
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16 ------
% 0.45/1.16 Current options:
% 0.45/1.16 ------
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16 ------ Proving...
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16 % SZS status Theorem for theBenchmark.p
% 0.45/1.16
% 0.45/1.16 % SZS output start CNFRefutation for theBenchmark.p
% 0.45/1.16
% 0.45/1.16 tff(f9,axiom,(
% 0.45/1.16 ! [X1 : $int] : power(X1,0) = 1),
% 0.45/1.16 file('/export/starexec/sandbox/benchmark/theBenchmark.p',power_0)).
% 0.45/1.16
% 0.45/1.16 tff(f37,conjecture,(
% 0.45/1.16 ! [X1 : $int,X8 : $int] : ($lesseq(0,X8) => ! [X10 : $int,X11 : $int,X12 : $int] : ((power(X1,X8) = $product(X12,power(X11,X10)) & $lesseq(0,X10)) => (~$less(0,X10) => power(X1,X8) = X12)))),
% 0.45/1.16 file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_fast_exp_imperative)).
% 0.45/1.16
% 0.45/1.16 tff(f38,negated_conjecture,(
% 0.45/1.16 ~! [X1 : $int,X8 : $int] : ($lesseq(0,X8) => ! [X10 : $int,X11 : $int,X12 : $int] : ((power(X1,X8) = $product(X12,power(X11,X10)) & $lesseq(0,X10)) => (~$less(0,X10) => power(X1,X8) = X12)))),
% 0.45/1.16 inference(negated_conjecture,[],[f37])).
% 0.45/1.16
% 0.45/1.16 tff(f58,plain,(
% 0.45/1.16 ~! [X1 : $int,X8 : $int] : (~$less(X8,0) => ! [X10 : $int,X11 : $int,X12 : $int] : ((power(X1,X8) = $product(X12,power(X11,X10)) & ~$less(X10,0)) => (~$less(0,X10) => power(X1,X8) = X12)))),
% 0.45/1.16 inference(theory_normalization,[],[f38])).
% 0.45/1.16
% 0.45/1.16 tff(f66,plain,(
% 0.45/1.16 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,X0) | X0 = X1) )),
% 0.45/1.16 introduced(theory_axiom_147,[])).
% 0.45/1.16
% 0.45/1.16 tff(f72,plain,(
% 0.45/1.16 ( ! [X0 : $int] : ($product(X0,1) = X0) )),
% 0.45/1.16 introduced(theory_axiom_140,[])).
% 0.45/1.16
% 0.45/1.16 tff(f82,plain,(
% 0.45/1.16 ! [X0 : $int] : 1 = power(X0,0)),
% 0.45/1.16 inference(rectify,[],[f9])).
% 0.45/1.16
% 0.45/1.16 tff(f108,plain,(
% 0.45/1.16 ~! [X0 : $int,X1 : $int] : (~$less(X1,0) => ! [X2 : $int,X3 : $int,X4 : $int] : ((power(X0,X1) = $product(X4,power(X3,X2)) & ~$less(X2,0)) => (~$less(0,X2) => power(X0,X1) = X4)))),
% 0.45/1.16 inference(rectify,[],[f58])).
% 0.45/1.16
% 0.45/1.16 tff(f144,plain,(
% 0.45/1.16 ? [X0 : $int,X1 : $int] : (? [X2 : $int,X3 : $int,X4 : $int] : ((power(X0,X1) != X4 & ~$less(0,X2)) & (power(X0,X1) = $product(X4,power(X3,X2)) & ~$less(X2,0))) & ~$less(X1,0))),
% 0.45/1.16 inference(ennf_transformation,[],[f108])).
% 0.45/1.16
% 0.45/1.16 tff(f145,plain,(
% 0.45/1.16 ? [X0 : $int,X1 : $int] : (? [X2 : $int,X3 : $int,X4 : $int] : (power(X0,X1) != X4 & ~$less(0,X2) & power(X0,X1) = $product(X4,power(X3,X2)) & ~$less(X2,0)) & ~$less(X1,0))),
% 0.45/1.16 inference(flattening,[],[f144])).
% 0.45/1.16
% 0.45/1.16 tff(f148,plain,(
% 0.45/1.16 ? [X0 : $int,X1 : $int] : (? [X2 : $int,X3 : $int,X4 : $int] : (power(X0,X1) != X4 & ~$less(0,X2) & power(X0,X1) = $product(X4,power(X3,X2)) & ~$less(X2,0)) & ~$less(X1,0)) => (? [X4 : $int,X3 : $int,X2 : $int] : (power(sK0,sK1) != X4 & ~$less(0,X2) & $product(X4,power(X3,X2)) = power(sK0,sK1) & ~$less(X2,0)) & ~$less(sK1,0))),
% 0.45/1.16 introduced(choice_axiom,[])).
% 0.45/1.16
% 0.45/1.16 tff(f149,plain,(
% 0.45/1.16 ? [X4 : $int,X3 : $int,X2 : $int] : (power(sK0,sK1) != X4 & ~$less(0,X2) & $product(X4,power(X3,X2)) = power(sK0,sK1) & ~$less(X2,0)) => (power(sK0,sK1) != sK4 & ~$less(0,sK2) & power(sK0,sK1) = $product(sK4,power(sK3,sK2)) & ~$less(sK2,0))),
% 0.45/1.16 introduced(choice_axiom,[])).
% 0.45/1.16
% 0.45/1.16 tff(f150,plain,(
% 0.45/1.16 (power(sK0,sK1) != sK4 & ~$less(0,sK2) & power(sK0,sK1) = $product(sK4,power(sK3,sK2)) & ~$less(sK2,0)) & ~$less(sK1,0)),
% 0.45/1.16 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f145,f149,f148])).
% 0.45/1.16
% 0.45/1.16 tff(f159,plain,(
% 0.45/1.16 ( ! [X0 : $int] : (1 = power(X0,0)) )),
% 0.45/1.16 inference(cnf_transformation,[],[f82])).
% 0.45/1.16
% 0.45/1.16 tff(f193,plain,(
% 0.45/1.16 ~$less(sK2,0)),
% 0.45/1.16 inference(cnf_transformation,[],[f150])).
% 0.45/1.16
% 0.45/1.16 tff(f194,plain,(
% 0.45/1.16 power(sK0,sK1) = $product(sK4,power(sK3,sK2))),
% 0.45/1.16 inference(cnf_transformation,[],[f150])).
% 0.45/1.16
% 0.45/1.16 tff(f195,plain,(
% 0.45/1.16 ~$less(0,sK2)),
% 0.45/1.16 inference(cnf_transformation,[],[f150])).
% 0.45/1.16
% 0.45/1.16 tff(f196,plain,(
% 0.45/1.16 power(sK0,sK1) != sK4),
% 0.45/1.16 inference(cnf_transformation,[],[f150])).
% 0.45/1.16
% 0.45/1.16 cnf(c_53,plain,
% 0.45/1.16 ($product_int(X0_3,1) = X0_3),
% 0.45/1.16 inference(cnf_transformation,[],[f72])).
% 0.45/1.16
% 0.45/1.16 cnf(c_59,plain,
% 0.45/1.16 (X0_3 = X1_3|$less_int(X0_3,X1_3)|$less_int(X1_3,X0_3)),
% 0.45/1.16 inference(cnf_transformation,[],[f66])).
% 0.45/1.16
% 0.45/1.16 cnf(c_75,plain,(power(X0_3,0) = 1),inference(cnf_transformation,[],[f159])).
% 0.45/1.16
% 0.45/1.16 cnf(c_108,negated_conjecture,
% 0.45/1.16 (power(sK0,sK1) != sK4),
% 0.45/1.16 inference(cnf_transformation,[],[f196])).
% 0.45/1.16
% 0.45/1.16 cnf(c_109,negated_conjecture,
% 0.45/1.16 (~$less_int(0,sK2)),
% 0.45/1.16 inference(cnf_transformation,[],[f195])).
% 0.45/1.16
% 0.45/1.16 cnf(c_110,negated_conjecture,
% 0.45/1.16 ($product_int(sK4,power(sK3,sK2)) = power(sK0,sK1)),
% 0.45/1.16 inference(cnf_transformation,[],[f194])).
% 0.45/1.16
% 0.45/1.16 cnf(c_111,negated_conjecture,
% 0.45/1.16 (~$less_int(sK2,0)),
% 0.45/1.16 inference(cnf_transformation,[],[f193])).
% 0.45/1.16
% 0.45/1.16 cnf(c_2319,plain,
% 0.45/1.16 (sK2 = 0|$less_int(0,sK2)),
% 0.45/1.16 inference(superposition,[status(thm)],[c_59,c_111])).
% 0.45/1.16
% 0.45/1.16 cnf(c_2326,plain,
% 0.45/1.16 (sK2 = 0),
% 0.45/1.16 inference(forward_subsumption_resolution,[status(thm)],[c_2319,c_109])).
% 0.45/1.16
% 0.45/1.16 cnf(c_2339,plain,
% 0.45/1.16 ($product_int(sK4,power(sK3,0)) = power(sK0,sK1)),
% 0.45/1.16 inference(demodulation,[status(thm)],[c_110,c_2326])).
% 0.45/1.16
% 0.45/1.16 cnf(c_2410,plain,
% 0.45/1.16 (power(sK0,sK1) = sK4),
% 0.45/1.16 inference(demodulation,[status(thm)],[c_2339,c_53,c_75])).
% 0.45/1.16
% 0.45/1.16 cnf(c_2411,plain,
% 0.45/1.16 ($false),
% 0.45/1.16 inference(forward_subsumption_resolution,[status(thm)],[c_2410,c_108])).
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16 % SZS output end CNFRefutation for theBenchmark.p
% 0.45/1.16
% 0.45/1.16
%------------------------------------------------------------------------------