TSTP Solution File: NUM905_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM905_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n014.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:03 EDT 2024
% Result : Theorem 2.30s 1.10s
% Output : CNFRefutation 2.30s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : NUM905_1 : TPTP v8.1.2. Released v5.0.0.
% 0.03/0.11 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n014.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Thu May 2 19:30:02 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running TFA theorem proving
% 0.16/0.42 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
% 2.30/1.10 % SZS status Started for theBenchmark.p
% 2.30/1.10 % SZS status Theorem for theBenchmark.p
% 2.30/1.10
% 2.30/1.10 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.30/1.10
% 2.30/1.10 ------ iProver source info
% 2.30/1.10
% 2.30/1.10 git: date: 2024-05-02 19:28:25 +0000
% 2.30/1.10 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.30/1.10 git: non_committed_changes: false
% 2.30/1.10
% 2.30/1.10 ------ Parsing...
% 2.30/1.10 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.30/1.10
% 2.30/1.10 ------ Preprocessing... sup_sim: 3 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.10
% 2.30/1.10 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.30/1.10
% 2.30/1.10 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.30/1.10 ------ Proving...
% 2.30/1.10 ------ Problem Properties
% 2.30/1.10
% 2.30/1.10
% 2.30/1.10 clauses 12
% 2.30/1.10 conjectures 0
% 2.30/1.10 EPR 5
% 2.30/1.10 Horn 9
% 2.30/1.10 unary 7
% 2.30/1.10 binary 3
% 2.30/1.10 lits 19
% 2.30/1.10 lits eq 11
% 2.30/1.10 fd_pure 0
% 2.30/1.10 fd_pseudo 0
% 2.30/1.10 fd_cond 0
% 2.30/1.10 fd_pseudo_cond 1
% 2.30/1.10 AC symbols 1
% 2.30/1.10
% 2.30/1.10 ------ Input Options Time Limit: Unbounded
% 2.30/1.10
% 2.30/1.10
% 2.30/1.10 ------
% 2.30/1.10 Current options:
% 2.30/1.10 ------
% 2.30/1.10
% 2.30/1.10
% 2.30/1.10
% 2.30/1.10
% 2.30/1.10 ------ Proving...
% 2.30/1.10
% 2.30/1.10
% 2.30/1.10 % SZS status Theorem for theBenchmark.p
% 2.30/1.10
% 2.30/1.10 % SZS output start CNFRefutation for theBenchmark.p
% 2.30/1.10
% 2.30/1.10 tff(f1,conjecture,(
% 2.30/1.10 ! [X0 : $rat] : ($uminus(X0) = X0 <=> 0/1 = X0)),
% 2.30/1.10 file('/export/starexec/sandbox/benchmark/theBenchmark.p',rat_uminus_problem_9)).
% 2.30/1.10
% 2.30/1.10 tff(f2,negated_conjecture,(
% 2.30/1.10 ~! [X0 : $rat] : ($uminus(X0) = X0 <=> 0/1 = X0)),
% 2.30/1.10 inference(negated_conjecture,[],[f1])).
% 2.30/1.10
% 2.30/1.10 tff(f14,plain,(
% 2.30/1.10 ? [X0 : $rat] : ($uminus(X0) = X0 <~> 0/1 = X0)),
% 2.30/1.10 inference(ennf_transformation,[],[f2])).
% 2.30/1.10
% 2.30/1.10 tff(f15,plain,(
% 2.30/1.10 ? [X0 : $rat] : ((0/1 != X0 | $uminus(X0) != X0) & (0/1 = X0 | $uminus(X0) = X0))),
% 2.30/1.10 inference(nnf_transformation,[],[f14])).
% 2.30/1.10
% 2.30/1.10 tff(f16,plain,(
% 2.30/1.10 ? [X0 : $rat] : ((0/1 != X0 | $uminus(X0) != X0) & (0/1 = X0 | $uminus(X0) = X0)) => ((0/1 != sK0 | sK0 != $uminus(sK0)) & (0/1 = sK0 | sK0 = $uminus(sK0)))),
% 2.30/1.10 introduced(choice_axiom,[])).
% 2.30/1.10
% 2.30/1.10 tff(f17,plain,(
% 2.30/1.10 (0/1 != sK0 | sK0 != $uminus(sK0)) & (0/1 = sK0 | sK0 = $uminus(sK0))),
% 2.30/1.10 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f15,f16])).
% 2.30/1.10
% 2.30/1.10 tff(f18,plain,(
% 2.30/1.10 0/1 = sK0 | sK0 = $uminus(sK0)),
% 2.30/1.10 inference(cnf_transformation,[],[f17])).
% 2.30/1.10
% 2.30/1.10 tff(f19,plain,(
% 2.30/1.10 0/1 != sK0 | sK0 != $uminus(sK0)),
% 2.30/1.10 inference(cnf_transformation,[],[f17])).
% 2.30/1.10
% 2.30/1.10 cnf(c_60,negated_conjecture,
% 2.30/1.10 ($uminus_rat(sK0) != sK0|sK0 != 0/1),
% 2.30/1.10 inference(cnf_transformation,[],[f19])).
% 2.30/1.10
% 2.30/1.10 cnf(c_61,negated_conjecture,
% 2.30/1.10 ($uminus_rat(sK0) = sK0|sK0 = 0/1),
% 2.30/1.10 inference(cnf_transformation,[],[f18])).
% 2.30/1.10
% 2.30/1.10 cnf(c_71,plain,
% 2.30/1.10 (sK0 != 0/1|$uminus_rat(sK0) != sK0),
% 2.30/1.10 inference(prop_impl_just,[status(thm)],[c_60])).
% 2.30/1.10
% 2.30/1.10 cnf(c_72,plain,
% 2.30/1.10 ($uminus_rat(sK0) != sK0|sK0 != 0/1),
% 2.30/1.10 inference(renaming,[status(thm)],[c_71])).
% 2.30/1.10
% 2.30/1.10 cnf(c_73,plain,
% 2.30/1.10 (sK0 = 0/1|$uminus_rat(sK0) = sK0),
% 2.30/1.10 inference(prop_impl_just,[status(thm)],[c_61])).
% 2.30/1.10
% 2.30/1.10 cnf(c_74,plain,
% 2.30/1.10 ($uminus_rat(sK0) = sK0|sK0 = 0/1),
% 2.30/1.10 inference(renaming,[status(thm)],[c_73])).
% 2.30/1.10
% 2.30/1.10 cnf(c_148,plain,
% 2.30/1.10 (sK0 = 0/1|sK0 = 0),
% 2.30/1.10 inference(smt_theory_normalisation,[status(thm)],[c_74])).
% 2.30/1.10
% 2.30/1.10 cnf(c_159,plain,
% 2.30/1.10 (sK0 != 0/1|sK0 != 0),
% 2.30/1.10 inference(smt_theory_normalisation,[status(thm)],[c_72])).
% 2.30/1.10
% 2.30/1.10 cnf(c_177,plain,
% 2.30/1.10 (sK0 != 0|sK0 != 0/1),
% 2.30/1.10 inference(prop_impl_just,[status(thm)],[c_159])).
% 2.30/1.10
% 2.30/1.10 cnf(c_178,plain,
% 2.30/1.10 (sK0 != 0/1|sK0 != 0),
% 2.30/1.10 inference(renaming,[status(thm)],[c_177])).
% 2.30/1.10
% 2.30/1.10 cnf(c_179,plain,
% 2.30/1.10 (sK0 = 0|sK0 = 0/1),
% 2.30/1.10 inference(prop_impl_just,[status(thm)],[c_148])).
% 2.30/1.10
% 2.30/1.10 cnf(c_180,plain,
% 2.30/1.10 (sK0 = 0/1|sK0 = 0),
% 2.30/1.10 inference(renaming,[status(thm)],[c_179])).
% 2.30/1.10
% 2.30/1.10 cnf(c_4800,plain,
% 2.30/1.10 ($false),
% 2.30/1.10 inference(smt_impl_just,[status(thm)],[c_178,c_180])).
% 2.30/1.10
% 2.30/1.10
% 2.30/1.10 % SZS output end CNFRefutation for theBenchmark.p
% 2.30/1.10
% 2.30/1.10
%------------------------------------------------------------------------------