TSTP Solution File: ARI734_1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : ARI734_1 : TPTP v8.1.2. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.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 : Wed Aug 30 17:41:54 EDT 2023
% Result : Theorem 1.31s 1.15s
% Output : CNFRefutation 1.31s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ARI734_1 : TPTP v8.1.2. Released v6.4.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n019.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 : Tue Aug 29 18:33:43 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running TFA theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.31/1.15 % SZS status Started for theBenchmark.p
% 1.31/1.15 % SZS status Theorem for theBenchmark.p
% 1.31/1.15
% 1.31/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.31/1.15
% 1.31/1.15 ------ iProver source info
% 1.31/1.15
% 1.31/1.15 git: date: 2023-05-31 18:12:56 +0000
% 1.31/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.31/1.15 git: non_committed_changes: false
% 1.31/1.15 git: last_make_outside_of_git: false
% 1.31/1.15
% 1.31/1.15 ------ Parsing...
% 1.31/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.31/1.15
% 1.31/1.15 ------ Preprocessing...
% 1.31/1.15
% 1.31/1.15 % SZS status Theorem for theBenchmark.p
% 1.31/1.15
% 1.31/1.15 % SZS output start CNFRefutation for theBenchmark.p
% 1.31/1.15
% 1.31/1.15 tff(f1,conjecture,(
% 1.31/1.15 ! [X0 : $int] : ($greatereq(X0,0) => ? [X1 : $int] : ($product(2,X0) = X1 & ? [X2 : $int] : ((0 != X0 => $sum(X2,2) = X1) & (0 = X0 => 0 = X1) & ? [X3 : $int] : ($product(2,X3) = X2 & $difference(X0,1) = X3))))),
% 1.31/1.15 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula)).
% 1.31/1.15
% 1.31/1.15 tff(f2,negated_conjecture,(
% 1.31/1.15 ~! [X0 : $int] : ($greatereq(X0,0) => ? [X1 : $int] : ($product(2,X0) = X1 & ? [X2 : $int] : ((0 != X0 => $sum(X2,2) = X1) & (0 = X0 => 0 = X1) & ? [X3 : $int] : ($product(2,X3) = X2 & $difference(X0,1) = X3))))),
% 1.31/1.15 inference(negated_conjecture,[],[f1])).
% 1.31/1.15
% 1.31/1.15 tff(f3,plain,(
% 1.31/1.15 ~! [X0 : $int] : (~$less(X0,0) => ? [X1 : $int] : ($product(2,X0) = X1 & ? [X2 : $int] : ((0 != X0 => $sum(X2,2) = X1) & (0 = X0 => 0 = X1) & ? [X3 : $int] : ($product(2,X3) = X2 & $sum(X0,$uminus(1)) = X3))))),
% 1.31/1.15 inference(theory_normalization,[],[f2])).
% 1.31/1.15
% 1.31/1.15 tff(f4,plain,(
% 1.31/1.15 ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 1.31/1.15 introduced(theory_axiom_138,[])).
% 1.31/1.15
% 1.31/1.15 tff(f5,plain,(
% 1.31/1.15 ( ! [X2 : $int,X0 : $int,X1 : $int] : ($sum(X0,$sum(X1,X2)) = $sum($sum(X0,X1),X2)) )),
% 1.31/1.15 introduced(theory_axiom_139,[])).
% 1.31/1.15
% 1.31/1.15 tff(f15,plain,(
% 1.31/1.15 ( ! [X0 : $int,X1 : $int] : ($product(X0,X1) = $product(X1,X0)) )),
% 1.31/1.15 introduced(theory_axiom_138,[])).
% 1.31/1.15
% 1.31/1.15 tff(f16,plain,(
% 1.31/1.15 ( ! [X2 : $int,X0 : $int,X1 : $int] : ($product(X0,$product(X1,X2)) = $product($product(X0,X1),X2)) )),
% 1.31/1.15 introduced(theory_axiom_139,[])).
% 1.31/1.15
% 1.31/1.15 tff(f22,plain,(
% 1.31/1.15 ? [X0 : $int] : (! [X1 : $int] : ($product(2,X0) != X1 | ! [X2 : $int] : (($sum(X2,2) != X1 & 0 != X0) | (0 != X1 & 0 = X0) | ! [X3 : $int] : ($product(2,X3) != X2 | $sum(X0,$uminus(1)) != X3))) & ~$less(X0,0))),
% 1.31/1.15 inference(ennf_transformation,[],[f3])).
% 1.31/1.15
% 1.31/1.15 tff(f23,plain,(
% 1.31/1.15 ? [X0 : $int] : (! [X1 : $int] : ($product(2,X0) != X1 | ! [X2 : $int] : (($sum(X2,2) != X1 & 0 != X0) | (0 != X1 & 0 = X0) | ! [X3 : $int] : ($product(2,X3) != X2 | $sum(X0,$uminus(1)) != X3))) & ~$less(X0,0)) => (! [X1 : $int] : ($product(2,sK0) != X1 | ! [X2 : $int] : (($sum(X2,2) != X1 & 0 != sK0) | (0 != X1 & 0 = sK0) | ! [X3 : $int] : ($product(2,X3) != X2 | $sum(sK0,$uminus(1)) != X3))) & ~$less(sK0,0))),
% 1.31/1.15 introduced(choice_axiom,[])).
% 1.31/1.15
% 1.31/1.15 tff(f24,plain,(
% 1.31/1.15 ! [X1 : $int] : ($product(2,sK0) != X1 | ! [X2 : $int] : (($sum(X2,2) != X1 & 0 != sK0) | (0 != X1 & 0 = sK0) | ! [X3 : $int] : ($product(2,X3) != X2 | $sum(sK0,$uminus(1)) != X3))) & ~$less(sK0,0)),
% 1.31/1.15 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f22,f23])).
% 1.31/1.15
% 1.31/1.15 tff(f27,plain,(
% 1.31/1.15 ( ! [X2 : $int,X3 : $int,X1 : $int] : ($product(2,sK0) != X1 | 0 != sK0 | 0 != X1 | $product(2,X3) != X2 | $sum(sK0,$uminus(1)) != X3) )),
% 1.31/1.15 inference(cnf_transformation,[],[f24])).
% 1.31/1.15
% 1.31/1.15 tff(f28,plain,(
% 1.31/1.15 ( ! [X2 : $int,X3 : $int,X1 : $int] : ($product(2,sK0) != X1 | $sum(X2,2) != X1 | 0 = sK0 | $product(2,X3) != X2 | $sum(sK0,$uminus(1)) != X3) )),
% 1.31/1.15 inference(cnf_transformation,[],[f24])).
% 1.31/1.15
% 1.31/1.15 tff(f34,plain,(
% 1.31/1.15 ( ! [X2 : $int,X3 : $int] : ($sum(X2,2) != $product(2,sK0) | 0 = sK0 | $product(2,X3) != X2 | $sum(sK0,$uminus(1)) != X3) )),
% 1.31/1.15 inference(equality_resolution,[],[f28])).
% 1.31/1.15
% 1.31/1.15 tff(f35,plain,(
% 1.31/1.15 ( ! [X3 : $int] : ($product(2,sK0) != $sum($product(2,X3),2) | 0 = sK0 | $sum(sK0,$uminus(1)) != X3) )),
% 1.31/1.15 inference(equality_resolution,[],[f34])).
% 1.31/1.15
% 1.31/1.15 tff(f36,plain,(
% 1.31/1.15 $product(2,sK0) != $sum($product(2,$sum(sK0,$uminus(1))),2) | 0 = sK0),
% 1.31/1.15 inference(equality_resolution,[],[f35])).
% 1.31/1.15
% 1.31/1.15 tff(f37,plain,(
% 1.31/1.15 ( ! [X2 : $int,X3 : $int] : (0 != sK0 | 0 != $product(2,sK0) | $product(2,X3) != X2 | $sum(sK0,$uminus(1)) != X3) )),
% 1.31/1.15 inference(equality_resolution,[],[f27])).
% 1.31/1.15
% 1.31/1.15 tff(f38,plain,(
% 1.31/1.15 ( ! [X3 : $int] : (0 != sK0 | 0 != $product(2,sK0) | $sum(sK0,$uminus(1)) != X3) )),
% 1.31/1.15 inference(equality_resolution,[],[f37])).
% 1.31/1.15
% 1.31/1.15 tff(f39,plain,(
% 1.31/1.15 0 != sK0 | 0 != $product(2,sK0)),
% 1.31/1.15 inference(equality_resolution,[],[f38])).
% 1.31/1.15
% 1.31/1.15 cnf(c_54,plain,
% 1.31/1.15 ($product_int($product_int(X0_3,X1_3),X2_3) = $product_int(X0_3,$product_int(X1_3,X2_3))),
% 1.31/1.15 inference(cnf_transformation,[],[f16])).
% 1.31/1.15
% 1.31/1.15 cnf(c_55,plain,
% 1.31/1.15 ($product_int(X0_3,X1_3) = $product_int(X1_3,X0_3)),
% 1.31/1.15 inference(cnf_transformation,[],[f15])).
% 1.31/1.15
% 1.31/1.15 cnf(c_65,plain,
% 1.31/1.15 ($sum_int($sum_int(X0_3,X1_3),X2_3) = $sum_int(X0_3,$sum_int(X1_3,X2_3))),
% 1.31/1.15 inference(cnf_transformation,[],[f5])).
% 1.31/1.15
% 1.31/1.15 cnf(c_66,plain,
% 1.31/1.15 ($sum_int(X0_3,X1_3) = $sum_int(X1_3,X0_3)),
% 1.31/1.15 inference(cnf_transformation,[],[f4])).
% 1.31/1.15
% 1.31/1.15 cnf(c_68,negated_conjecture,
% 1.31/1.15 ($sum_int($product_int(2,$sum_int(sK0,$uminus_int(1))),2) != $product_int(2,sK0)|
% 1.31/1.15 sK0 = 0),
% 1.31/1.15 inference(cnf_transformation,[],[f36])).
% 1.31/1.15
% 1.31/1.15 cnf(c_69,negated_conjecture,
% 1.31/1.15 ($product_int(2,sK0) != 0|sK0 != 0),
% 1.31/1.15 inference(cnf_transformation,[],[f39])).
% 1.31/1.15
% 1.31/1.15 cnf(c_89,negated_conjecture,
% 1.31/1.15 ($sum_int(2,$product_int(2,$sum_int(sK0,$uminus_int(1)))) != $product_int(sK0,2)|
% 1.31/1.15 sK0 = 0),
% 1.31/1.15 inference(theory_normalisation,[status(thm)],[c_68,c_54,c_55,c_65,c_66])).
% 1.31/1.15
% 1.31/1.15 cnf(c_90,negated_conjecture,
% 1.31/1.15 ($product_int(sK0,2) != 0|sK0 != 0),
% 1.31/1.15 inference(theory_normalisation,[status(thm)],[c_69,c_54,c_55,c_65,c_66])).
% 1.31/1.15
% 1.31/1.15 cnf(c_97,plain,
% 1.31/1.15 (sK0 != 0|$product_int(sK0,2) != 0),
% 1.31/1.15 inference(prop_impl_just,[status(thm)],[c_90])).
% 1.31/1.15
% 1.31/1.15 cnf(c_98,plain,
% 1.31/1.15 ($product_int(sK0,2) != 0|sK0 != 0),
% 1.31/1.15 inference(renaming,[status(thm)],[c_97])).
% 1.31/1.15
% 1.31/1.15 cnf(c_99,plain,
% 1.31/1.15 (sK0 = 0|$sum_int(2,$product_int(2,$sum_int(sK0,$uminus_int(1)))) != $product_int(sK0,2)),
% 1.31/1.15 inference(prop_impl_just,[status(thm)],[c_89])).
% 1.31/1.15
% 1.31/1.15 cnf(c_100,plain,
% 1.31/1.15 ($sum_int(2,$product_int(2,$sum_int(sK0,$uminus_int(1)))) != $product_int(sK0,2)|
% 1.31/1.15 sK0 = 0),
% 1.31/1.15 inference(renaming,[status(thm)],[c_99])).
% 1.31/1.15
% 1.31/1.15 cnf(c_236,plain,
% 1.31/1.15 (sK0 != 0),
% 1.31/1.15 inference(smt_theory_normalisation,[status(thm)],[c_98])).
% 1.31/1.15
% 1.31/1.15 cnf(c_243,plain,
% 1.31/1.15 (sK0 = 0),
% 1.31/1.15 inference(smt_theory_normalisation,[status(thm)],[c_100])).
% 1.31/1.15
% 1.31/1.15 cnf(c_244,plain,
% 1.31/1.15 ($false),
% 1.31/1.15 inference(forward_subsumption_resolution,[status(thm)],[c_243,c_236])).
% 1.31/1.15
% 1.31/1.15
% 1.31/1.15 % SZS output end CNFRefutation for theBenchmark.p
% 1.31/1.15
% 1.31/1.15
%------------------------------------------------------------------------------