TSTP Solution File: NUM900_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM900_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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 0.41s 1.11s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM900_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n027.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Thu May 2 19:56:20 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.42 Running TFA theorem proving
% 0.17/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
% 0.41/1.11 % SZS status Started for theBenchmark.p
% 0.41/1.11 % SZS status Theorem for theBenchmark.p
% 0.41/1.11
% 0.41/1.11 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.41/1.11
% 0.41/1.11 ------ iProver source info
% 0.41/1.11
% 0.41/1.11 git: date: 2024-05-02 19:28:25 +0000
% 0.41/1.11 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.41/1.11 git: non_committed_changes: false
% 0.41/1.11
% 0.41/1.11 ------ Parsing...
% 0.41/1.11 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.41/1.11
% 0.41/1.11 ------ 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
% 0.41/1.11
% 0.41/1.11 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.41/1.11
% 0.41/1.11 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.41/1.11 ------ Proving...
% 0.41/1.11 ------ Problem Properties
% 0.41/1.11
% 0.41/1.11
% 0.41/1.11 clauses 15
% 0.41/1.11 conjectures 3
% 0.41/1.11 EPR 6
% 0.41/1.11 Horn 13
% 0.41/1.11 unary 11
% 0.41/1.11 binary 2
% 0.41/1.11 lits 21
% 0.41/1.11 lits eq 8
% 0.41/1.11 fd_pure 0
% 0.41/1.11 fd_pseudo 0
% 0.41/1.11 fd_cond 0
% 0.41/1.11 fd_pseudo_cond 1
% 0.41/1.11 AC symbols 1
% 0.41/1.11
% 0.41/1.11 ------ Input Options Time Limit: Unbounded
% 0.41/1.11
% 0.41/1.11
% 0.41/1.11 ------
% 0.41/1.11 Current options:
% 0.41/1.11 ------
% 0.41/1.11
% 0.41/1.11
% 0.41/1.11
% 0.41/1.11
% 0.41/1.11 ------ Proving...
% 0.41/1.11
% 0.41/1.11
% 0.41/1.11 % SZS status Theorem for theBenchmark.p
% 0.41/1.11
% 0.41/1.11 % SZS output start CNFRefutation for theBenchmark.p
% 0.41/1.11
% 0.41/1.11 tff(f1,conjecture,(
% 0.41/1.11 ! [X0 : $int,X1 : $int,X2 : $int] : (($less(0,X2) & $difference(X0,X1) = X2) => $less(X1,X0))),
% 0.41/1.11 file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_greater)).
% 0.41/1.11
% 0.41/1.11 tff(f2,negated_conjecture,(
% 0.41/1.11 ~! [X0 : $int,X1 : $int,X2 : $int] : (($less(0,X2) & $difference(X0,X1) = X2) => $less(X1,X0))),
% 0.41/1.11 inference(negated_conjecture,[],[f1])).
% 0.41/1.11
% 0.41/1.11 tff(f3,plain,(
% 0.41/1.11 ~! [X0 : $int,X1 : $int,X2 : $int] : (($less(0,X2) & $sum(X0,$uminus(X1)) = X2) => $less(X1,X0))),
% 0.41/1.11 inference(theory_normalization,[],[f2])).
% 0.41/1.11
% 0.41/1.11 tff(f4,plain,(
% 0.41/1.11 ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 0.41/1.11 introduced(theory_axiom_138,[])).
% 0.41/1.11
% 0.41/1.11 tff(f5,plain,(
% 0.41/1.11 ( ! [X2 : $int,X0 : $int,X1 : $int] : ($sum(X0,$sum(X1,X2)) = $sum($sum(X0,X1),X2)) )),
% 0.41/1.11 introduced(theory_axiom_139,[])).
% 0.41/1.11
% 0.41/1.11 tff(f7,plain,(
% 0.41/1.11 ( ! [X0 : $int,X1 : $int] : ($uminus($sum(X0,X1)) = $sum($uminus(X1),$uminus(X0))) )),
% 0.41/1.11 introduced(theory_axiom_142,[])).
% 0.41/1.11
% 0.41/1.11 tff(f16,plain,(
% 0.41/1.11 ? [X0 : $int,X1 : $int,X2 : $int] : (~$less(X1,X0) & ($less(0,X2) & $sum(X0,$uminus(X1)) = X2))),
% 0.41/1.11 inference(ennf_transformation,[],[f3])).
% 0.41/1.11
% 0.41/1.11 tff(f17,plain,(
% 0.41/1.11 ? [X0 : $int,X1 : $int,X2 : $int] : (~$less(X1,X0) & $less(0,X2) & $sum(X0,$uminus(X1)) = X2)),
% 0.41/1.11 inference(flattening,[],[f16])).
% 0.41/1.11
% 0.41/1.11 tff(f18,plain,(
% 0.41/1.11 ? [X0 : $int,X1 : $int,X2 : $int] : (~$less(X1,X0) & $less(0,X2) & $sum(X0,$uminus(X1)) = X2) => (~$less(sK1,sK0) & $less(0,sK2) & sK2 = $sum(sK0,$uminus(sK1)))),
% 0.41/1.11 introduced(choice_axiom,[])).
% 0.41/1.11
% 0.41/1.11 tff(f19,plain,(
% 0.41/1.11 ~$less(sK1,sK0) & $less(0,sK2) & sK2 = $sum(sK0,$uminus(sK1))),
% 0.41/1.11 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f17,f18])).
% 0.41/1.11
% 0.41/1.11 tff(f20,plain,(
% 0.41/1.11 sK2 = $sum(sK0,$uminus(sK1))),
% 0.41/1.11 inference(cnf_transformation,[],[f19])).
% 0.41/1.11
% 0.41/1.11 tff(f21,plain,(
% 0.41/1.11 $less(0,sK2)),
% 0.41/1.11 inference(cnf_transformation,[],[f19])).
% 0.41/1.11
% 0.41/1.11 tff(f22,plain,(
% 0.41/1.11 ~$less(sK1,sK0)),
% 0.41/1.11 inference(cnf_transformation,[],[f19])).
% 0.41/1.11
% 0.41/1.11 cnf(c_57,plain,
% 0.41/1.11 ($sum_int($uminus_int(X0_3),$uminus_int(X1_3)) = $uminus_int($sum_int(X1_3,X0_3))),
% 0.41/1.11 inference(cnf_transformation,[],[f7])).
% 0.41/1.11
% 0.41/1.11 cnf(c_59,plain,
% 0.41/1.11 ($sum_int($sum_int(X0_3,X1_3),X2_3) = $sum_int(X0_3,$sum_int(X1_3,X2_3))),
% 0.41/1.11 inference(cnf_transformation,[],[f5])).
% 0.41/1.11
% 0.41/1.11 cnf(c_60,plain,
% 0.41/1.11 ($sum_int(X0_3,X1_3) = $sum_int(X1_3,X0_3)),
% 0.41/1.11 inference(cnf_transformation,[],[f4])).
% 0.41/1.11
% 0.41/1.11 cnf(c_61,negated_conjecture,
% 0.41/1.11 (~$less_int(sK1,sK0)),
% 0.41/1.11 inference(cnf_transformation,[],[f22])).
% 0.41/1.11
% 0.41/1.11 cnf(c_62,negated_conjecture,
% 0.41/1.11 ($less_int(0,sK2)),
% 0.41/1.11 inference(cnf_transformation,[],[f21])).
% 0.41/1.11
% 0.41/1.11 cnf(c_63,negated_conjecture,
% 0.41/1.11 ($sum_int(sK0,$uminus_int(sK1)) = sK2),
% 0.41/1.11 inference(cnf_transformation,[],[f20])).
% 0.41/1.11
% 0.41/1.11 cnf(c_492,plain,
% 0.41/1.11 ($sum_int(X0_3,$sum_int(X1_3,X2_3)) = $sum_int(X1_3,$sum_int(X0_3,X2_3))),
% 0.41/1.11 inference(superposition,[status(thm)],[c_59,c_60])).
% 0.41/1.11
% 0.41/1.11 cnf(c_755,plain,
% 0.41/1.11 ($sum_int($uminus_int(X0_3),$sum_int(X1_3,$uminus_int(X2_3))) = $sum_int(X1_3,$uminus_int($sum_int(X2_3,X0_3)))),
% 0.41/1.11 inference(superposition,[status(thm)],[c_57,c_492])).
% 0.41/1.11
% 0.41/1.11 cnf(c_4034,plain,
% 0.41/1.11 ($sum_int(sK0,$uminus_int($sum_int(sK1,X0_3))) = $sum_int($uminus_int(X0_3),sK2)),
% 0.41/1.11 inference(superposition,[status(thm)],[c_63,c_755])).
% 0.41/1.11
% 0.41/1.11 cnf(c_4060,plain,
% 0.41/1.11 ($sum_int(sK0,$uminus_int($sum_int(sK1,X0_3))) = $sum_int(sK2,$uminus_int(X0_3))),
% 0.41/1.11 inference(theory_normalisation,[status(thm)],[c_4034,c_59,c_60])).
% 0.41/1.11
% 0.41/1.11 cnf(c_5099,plain,
% 0.41/1.11 ($false),
% 0.41/1.11 inference(smt_impl_just,[status(thm)],[c_4060,c_62,c_61])).
% 0.41/1.11
% 0.41/1.11
% 0.41/1.11 % SZS output end CNFRefutation for theBenchmark.p
% 0.41/1.11
% 0.41/1.11
%------------------------------------------------------------------------------