TSTP Solution File: ARI576_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ARI576_1 : TPTP v8.1.2. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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 May 3 02:07:17 EDT 2024
% Result : Theorem 1.68s 1.18s
% Output : CNFRefutation 1.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : ARI576_1 : TPTP v8.1.2. Released v5.1.0.
% 0.03/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 01:04:04 EDT 2024
% 0.14/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 --heuristic_context casc_unsat /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.68/1.18 % SZS status Started for theBenchmark.p
% 1.68/1.18 % SZS status Theorem for theBenchmark.p
% 1.68/1.18
% 1.68/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.68/1.18
% 1.68/1.18 ------ iProver source info
% 1.68/1.18
% 1.68/1.18 git: date: 2024-05-02 19:28:25 +0000
% 1.68/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.68/1.18 git: non_committed_changes: false
% 1.68/1.18
% 1.68/1.18 ------ Parsing...
% 1.68/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.68/1.18
% 1.68/1.18 ------ Preprocessing... sup_sim: 2 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 1.68/1.18
% 1.68/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.68/1.18
% 1.68/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.68/1.18 ------ Proving...
% 1.68/1.18 ------ Problem Properties
% 1.68/1.18
% 1.68/1.18
% 1.68/1.18 clauses 23
% 1.68/1.18 conjectures 0
% 1.68/1.18 EPR 9
% 1.68/1.18 Horn 19
% 1.68/1.18 unary 17
% 1.68/1.18 binary 3
% 1.68/1.18 lits 32
% 1.68/1.18 lits eq 15
% 1.68/1.18 fd_pure 0
% 1.68/1.18 fd_pseudo 0
% 1.68/1.18 fd_cond 0
% 1.68/1.18 fd_pseudo_cond 2
% 1.68/1.18 AC symbols 2
% 1.68/1.18
% 1.68/1.18 ------ Input Options Time Limit: Unbounded
% 1.68/1.18
% 1.68/1.18
% 1.68/1.18 ------
% 1.68/1.18 Current options:
% 1.68/1.18 ------
% 1.68/1.18
% 1.68/1.18
% 1.68/1.18
% 1.68/1.18
% 1.68/1.18 ------ Proving...
% 1.68/1.18
% 1.68/1.18
% 1.68/1.18 % SZS status Theorem for theBenchmark.p
% 1.68/1.18
% 1.68/1.18 % SZS output start CNFRefutation for theBenchmark.p
% 1.68/1.18
% 1.68/1.18 tff(f1,conjecture,(
% 1.68/1.18 ? [X0 : $int] : ($lesseq(29,$product(3,X0)) & $lesseq($product(2,X0),21))),
% 1.68/1.18 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ineq_sys_solvable_1)).
% 1.68/1.18
% 1.68/1.18 tff(f2,negated_conjecture,(
% 1.68/1.18 ~? [X0 : $int] : ($lesseq(29,$product(3,X0)) & $lesseq($product(2,X0),21))),
% 1.68/1.18 inference(negated_conjecture,[],[f1])).
% 1.68/1.18
% 1.68/1.18 tff(f3,plain,(
% 1.68/1.18 ~? [X0 : $int] : (~$less($product(3,X0),29) & ~$less(21,$product(2,X0)))),
% 1.68/1.18 inference(theory_normalization,[],[f2])).
% 1.68/1.18
% 1.68/1.18 tff(f9,plain,(
% 1.68/1.18 ( ! [X0 : $int] : (~$less(X0,X0)) )),
% 1.68/1.18 introduced(theory_axiom_145,[])).
% 1.68/1.18
% 1.68/1.18 tff(f22,plain,(
% 1.68/1.18 ! [X0 : $int] : ($less($product(3,X0),29) | $less(21,$product(2,X0)))),
% 1.68/1.18 inference(ennf_transformation,[],[f3])).
% 1.68/1.18
% 1.68/1.18 tff(f23,plain,(
% 1.68/1.18 ( ! [X0 : $int] : ($less($product(3,X0),29) | $less(21,$product(2,X0))) )),
% 1.68/1.18 inference(cnf_transformation,[],[f22])).
% 1.68/1.18
% 1.68/1.18 cnf(c_61,plain,
% 1.68/1.18 (~$less_int(X0_3,X0_3)),
% 1.68/1.18 inference(cnf_transformation,[],[f9])).
% 1.68/1.18
% 1.68/1.18 cnf(c_67,negated_conjecture,
% 1.68/1.18 ($less_int($product_int(3,X0_3),29)|$less_int(21,$product_int(2,X0_3))),
% 1.68/1.18 inference(cnf_transformation,[],[f23])).
% 1.68/1.18
% 1.68/1.18 cnf(c_95,plain,
% 1.68/1.18 ($less_int($product_int(3,X0_3),29)|$less_int(21,$product_int(2,X0_3))),
% 1.68/1.18 inference(prop_impl_just,[status(thm)],[c_67])).
% 1.68/1.18
% 1.68/1.18 cnf(c_205,plain,
% 1.68/1.18 ($less_int(X0_3,10)|$less_int(10,X0_3)),
% 1.68/1.18 inference(smt_theory_normalisation,[status(thm)],[c_95])).
% 1.68/1.18
% 1.68/1.18 cnf(c_245,plain,
% 1.68/1.18 ($less_int(X0_3,10)|$less_int(10,X0_3)),
% 1.68/1.18 inference(prop_impl_just,[status(thm)],[c_205])).
% 1.68/1.18
% 1.68/1.18 cnf(c_702,plain,
% 1.68/1.18 ($less_int(10,10)),
% 1.68/1.18 inference(superposition,[status(thm)],[c_245,c_61])).
% 1.68/1.18
% 1.68/1.18 cnf(c_706,plain,
% 1.68/1.18 ($false),
% 1.68/1.18 inference(forward_subsumption_resolution,[status(thm)],[c_702,c_61])).
% 1.68/1.18
% 1.68/1.18
% 1.68/1.18 % SZS output end CNFRefutation for theBenchmark.p
% 1.68/1.18
% 1.68/1.18
%------------------------------------------------------------------------------