TSTP Solution File: SWW652_2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWW652_2 : TPTP v8.2.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% 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 Jun 24 18:17:54 EDT 2024
% Result : Theorem 0.48s 1.15s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWW652_2 : TPTP v8.2.0. Released v6.1.0.
% 0.07/0.12 % Command : run_iprover %s %d THM
% 0.13/0.33 % Computer : n016.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jun 19 06:53:24 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.21/0.47 Running TFA theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa --heuristic_context casc_unsat /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.48/1.15 % SZS status Started for theBenchmark.p
% 0.48/1.15 % SZS status Theorem for theBenchmark.p
% 0.48/1.15
% 0.48/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.48/1.15
% 0.48/1.15 ------ iProver source info
% 0.48/1.15
% 0.48/1.15 git: date: 2024-06-12 09:56:46 +0000
% 0.48/1.15 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 0.48/1.15 git: non_committed_changes: false
% 0.48/1.15
% 0.48/1.15 ------ Parsing...
% 0.48/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.48/1.15
% 0.48/1.15 ------ Preprocessing... sf_s rm: 26 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 15 0s sf_e pe_s pe_e
% 0.48/1.15
% 0.48/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.15
% 0.48/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.48/1.15 ------ Proving...
% 0.48/1.15 ------ Problem Properties
% 0.48/1.15
% 0.48/1.15
% 0.48/1.15 clauses 51
% 0.48/1.15 conjectures 9
% 0.48/1.15 EPR 15
% 0.48/1.15 Horn 39
% 0.48/1.15 unary 24
% 0.48/1.15 binary 14
% 0.48/1.15 lits 100
% 0.48/1.15 lits eq 32
% 0.48/1.15 fd_pure 1
% 0.48/1.15 fd_pseudo 0
% 0.48/1.15 fd_cond 0
% 0.48/1.15 fd_pseudo_cond 3
% 0.48/1.15 AC symbols 2
% 0.48/1.15
% 0.48/1.15 ------ Input Options Time Limit: Unbounded
% 0.48/1.15
% 0.48/1.15
% 0.48/1.15 ------
% 0.48/1.15 Current options:
% 0.48/1.15 ------
% 0.48/1.15
% 0.48/1.15
% 0.48/1.15
% 0.48/1.15
% 0.48/1.15 ------ Proving...
% 0.48/1.15
% 0.48/1.15
% 0.48/1.15 % SZS status Theorem for theBenchmark.p
% 0.48/1.15
% 0.48/1.15 % SZS output start CNFRefutation for theBenchmark.p
% 0.48/1.15
% 0.48/1.15 tff(f5,axiom,(
% 0.48/1.15 true1 != false1),
% 0.48/1.15 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',true_False)).
% 0.48/1.15
% 0.48/1.15 tff(f20,axiom,(
% 0.48/1.15 ! [X11 : graph1,X1 : $int] : path1(X11,X1,X1)),
% 0.48/1.15 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',path_refl)).
% 0.48/1.15
% 0.48/1.15 tff(f24,conjecture,(
% 0.48/1.15 ! [X14 : $int,X1 : $int,X7 : $int] : ($lesseq(0,X14) => (($less(X1,X14) & $lesseq(0,X1)) => (($less(X7,X14) & $lesseq(0,X7)) => $less($sum($product(X1,X14),X7),$product(X14,X14)))))),
% 0.48/1.15 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ineq1)).
% 0.48/1.15
% 0.48/1.15 tff(f25,negated_conjecture,(
% 0.48/1.15 ~! [X14 : $int,X1 : $int,X7 : $int] : ($lesseq(0,X14) => (($less(X1,X14) & $lesseq(0,X1)) => (($less(X7,X14) & $lesseq(0,X7)) => $less($sum($product(X1,X14),X7),$product(X14,X14)))))),
% 0.48/1.15 inference(negated_conjecture,[],[f24])).
% 0.48/1.15
% 0.48/1.15 tff(f30,plain,(
% 0.48/1.15 ~! [X14 : $int,X1 : $int,X7 : $int] : (~$less(X14,0) => (($less(X1,X14) & ~$less(X1,0)) => (($less(X7,X14) & ~$less(X7,0)) => $less($sum($product(X1,X14),X7),$product(X14,X14)))))),
% 0.48/1.15 inference(theory_normalization,[],[f25])).
% 0.48/1.15
% 0.48/1.15 tff(f33,plain,(
% 0.48/1.15 ( ! [X0 : $int] : ($sum(X0,0) = X0) )),
% 0.48/1.15 introduced(theory_axiom_140,[])).
% 0.48/1.15
% 0.48/1.15 tff(f36,plain,(
% 0.48/1.15 ( ! [X0 : $int] : (~$less(X0,X0)) )),
% 0.48/1.15 introduced(theory_axiom_145,[])).
% 0.48/1.15
% 0.48/1.15 tff(f41,plain,(
% 0.48/1.15 ( ! [X0 : $int] : ($uminus($uminus(X0)) = X0) )),
% 0.48/1.15 introduced(theory_axiom_151,[])).
% 0.48/1.15
% 0.48/1.15 tff(f44,plain,(
% 0.48/1.15 ( ! [X0 : $int] : ($product(X0,1) = X0) )),
% 0.48/1.15 introduced(theory_axiom_140,[])).
% 0.48/1.15
% 0.48/1.15 tff(f45,plain,(
% 0.48/1.15 ( ! [X0 : $int] : (0 = $product(X0,0)) )),
% 0.48/1.15 introduced(theory_axiom_152,[])).
% 0.48/1.15
% 0.48/1.15 tff(f63,plain,(
% 0.48/1.15 ! [X0 : graph1,X1 : $int] : path1(X0,X1,X1)),
% 0.48/1.15 inference(rectify,[],[f20])).
% 0.48/1.15
% 0.48/1.15 tff(f67,plain,(
% 0.48/1.15 ~! [X0 : $int,X1 : $int,X2 : $int] : (~$less(X0,0) => (($less(X1,X0) & ~$less(X1,0)) => (($less(X2,X0) & ~$less(X2,0)) => $less($sum($product(X1,X0),X2),$product(X0,X0)))))),
% 0.48/1.15 inference(rectify,[],[f30])).
% 0.48/1.15
% 0.48/1.15 tff(f87,plain,(
% 0.48/1.15 ? [X0 : $int,X1 : $int,X2 : $int] : (((~$less($sum($product(X1,X0),X2),$product(X0,X0)) & ($less(X2,X0) & ~$less(X2,0))) & ($less(X1,X0) & ~$less(X1,0))) & ~$less(X0,0))),
% 0.48/1.15 inference(ennf_transformation,[],[f67])).
% 0.48/1.15
% 0.48/1.15 tff(f88,plain,(
% 0.48/1.15 ? [X0 : $int,X1 : $int,X2 : $int] : (~$less($sum($product(X1,X0),X2),$product(X0,X0)) & $less(X2,X0) & ~$less(X2,0) & $less(X1,X0) & ~$less(X1,0) & ~$less(X0,0))),
% 0.48/1.15 inference(flattening,[],[f87])).
% 0.48/1.15
% 0.48/1.15 tff(f106,plain,(
% 0.48/1.15 ? [X0 : $int,X1 : $int,X2 : $int] : (~$less($sum($product(X1,X0),X2),$product(X0,X0)) & $less(X2,X0) & ~$less(X2,0) & $less(X1,X0) & ~$less(X1,0) & ~$less(X0,0)) => (~$less($sum($product(sK13,sK12),sK14),$product(sK12,sK12)) & $less(sK14,sK12) & ~$less(sK14,0) & $less(sK13,sK12) & ~$less(sK13,0) & ~$less(sK12,0))),
% 0.48/1.15 introduced(choice_axiom,[])).
% 0.48/1.15
% 0.48/1.15 tff(f107,plain,(
% 0.48/1.15 ~$less($sum($product(sK13,sK12),sK14),$product(sK12,sK12)) & $less(sK14,sK12) & ~$less(sK14,0) & $less(sK13,sK12) & ~$less(sK13,0) & ~$less(sK12,0)),
% 0.48/1.15 inference(skolemisation,[status(esa),new_symbols(skolem,[sK12,sK13,sK14])],[f88,f106])).
% 0.48/1.15
% 0.48/1.15 tff(f112,plain,(
% 0.48/1.15 true1 != false1),
% 0.48/1.15 inference(cnf_transformation,[],[f5])).
% 0.48/1.15
% 0.48/1.15 tff(f129,plain,(
% 0.48/1.15 ( ! [X0 : graph1,X1 : $int] : (path1(X0,X1,X1)) )),
% 0.48/1.15 inference(cnf_transformation,[],[f63])).
% 0.48/1.15
% 0.48/1.15 tff(f144,plain,(
% 0.48/1.15 ~$less(sK12,0)),
% 0.48/1.15 inference(cnf_transformation,[],[f107])).
% 0.48/1.15
% 0.48/1.15 tff(f145,plain,(
% 0.48/1.15 ~$less(sK13,0)),
% 0.48/1.15 inference(cnf_transformation,[],[f107])).
% 0.48/1.15
% 0.48/1.15 tff(f146,plain,(
% 0.48/1.15 $less(sK13,sK12)),
% 0.48/1.15 inference(cnf_transformation,[],[f107])).
% 0.48/1.15
% 0.48/1.15 tff(f147,plain,(
% 0.48/1.15 ~$less(sK14,0)),
% 0.48/1.15 inference(cnf_transformation,[],[f107])).
% 0.48/1.15
% 0.48/1.15 tff(f148,plain,(
% 0.48/1.15 $less(sK14,sK12)),
% 0.48/1.15 inference(cnf_transformation,[],[f107])).
% 0.48/1.15
% 0.48/1.15 tff(f149,plain,(
% 0.48/1.15 ~$less($sum($product(sK13,sK12),sK14),$product(sK12,sK12))),
% 0.48/1.15 inference(cnf_transformation,[],[f107])).
% 0.48/1.15
% 0.48/1.15 cnf(c_52,plain,
% 0.48/1.15 ($product_int(X0_3,0) = 0),
% 0.48/1.15 inference(cnf_transformation,[],[f45])).
% 0.48/1.15
% 0.48/1.15 cnf(c_53,plain,
% 0.48/1.15 ($product_int(X0_3,1) = X0_3),
% 0.48/1.15 inference(cnf_transformation,[],[f44])).
% 0.48/1.15
% 0.48/1.15 cnf(c_56,plain,
% 0.48/1.15 ($uminus_int($uminus_int(X0_3)) = X0_3),
% 0.48/1.15 inference(cnf_transformation,[],[f41])).
% 0.48/1.15
% 0.48/1.15 cnf(c_61,negated_conjecture,
% 0.48/1.15 (~$less_int(X0_3,X0_3)),
% 0.48/1.15 inference(cnf_transformation,[],[f36])).
% 0.48/1.15
% 0.48/1.15 cnf(c_64,plain,
% 0.48/1.15 ($sum_int(X0_3,0) = X0_3),
% 0.48/1.15 inference(cnf_transformation,[],[f33])).
% 0.48/1.15
% 0.48/1.15 cnf(c_71,negated_conjecture,
% 0.48/1.15 (true1 != false1),
% 0.48/1.15 inference(cnf_transformation,[],[f112])).
% 0.48/1.15
% 0.48/1.15 cnf(c_88,plain,
% 0.48/1.15 (path1(X0_19,X0_3,X0_3)),
% 0.48/1.15 inference(cnf_transformation,[],[f129])).
% 0.48/1.15
% 0.48/1.15 cnf(c_103,negated_conjecture,
% 0.48/1.15 (~$less_int($sum_int($product_int(sK13,sK12),sK14),$product_int(sK12,sK12))),
% 0.48/1.15 inference(cnf_transformation,[],[f149])).
% 0.48/1.15
% 0.48/1.15 cnf(c_104,negated_conjecture,
% 0.48/1.15 ($less_int(sK14,sK12)),
% 0.48/1.15 inference(cnf_transformation,[],[f148])).
% 0.48/1.15
% 0.48/1.15 cnf(c_105,negated_conjecture,
% 0.48/1.15 (~$less_int(sK14,0)),
% 0.48/1.15 inference(cnf_transformation,[],[f147])).
% 0.48/1.15
% 0.48/1.15 cnf(c_106,negated_conjecture,
% 0.48/1.15 ($less_int(sK13,sK12)),
% 0.48/1.15 inference(cnf_transformation,[],[f146])).
% 0.48/1.15
% 0.48/1.15 cnf(c_107,negated_conjecture,
% 0.48/1.15 (~$less_int(sK13,0)),
% 0.48/1.15 inference(cnf_transformation,[],[f145])).
% 0.48/1.15
% 0.48/1.15 cnf(c_108,negated_conjecture,
% 0.48/1.15 (~$less_int(sK12,0)),
% 0.48/1.15 inference(cnf_transformation,[],[f144])).
% 0.48/1.15
% 0.48/1.15 cnf(c_109,plain,($less_int(0,1)),theory(arith)).
% 0.48/1.15
% 0.48/1.15 cnf(c_1921,plain,($product_int(sK13,sK12) = sP0_iProver_def),definition).
% 0.48/1.15
% 0.48/1.15 cnf(c_1922,plain,
% 0.48/1.15 ($sum_int(sP0_iProver_def,sK14) = sP1_iProver_def),
% 0.48/1.15 definition).
% 0.48/1.15
% 0.48/1.15 cnf(c_1923,plain,($product_int(sK12,sK12) = sP2_iProver_def),definition).
% 0.48/1.15
% 0.48/1.15 cnf(c_1924,negated_conjecture,
% 0.48/1.15 (~$less_int(sK12,0)),
% 0.48/1.15 inference(demodulation,[status(thm)],[c_108])).
% 0.48/1.15
% 0.48/1.15 cnf(c_1925,negated_conjecture,
% 0.48/1.15 (~$less_int(sK13,0)),
% 0.48/1.15 inference(demodulation,[status(thm)],[c_107])).
% 0.48/1.15
% 0.48/1.15 cnf(c_1926,negated_conjecture,
% 0.48/1.15 ($less_int(sK13,sK12)),
% 0.48/1.15 inference(demodulation,[status(thm)],[c_106])).
% 0.48/1.15
% 0.48/1.15 cnf(c_1927,negated_conjecture,
% 0.48/1.15 (~$less_int(sK14,0)),
% 0.48/1.15 inference(demodulation,[status(thm)],[c_105])).
% 0.48/1.15
% 0.48/1.15 cnf(c_1928,negated_conjecture,
% 0.48/1.15 ($less_int(sK14,sK12)),
% 0.48/1.15 inference(demodulation,[status(thm)],[c_104])).
% 0.48/1.15
% 0.48/1.15 cnf(c_1929,negated_conjecture,
% 0.48/1.15 (~$less_int(sP1_iProver_def,sP2_iProver_def)),
% 0.48/1.15 inference(demodulation,[status(thm)],[c_103,c_1923,c_1921,c_1922])).
% 0.48/1.15
% 0.48/1.15 cnf(c_1930,negated_conjecture,
% 0.48/1.15 (true1 != false1),
% 0.48/1.15 inference(demodulation,[status(thm)],[c_71])).
% 0.48/1.15
% 0.48/1.15 cnf(c_1931,negated_conjecture,
% 0.48/1.15 (~$less_int(X0_3,X0_3)),
% 0.48/1.15 inference(demodulation,[status(thm)],[c_61])).
% 0.48/1.15
% 0.48/1.15 cnf(c_2784,plain,
% 0.48/1.15 ($false),
% 0.48/1.15 inference(smt_impl_just,
% 0.48/1.15 [status(thm)],
% 0.48/1.15 [c_1929,c_1922,c_1921,c_109,c_1924,c_1925,c_1926,c_1927,
% 0.48/1.15 c_1928,c_88,c_1930,c_64,c_1931,c_56,c_53,c_52])).
% 0.48/1.15
% 0.48/1.15
% 0.48/1.15 % SZS output end CNFRefutation for theBenchmark.p
% 0.48/1.15
% 0.48/1.15
%------------------------------------------------------------------------------