TSTP Solution File: ARI047_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ARI047_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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:06:09 EDT 2024
% Result : Theorem 0.60s 1.11s
% Output : CNFRefutation 0.60s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : ARI047_1 : TPTP v8.1.2. Released v5.0.0.
% 0.06/0.11 % Command : run_iprover %s %d THM
% 0.10/0.32 % Computer : n032.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Fri May 3 01:09:24 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running TFA theorem proving
% 0.16/0.43 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.60/1.11 % SZS status Started for theBenchmark.p
% 0.60/1.11 % SZS status Theorem for theBenchmark.p
% 0.60/1.11
% 0.60/1.11 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.60/1.11
% 0.60/1.11 ------ iProver source info
% 0.60/1.11
% 0.60/1.11 git: date: 2024-05-02 19:28:25 +0000
% 0.60/1.11 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.60/1.11 git: non_committed_changes: false
% 0.60/1.11
% 0.60/1.11 ------ Parsing...
% 0.60/1.11 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.60/1.11
% 0.60/1.11 ------ Preprocessing...
% 0.60/1.11
% 0.60/1.11 % SZS status Theorem for theBenchmark.p
% 0.60/1.11
% 0.60/1.11 % SZS output start CNFRefutation for theBenchmark.p
% 0.60/1.11
% 0.60/1.11 tff(f1,conjecture,(
% 0.60/1.11 $greatereq(-4,-4)),
% 0.60/1.11 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n4_greatereq_n4)).
% 0.60/1.11
% 0.60/1.11 tff(f2,negated_conjecture,(
% 0.60/1.11 ~$greatereq(-4,-4)),
% 0.60/1.11 inference(negated_conjecture,[],[f1])).
% 0.60/1.11
% 0.60/1.11 tff(f3,plain,(
% 0.60/1.11 ~~$less(-4,-4)),
% 0.60/1.11 inference(theory_normalization,[],[f2])).
% 0.60/1.11
% 0.60/1.11 tff(f9,plain,(
% 0.60/1.11 ( ! [X0 : $int] : (~$less(X0,X0)) )),
% 0.60/1.11 introduced(theory_axiom_145,[])).
% 0.60/1.11
% 0.60/1.11 tff(f16,plain,(
% 0.60/1.11 $less(-4,-4)),
% 0.60/1.11 inference(flattening,[],[f3])).
% 0.60/1.11
% 0.60/1.11 tff(f17,plain,(
% 0.60/1.11 $less(-4,-4)),
% 0.60/1.11 inference(cnf_transformation,[],[f16])).
% 0.60/1.11
% 0.60/1.11 cnf(c_55,plain,
% 0.60/1.11 (~$less_int(X0_3,X0_3)),
% 0.60/1.11 inference(cnf_transformation,[],[f9])).
% 0.60/1.11
% 0.60/1.11 cnf(c_61,negated_conjecture,
% 0.60/1.11 ($less_int(-4,-4)),
% 0.60/1.11 inference(cnf_transformation,[],[f17])).
% 0.60/1.11
% 0.60/1.11 cnf(c_64,plain,
% 0.60/1.11 (~$less_int(-4,-4)),
% 0.60/1.11 inference(instantiation,[status(thm)],[c_55])).
% 0.60/1.11
% 0.60/1.11 cnf(c_65,plain,($false),inference(prop_impl_just,[status(thm)],[c_64,c_61])).
% 0.60/1.11
% 0.60/1.11
% 0.60/1.11 % SZS output end CNFRefutation for theBenchmark.p
% 0.60/1.11
% 0.60/1.11
%------------------------------------------------------------------------------