TSTP Solution File: ARI006_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ARI006_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n031.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:02 EDT 2024
% Result : Theorem 0.69s 1.13s
% Output : CNFRefutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : ARI006_1 : TPTP v8.1.2. Released v5.0.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.12/0.32 % Computer : n031.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Fri May 3 01:32:01 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.17/0.45 Running TFA theorem proving
% 0.17/0.45 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.69/1.13 % SZS status Started for theBenchmark.p
% 0.69/1.13 % SZS status Theorem for theBenchmark.p
% 0.69/1.13
% 0.69/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.69/1.13
% 0.69/1.13 ------ iProver source info
% 0.69/1.13
% 0.69/1.13 git: date: 2024-05-02 19:28:25 +0000
% 0.69/1.13 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.69/1.13 git: non_committed_changes: false
% 0.69/1.13
% 0.69/1.13 ------ Parsing...
% 0.69/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.69/1.13
% 0.69/1.13 ------ Preprocessing...
% 0.69/1.13
% 0.69/1.13 % SZS status Theorem for theBenchmark.p
% 0.69/1.13
% 0.69/1.13 % SZS output start CNFRefutation for theBenchmark.p
% 0.69/1.13
% 0.69/1.13 tff(f1,conjecture,(
% 0.69/1.13 ? [X0 : $int,X1 : $int] : $less(X0,X1)),
% 0.69/1.13 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',something_less_something)).
% 0.69/1.13
% 0.69/1.13 tff(f2,negated_conjecture,(
% 0.69/1.13 ~? [X0 : $int,X1 : $int] : $less(X0,X1)),
% 0.69/1.13 inference(negated_conjecture,[],[f1])).
% 0.69/1.13
% 0.69/1.13 tff(f11,plain,(
% 0.69/1.13 ( ! [X2 : $int,X0 : $int,X1 : $int] : (~$less(X0,X1) | $less($sum(X0,X2),$sum(X1,X2))) )),
% 0.69/1.13 introduced(theory_axiom_148,[])).
% 0.69/1.13
% 0.69/1.13 tff(f15,plain,(
% 0.69/1.13 ! [X0 : $int,X1 : $int] : ~$less(X0,X1)),
% 0.69/1.13 inference(ennf_transformation,[],[f2])).
% 0.69/1.13
% 0.69/1.13 tff(f16,plain,(
% 0.69/1.13 ( ! [X0 : $int,X1 : $int] : (~$less(X0,X1)) )),
% 0.69/1.13 inference(cnf_transformation,[],[f15])).
% 0.69/1.13
% 0.69/1.13 cnf(c_52,plain,
% 0.69/1.13 (~$less_int(X0_3,X1_3)|$less_int($sum_int(X0_3,X2_3),$sum_int(X1_3,X2_3))),
% 0.69/1.13 inference(cnf_transformation,[],[f11])).
% 0.69/1.13
% 0.69/1.13 cnf(c_61,negated_conjecture,
% 0.69/1.13 (~$less_int(X0_3,X1_3)),
% 0.69/1.13 inference(cnf_transformation,[],[f16])).
% 0.69/1.13
% 0.69/1.13 cnf(c_62,plain,($less_int(0,1)),theory(arith)).
% 0.69/1.13
% 0.69/1.13 cnf(c_76,plain,
% 0.69/1.13 (~$less_int(X0_3,X1_3)),
% 0.69/1.13 inference(global_subsumption_just,[status(thm)],[c_52,c_61])).
% 0.69/1.13
% 0.69/1.13 cnf(c_103,plain,
% 0.69/1.13 ($false),
% 0.69/1.13 inference(forward_subsumption_resolution,[status(thm)],[c_62,c_76])).
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13 % SZS output end CNFRefutation for theBenchmark.p
% 0.69/1.13
% 0.69/1.13
%------------------------------------------------------------------------------