TSTP Solution File: ARI751_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ARI751_1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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:42 EDT 2024
% Result : Unsatisfiable 3.98s 1.21s
% Output : CNFRefutation 3.98s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : ARI751_1 : TPTP v8.1.2. Released v7.0.0.
% 0.12/0.14 % Command : run_iprover %s %d THM
% 0.15/0.35 % Computer : n021.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 01:01:58 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running TFA theorem proving
% 0.21/0.48 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
% 3.98/1.21 % SZS status Started for theBenchmark.p
% 3.98/1.21 % SZS status Unsatisfiable for theBenchmark.p
% 3.98/1.21
% 3.98/1.21 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.98/1.21
% 3.98/1.21 ------ iProver source info
% 3.98/1.21
% 3.98/1.21 git: date: 2024-05-02 19:28:25 +0000
% 3.98/1.21 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.98/1.21 git: non_committed_changes: false
% 3.98/1.21
% 3.98/1.21 ------ Parsing...
% 3.98/1.21 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.98/1.21
% 3.98/1.21 ------ Preprocessing...
% 3.98/1.21
% 3.98/1.21 % SZS status Unsatisfiable for theBenchmark.p
% 3.98/1.21
% 3.98/1.21 % SZS output start CNFRefutation for theBenchmark.p
% 3.98/1.21
% 3.98/1.21 tff(f170,axiom,(
% 3.98/1.21 ~(c_Boolean_true = c_Boolean_true => ! [X812 : c_unsorted] : (1 = integer_of_int32(c_sort(int32,X812)) => ! [X813 : c_unsorted] : (c_sort(int32,X812) = c_sort(int32,X813) => ! [X814 : c_unsorted] : ? [X815 : c_sorted] : ((c_sort(int32,X813) = X815 => 1 = integer_of_int32(X815)) & c_sort(int32,X814) = X815))))),
% 3.98/1.21 file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_170)).
% 3.98/1.21
% 3.98/1.21 tff(f417,plain,(
% 3.98/1.21 ~(c_Boolean_true = c_Boolean_true => ! [X0 : c_unsorted] : (1 = integer_of_int32(c_sort(int32,X0)) => ! [X1 : c_unsorted] : (c_sort(int32,X1) = c_sort(int32,X0) => ! [X2 : c_unsorted] : ? [X3 : c_sorted] : ((c_sort(int32,X1) = X3 => 1 = integer_of_int32(X3)) & c_sort(int32,X2) = X3))))),
% 3.98/1.21 inference(rectify,[],[f170])).
% 3.98/1.21
% 3.98/1.21 tff(f495,plain,(
% 3.98/1.21 ? [X0 : c_unsorted] : (? [X1 : c_unsorted] : (? [X2 : c_unsorted] : ! [X3 : c_sorted] : ((1 != integer_of_int32(X3) & c_sort(int32,X1) = X3) | c_sort(int32,X2) != X3) & c_sort(int32,X1) = c_sort(int32,X0)) & 1 = integer_of_int32(c_sort(int32,X0))) & c_Boolean_true = c_Boolean_true),
% 3.98/1.21 inference(ennf_transformation,[],[f417])).
% 3.98/1.21
% 3.98/1.21 tff(f925,plain,(
% 3.98/1.21 ? [X0 : c_unsorted] : (? [X1 : c_unsorted] : (? [X2 : c_unsorted] : ! [X3 : c_sorted] : ((1 != integer_of_int32(X3) & c_sort(int32,X1) = X3) | c_sort(int32,X2) != X3) & c_sort(int32,X1) = c_sort(int32,X0)) & 1 = integer_of_int32(c_sort(int32,X0))) => (? [X1 : c_unsorted] : (? [X2 : c_unsorted] : ! [X3 : c_sorted] : ((1 != integer_of_int32(X3) & c_sort(int32,X1) = X3) | c_sort(int32,X2) != X3) & c_sort(int32,X1) = c_sort(int32,sK295)) & 1 = integer_of_int32(c_sort(int32,sK295)))),
% 3.98/1.21 introduced(choice_axiom,[])).
% 3.98/1.21
% 3.98/1.21 tff(f926,plain,(
% 3.98/1.21 ? [X1 : c_unsorted] : (? [X2 : c_unsorted] : ! [X3 : c_sorted] : ((1 != integer_of_int32(X3) & c_sort(int32,X1) = X3) | c_sort(int32,X2) != X3) & c_sort(int32,X1) = c_sort(int32,sK295)) => (? [X2 : c_unsorted] : ! [X3 : c_sorted] : ((1 != integer_of_int32(X3) & c_sort(int32,sK296) = X3) | c_sort(int32,X2) != X3) & c_sort(int32,sK295) = c_sort(int32,sK296))),
% 3.98/1.21 introduced(choice_axiom,[])).
% 3.98/1.21
% 3.98/1.21 tff(f927,plain,(
% 3.98/1.21 ? [X2 : c_unsorted] : ! [X3 : c_sorted] : ((1 != integer_of_int32(X3) & c_sort(int32,sK296) = X3) | c_sort(int32,X2) != X3) => ! [X3 : c_sorted] : ((1 != integer_of_int32(X3) & c_sort(int32,sK296) = X3) | c_sort(int32,sK297) != X3)),
% 3.98/1.21 introduced(choice_axiom,[])).
% 3.98/1.21
% 3.98/1.21 tff(f928,plain,(
% 3.98/1.21 ((! [X3 : c_sorted] : ((1 != integer_of_int32(X3) & c_sort(int32,sK296) = X3) | c_sort(int32,sK297) != X3) & c_sort(int32,sK295) = c_sort(int32,sK296)) & 1 = integer_of_int32(c_sort(int32,sK295))) & c_Boolean_true = c_Boolean_true),
% 3.98/1.21 inference(skolemisation,[status(esa),new_symbols(skolem,[sK295,sK296,sK297])],[f495,f927,f926,f925])).
% 3.98/1.21
% 3.98/1.21 tff(f1479,plain,(
% 3.98/1.21 1 = integer_of_int32(c_sort(int32,sK295))),
% 3.98/1.21 inference(cnf_transformation,[],[f928])).
% 3.98/1.21
% 3.98/1.21 tff(f1480,plain,(
% 3.98/1.21 c_sort(int32,sK295) = c_sort(int32,sK296)),
% 3.98/1.21 inference(cnf_transformation,[],[f928])).
% 3.98/1.21
% 3.98/1.21 tff(f1481,plain,(
% 3.98/1.21 ( ! [X3 : c_sorted] : (c_sort(int32,sK296) = X3 | c_sort(int32,sK297) != X3) )),
% 3.98/1.21 inference(cnf_transformation,[],[f928])).
% 3.98/1.21
% 3.98/1.21 tff(f1482,plain,(
% 3.98/1.21 ( ! [X3 : c_sorted] : (1 != integer_of_int32(X3) | c_sort(int32,sK297) != X3) )),
% 3.98/1.21 inference(cnf_transformation,[],[f928])).
% 3.98/1.21
% 3.98/1.21 tff(f1875,plain,(
% 3.98/1.21 1 != integer_of_int32(c_sort(int32,sK297))),
% 3.98/1.21 inference(equality_resolution,[],[f1482])).
% 3.98/1.21
% 3.98/1.21 tff(f1876,plain,(
% 3.98/1.21 c_sort(int32,sK296) = c_sort(int32,sK297)),
% 3.98/1.21 inference(equality_resolution,[],[f1481])).
% 3.98/1.21
% 3.98/1.21 cnf(c_372,plain,
% 3.98/1.21 (integer_of_int32(c_sort(int32,sK297)) != 1),
% 3.98/1.21 inference(cnf_transformation,[],[f1875])).
% 3.98/1.21
% 3.98/1.21 cnf(c_373,plain,
% 3.98/1.21 (c_sort(int32,sK296) = c_sort(int32,sK297)),
% 3.98/1.21 inference(cnf_transformation,[],[f1876])).
% 3.98/1.21
% 3.98/1.21 cnf(c_374,plain,
% 3.98/1.21 (c_sort(int32,sK295) = c_sort(int32,sK296)),
% 3.98/1.21 inference(cnf_transformation,[],[f1480])).
% 3.98/1.21
% 3.98/1.21 cnf(c_375,plain,
% 3.98/1.21 (integer_of_int32(c_sort(int32,sK295)) = 1),
% 3.98/1.21 inference(cnf_transformation,[],[f1479])).
% 3.98/1.21
% 3.98/1.21 cnf(c_2903,plain,
% 3.98/1.21 (c_sort(int32,sK295) = c_sort(int32,sK297)),
% 3.98/1.21 inference(light_normalisation,[status(thm)],[c_373,c_374])).
% 3.98/1.21
% 3.98/1.21 cnf(c_2904,plain,
% 3.98/1.21 (1 != 1),
% 3.98/1.21 inference(light_normalisation,[status(thm)],[c_372,c_375,c_2903])).
% 3.98/1.21
% 3.98/1.21 cnf(c_2905,plain,
% 3.98/1.21 ($false),
% 3.98/1.21 inference(equality_resolution_simp,[status(thm)],[c_2904])).
% 3.98/1.21
% 3.98/1.21
% 3.98/1.21 % SZS output end CNFRefutation for theBenchmark.p
% 3.98/1.21
% 3.98/1.21
%------------------------------------------------------------------------------