TSTP Solution File: ARI592_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ARI592_1 : TPTP v8.1.2. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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:07:19 EDT 2024
% Result : Theorem 3.00s 1.17s
% Output : CNFRefutation 3.00s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : ARI592_1 : TPTP v8.1.2. Released v5.1.0.
% 0.13/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n010.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.20/0.35 % CPULimit : 300
% 0.20/0.35 % WCLimit : 300
% 0.20/0.35 % DateTime : Fri May 3 00:45:49 EDT 2024
% 0.20/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
% 3.00/1.17 % SZS status Started for theBenchmark.p
% 3.00/1.17 % SZS status Theorem for theBenchmark.p
% 3.00/1.17
% 3.00/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.00/1.17
% 3.00/1.17 ------ iProver source info
% 3.00/1.17
% 3.00/1.17 git: date: 2024-05-02 19:28:25 +0000
% 3.00/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.00/1.17 git: non_committed_changes: false
% 3.00/1.17
% 3.00/1.17 ------ Parsing...
% 3.00/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.00/1.17
% 3.00/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
% 3.00/1.17
% 3.00/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.00/1.17
% 3.00/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.00/1.17 ------ Proving...
% 3.00/1.17 ------ Problem Properties
% 3.00/1.17
% 3.00/1.17
% 3.00/1.17 clauses 15
% 3.00/1.17 conjectures 2
% 3.00/1.17 EPR 7
% 3.00/1.17 Horn 13
% 3.00/1.17 unary 10
% 3.00/1.17 binary 2
% 3.00/1.17 lits 23
% 3.00/1.17 lits eq 8
% 3.00/1.17 fd_pure 0
% 3.00/1.17 fd_pseudo 0
% 3.00/1.17 fd_cond 1
% 3.00/1.17 fd_pseudo_cond 1
% 3.00/1.17 AC symbols 1
% 3.00/1.17
% 3.00/1.17 ------ Input Options Time Limit: Unbounded
% 3.00/1.17
% 3.00/1.17
% 3.00/1.17 ------
% 3.00/1.17 Current options:
% 3.00/1.17 ------
% 3.00/1.17
% 3.00/1.17
% 3.00/1.17
% 3.00/1.17
% 3.00/1.17 ------ Proving...
% 3.00/1.17
% 3.00/1.17
% 3.00/1.17 % SZS status Theorem for theBenchmark.p
% 3.00/1.17
% 3.00/1.17 % SZS output start CNFRefutation for theBenchmark.p
% 3.00/1.17
% 3.00/1.17 tff(f1,conjecture,(
% 3.00/1.17 ! [X0 : $int,X1 : $int] : ($less(2,X1) => ? [X2 : $int] : (X0 != X2 & $less(X2,X1) & $less(0,X2)))),
% 3.00/1.17 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',exists_X_0_Z_noteq_Y)).
% 3.00/1.17
% 3.00/1.17 tff(f2,negated_conjecture,(
% 3.00/1.17 ~! [X0 : $int,X1 : $int] : ($less(2,X1) => ? [X2 : $int] : (X0 != X2 & $less(X2,X1) & $less(0,X2)))),
% 3.00/1.17 inference(negated_conjecture,[],[f1])).
% 3.00/1.17
% 3.00/1.17 tff(f8,plain,(
% 3.00/1.17 ( ! [X0 : $int] : (~$less(X0,X0)) )),
% 3.00/1.17 introduced(theory_axiom_145,[])).
% 3.00/1.17
% 3.00/1.17 tff(f9,plain,(
% 3.00/1.17 ( ! [X2 : $int,X0 : $int,X1 : $int] : (~$less(X0,X1) | ~$less(X1,X2) | $less(X0,X2)) )),
% 3.00/1.17 introduced(theory_axiom_146,[])).
% 3.00/1.17
% 3.00/1.17 tff(f15,plain,(
% 3.00/1.17 ? [X0 : $int,X1 : $int] : (! [X2 : $int] : (X0 = X2 | ~$less(X2,X1) | ~$less(0,X2)) & $less(2,X1))),
% 3.00/1.17 inference(ennf_transformation,[],[f2])).
% 3.00/1.17
% 3.00/1.17 tff(f16,plain,(
% 3.00/1.17 ? [X0 : $int,X1 : $int] : (! [X2 : $int] : (X0 = X2 | ~$less(X2,X1) | ~$less(0,X2)) & $less(2,X1)) => (! [X2 : $int] : (sK0 = X2 | ~$less(X2,sK1) | ~$less(0,X2)) & $less(2,sK1))),
% 3.00/1.17 introduced(choice_axiom,[])).
% 3.00/1.17
% 3.00/1.17 tff(f17,plain,(
% 3.00/1.17 ! [X2 : $int] : (sK0 = X2 | ~$less(X2,sK1) | ~$less(0,X2)) & $less(2,sK1)),
% 3.00/1.17 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f15,f16])).
% 3.00/1.17
% 3.00/1.17 tff(f18,plain,(
% 3.00/1.17 $less(2,sK1)),
% 3.00/1.17 inference(cnf_transformation,[],[f17])).
% 3.00/1.17
% 3.00/1.17 tff(f19,plain,(
% 3.00/1.17 ( ! [X2 : $int] : (sK0 = X2 | ~$less(X2,sK1) | ~$less(0,X2)) )),
% 3.00/1.17 inference(cnf_transformation,[],[f17])).
% 3.00/1.17
% 3.00/1.17 cnf(c_54,plain,
% 3.00/1.17 (~$less_int(X0_3,X1_3)|~$less_int(X1_3,X2_3)|$less_int(X0_3,X2_3)),
% 3.00/1.17 inference(cnf_transformation,[],[f9])).
% 3.00/1.17
% 3.00/1.17 cnf(c_55,plain,
% 3.00/1.17 (~$less_int(X0_3,X0_3)),
% 3.00/1.17 inference(cnf_transformation,[],[f8])).
% 3.00/1.17
% 3.00/1.17 cnf(c_61,negated_conjecture,
% 3.00/1.17 (~$less_int(X0_3,sK1)|~$less_int(0,X0_3)|X0_3 = sK0),
% 3.00/1.17 inference(cnf_transformation,[],[f19])).
% 3.00/1.17
% 3.00/1.17 cnf(c_62,negated_conjecture,
% 3.00/1.17 ($less_int(2,sK1)),
% 3.00/1.17 inference(cnf_transformation,[],[f18])).
% 3.00/1.17
% 3.00/1.17 cnf(c_63,plain,($less_int(0,1)),theory(arith)).
% 3.00/1.17
% 3.00/1.17 cnf(c_64,plain,($less_int(1,2)),theory(arith)).
% 3.00/1.17
% 3.00/1.17 cnf(c_534,plain,
% 3.00/1.17 (~$less_int(0,2)|sK0 = 2),
% 3.00/1.17 inference(superposition,[status(thm)],[c_62,c_61])).
% 3.00/1.17
% 3.00/1.17 cnf(c_537,plain,
% 3.00/1.17 (sK0 = 2),
% 3.00/1.17 inference(smt_theory_normalisation,[status(thm)],[c_534])).
% 3.00/1.17
% 3.00/1.17 cnf(c_538,plain,
% 3.00/1.17 ($less_int(sK0,sK1)),
% 3.00/1.17 inference(demodulation,[status(thm)],[c_62,c_537])).
% 3.00/1.17
% 3.00/1.17 cnf(c_540,plain,
% 3.00/1.17 ($less_int(1,sK0)),
% 3.00/1.17 inference(light_normalisation,[status(thm)],[c_64,c_537])).
% 3.00/1.17
% 3.00/1.17 cnf(c_743,plain,
% 3.00/1.17 (~$less_int(sK0,X0_3)|$less_int(1,X0_3)),
% 3.00/1.17 inference(superposition,[status(thm)],[c_540,c_54])).
% 3.00/1.17
% 3.00/1.17 cnf(c_1430,plain,
% 3.00/1.17 ($less_int(1,sK1)),
% 3.00/1.17 inference(superposition,[status(thm)],[c_538,c_743])).
% 3.00/1.17
% 3.00/1.17 cnf(c_1469,plain,
% 3.00/1.17 (~$less_int(0,1)|sK0 = 1),
% 3.00/1.17 inference(superposition,[status(thm)],[c_1430,c_61])).
% 3.00/1.17
% 3.00/1.17 cnf(c_1473,plain,
% 3.00/1.17 (sK0 = 1),
% 3.00/1.17 inference(forward_subsumption_resolution,[status(thm)],[c_1469,c_63])).
% 3.00/1.17
% 3.00/1.17 cnf(c_1483,plain,
% 3.00/1.17 ($less_int(1,1)),
% 3.00/1.17 inference(demodulation,[status(thm)],[c_540,c_1473])).
% 3.00/1.17
% 3.00/1.17 cnf(c_1490,plain,
% 3.00/1.17 ($false),
% 3.00/1.17 inference(forward_subsumption_resolution,[status(thm)],[c_1483,c_55])).
% 3.00/1.17
% 3.00/1.17
% 3.00/1.17 % SZS output end CNFRefutation for theBenchmark.p
% 3.00/1.17
% 3.00/1.17
%------------------------------------------------------------------------------