TSTP Solution File: ARI200_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ARI200_1 : TPTP v8.1.2. Released v5.0.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 : Fri May 3 02:06:28 EDT 2024
% Result : Theorem 2.30s 1.21s
% Output : CNFRefutation 2.30s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ARI200_1 : TPTP v8.1.2. Released v5.0.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n016.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:44:30 EDT 2024
% 0.14/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
% 2.30/1.21 % SZS status Started for theBenchmark.p
% 2.30/1.21 % SZS status Theorem for theBenchmark.p
% 2.30/1.21
% 2.30/1.21 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.30/1.21
% 2.30/1.21 ------ iProver source info
% 2.30/1.21
% 2.30/1.21 git: date: 2024-05-02 19:28:25 +0000
% 2.30/1.21 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.30/1.21 git: non_committed_changes: false
% 2.30/1.21
% 2.30/1.21 ------ Parsing...
% 2.30/1.21 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.30/1.21
% 2.30/1.21 ------ 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
% 2.30/1.21
% 2.30/1.21 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.30/1.21
% 2.30/1.21 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.30/1.21 ------ Proving...
% 2.30/1.21 ------ Problem Properties
% 2.30/1.21
% 2.30/1.21
% 2.30/1.21 clauses 11
% 2.30/1.21 conjectures 1
% 2.30/1.21 EPR 4
% 2.30/1.21 Horn 9
% 2.30/1.21 unary 8
% 2.30/1.21 binary 1
% 2.30/1.21 lits 16
% 2.30/1.21 lits eq 7
% 2.30/1.21 fd_pure 0
% 2.30/1.21 fd_pseudo 0
% 2.30/1.21 fd_cond 0
% 2.30/1.21 fd_pseudo_cond 1
% 2.30/1.21 AC symbols 1
% 2.30/1.21
% 2.30/1.21 ------ Input Options Time Limit: Unbounded
% 2.30/1.21
% 2.30/1.21
% 2.30/1.21 ------
% 2.30/1.21 Current options:
% 2.30/1.21 ------
% 2.30/1.21
% 2.30/1.21
% 2.30/1.21
% 2.30/1.21
% 2.30/1.21 ------ Proving...
% 2.30/1.21
% 2.30/1.21
% 2.30/1.21 % SZS status Theorem for theBenchmark.p
% 2.30/1.21
% 2.30/1.21 % SZS output start CNFRefutation for theBenchmark.p
% 2.30/1.21
% 2.30/1.21 tff(f1,conjecture,(
% 2.30/1.21 ? [X0 : $rat] : $less(X0,0/1)),
% 2.30/1.21 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rat_less_problem_11)).
% 2.30/1.21
% 2.30/1.21 tff(f2,negated_conjecture,(
% 2.30/1.21 ~? [X0 : $rat] : $less(X0,0/1)),
% 2.30/1.21 inference(negated_conjecture,[],[f1])).
% 2.30/1.21
% 2.30/1.21 tff(f3,plain,(
% 2.30/1.21 ( ! [X0 : $rat,X1 : $rat] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 2.30/1.21 introduced(theory_axiom_138,[])).
% 2.30/1.21
% 2.30/1.21 tff(f7,plain,(
% 2.30/1.21 ( ! [X0 : $rat] : (0/1 = $sum(X0,$uminus(X0))) )),
% 2.30/1.21 introduced(theory_axiom_143,[])).
% 2.30/1.21
% 2.30/1.21 tff(f8,plain,(
% 2.30/1.21 ( ! [X0 : $rat] : (~$less(X0,X0)) )),
% 2.30/1.21 introduced(theory_axiom_145,[])).
% 2.30/1.21
% 2.30/1.21 tff(f12,plain,(
% 2.30/1.21 ( ! [X0 : $rat,X1 : $rat] : ($less(X0,X1) | $less(X1,$sum(X0,1/1))) )),
% 2.30/1.21 introduced(theory_axiom_150,[])).
% 2.30/1.21
% 2.30/1.21 tff(f14,plain,(
% 2.30/1.21 ! [X0 : $rat] : ~$less(X0,0/1)),
% 2.30/1.21 inference(ennf_transformation,[],[f2])).
% 2.30/1.21
% 2.30/1.21 tff(f15,plain,(
% 2.30/1.21 ( ! [X0 : $rat] : (~$less(X0,0/1)) )),
% 2.30/1.21 inference(cnf_transformation,[],[f14])).
% 2.30/1.21
% 2.30/1.21 cnf(c_50,plain,
% 2.30/1.21 ($less_rat(X0_4,$sum_rat(X1_4,1/1))|$less_rat(X1_4,X0_4)),
% 2.30/1.21 inference(cnf_transformation,[],[f12])).
% 2.30/1.21
% 2.30/1.21 cnf(c_54,plain,
% 2.30/1.21 (~$less_rat(X0_4,X0_4)),
% 2.30/1.21 inference(cnf_transformation,[],[f8])).
% 2.30/1.21
% 2.30/1.21 cnf(c_55,plain,
% 2.30/1.21 ($sum_rat(X0_4,$uminus_rat(X0_4)) = 0/1),
% 2.30/1.21 inference(cnf_transformation,[],[f7])).
% 2.30/1.21
% 2.30/1.21 cnf(c_59,plain,
% 2.30/1.21 ($sum_rat(X0_4,X1_4) = $sum_rat(X1_4,X0_4)),
% 2.30/1.21 inference(cnf_transformation,[],[f3])).
% 2.30/1.21
% 2.30/1.21 cnf(c_60,negated_conjecture,
% 2.30/1.21 (~$less_rat(X0_4,0/1)),
% 2.30/1.21 inference(cnf_transformation,[],[f15])).
% 2.30/1.21
% 2.30/1.21 cnf(c_309,plain,
% 2.30/1.21 ($less_rat(X0_4,$sum_rat(X0_4,1/1))),
% 2.30/1.21 inference(superposition,[status(thm)],[c_50,c_54])).
% 2.30/1.21
% 2.30/1.21 cnf(c_316,plain,
% 2.30/1.21 ($less_rat(X0_4,$sum_rat(1/1,X0_4))),
% 2.30/1.21 inference(superposition,[status(thm)],[c_59,c_309])).
% 2.30/1.21
% 2.30/1.21 cnf(c_323,plain,
% 2.30/1.21 ($less_rat($uminus_rat(1/1),0/1)),
% 2.30/1.21 inference(superposition,[status(thm)],[c_55,c_316])).
% 2.30/1.21
% 2.30/1.21 cnf(c_326,plain,
% 2.30/1.21 ($false),
% 2.30/1.21 inference(forward_subsumption_resolution,[status(thm)],[c_323,c_60])).
% 2.30/1.21
% 2.30/1.21
% 2.30/1.21 % SZS output end CNFRefutation for theBenchmark.p
% 2.30/1.21
% 2.30/1.21
%------------------------------------------------------------------------------