TSTP Solution File: NUM894_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM894_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n003.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:51:02 EDT 2024
% Result : Theorem 1.29s 1.17s
% Output : CNFRefutation 1.29s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM894_1 : TPTP v8.1.2. Released v5.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n003.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 : Thu May 2 19:42:20 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running TFA theorem proving
% 0.21/0.48 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
% 1.29/1.17 % SZS status Started for theBenchmark.p
% 1.29/1.17 % SZS status Theorem for theBenchmark.p
% 1.29/1.17
% 1.29/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.29/1.17
% 1.29/1.17 ------ iProver source info
% 1.29/1.17
% 1.29/1.17 git: date: 2024-05-02 19:28:25 +0000
% 1.29/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.29/1.17 git: non_committed_changes: false
% 1.29/1.17
% 1.29/1.17 ------ Parsing...
% 1.29/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.29/1.17
% 1.29/1.17 ------ Preprocessing... sup_sim: 1 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.29/1.17
% 1.29/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.29/1.17
% 1.29/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.29/1.17 ------ Proving...
% 1.29/1.17 ------ Problem Properties
% 1.29/1.17
% 1.29/1.17
% 1.29/1.17 clauses 14
% 1.29/1.17 conjectures 2
% 1.29/1.17 EPR 5
% 1.29/1.17 Horn 12
% 1.29/1.17 unary 10
% 1.29/1.17 binary 2
% 1.29/1.17 lits 20
% 1.29/1.17 lits eq 7
% 1.29/1.17 fd_pure 0
% 1.29/1.17 fd_pseudo 0
% 1.29/1.17 fd_cond 0
% 1.29/1.17 fd_pseudo_cond 1
% 1.29/1.17 AC symbols 1
% 1.29/1.17
% 1.29/1.17 ------ Input Options Time Limit: Unbounded
% 1.29/1.17
% 1.29/1.17
% 1.29/1.17 ------
% 1.29/1.17 Current options:
% 1.29/1.17 ------
% 1.29/1.17
% 1.29/1.17
% 1.29/1.17
% 1.29/1.17
% 1.29/1.17 ------ Proving...
% 1.29/1.17
% 1.29/1.17
% 1.29/1.17 % SZS status Theorem for theBenchmark.p
% 1.29/1.17
% 1.29/1.17 % SZS output start CNFRefutation for theBenchmark.p
% 1.29/1.17
% 1.29/1.17 tff(f1,conjecture,(
% 1.29/1.17 ! [X0 : $int,X1 : $int] : ($less(X1,$sum(X0,1)) => $lesseq(X1,X0))),
% 1.29/1.17 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_successor)).
% 1.29/1.17
% 1.29/1.17 tff(f2,negated_conjecture,(
% 1.29/1.17 ~! [X0 : $int,X1 : $int] : ($less(X1,$sum(X0,1)) => $lesseq(X1,X0))),
% 1.29/1.17 inference(negated_conjecture,[],[f1])).
% 1.29/1.17
% 1.29/1.17 tff(f3,plain,(
% 1.29/1.17 ~! [X0 : $int,X1 : $int] : ($less(X1,$sum(X0,1)) => ~$less(X0,X1))),
% 1.29/1.17 inference(theory_normalization,[],[f2])).
% 1.29/1.17
% 1.29/1.17 tff(f15,plain,(
% 1.29/1.17 ( ! [X0 : $int,X1 : $int] : (~$less(X0,X1) | ~$less(X1,$sum(X0,1))) )),
% 1.29/1.17 introduced(theory_axiom_164,[])).
% 1.29/1.17
% 1.29/1.17 tff(f16,plain,(
% 1.29/1.17 ? [X0 : $int,X1 : $int] : ($less(X0,X1) & $less(X1,$sum(X0,1)))),
% 1.29/1.17 inference(ennf_transformation,[],[f3])).
% 1.29/1.17
% 1.29/1.17 tff(f17,plain,(
% 1.29/1.17 ? [X0 : $int,X1 : $int] : ($less(X0,X1) & $less(X1,$sum(X0,1))) => ($less(sK0,sK1) & $less(sK1,$sum(sK0,1)))),
% 1.29/1.17 introduced(choice_axiom,[])).
% 1.29/1.17
% 1.29/1.17 tff(f18,plain,(
% 1.29/1.17 $less(sK0,sK1) & $less(sK1,$sum(sK0,1))),
% 1.29/1.17 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f16,f17])).
% 1.29/1.17
% 1.29/1.17 tff(f19,plain,(
% 1.29/1.17 $less(sK1,$sum(sK0,1))),
% 1.29/1.17 inference(cnf_transformation,[],[f18])).
% 1.29/1.17
% 1.29/1.17 tff(f20,plain,(
% 1.29/1.17 $less(sK0,sK1)),
% 1.29/1.17 inference(cnf_transformation,[],[f18])).
% 1.29/1.17
% 1.29/1.17 cnf(c_49,plain,
% 1.29/1.17 (~$less_int(X0_3,$sum_int(X1_3,1))|~$less_int(X1_3,X0_3)),
% 1.29/1.17 inference(cnf_transformation,[],[f15])).
% 1.29/1.17
% 1.29/1.17 cnf(c_61,negated_conjecture,
% 1.29/1.17 ($less_int(sK0,sK1)),
% 1.29/1.17 inference(cnf_transformation,[],[f20])).
% 1.29/1.17
% 1.29/1.17 cnf(c_62,negated_conjecture,
% 1.29/1.17 ($less_int(sK1,$sum_int(sK0,1))),
% 1.29/1.17 inference(cnf_transformation,[],[f19])).
% 1.29/1.17
% 1.29/1.17 cnf(c_617,plain,
% 1.29/1.17 (~$less_int(sK1,$sum_int(sK0,1))|~$less_int(sK0,sK1)),
% 1.29/1.17 inference(instantiation,[status(thm)],[c_49])).
% 1.29/1.17
% 1.29/1.17 cnf(c_618,plain,
% 1.29/1.17 ($false),
% 1.29/1.17 inference(prop_impl_just,[status(thm)],[c_617,c_62,c_61])).
% 1.29/1.17
% 1.29/1.17
% 1.29/1.17 % SZS output end CNFRefutation for theBenchmark.p
% 1.29/1.17
% 1.29/1.17
%------------------------------------------------------------------------------