TSTP Solution File: ARI752_1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : ARI752_1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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 : Wed Aug 30 17:41:59 EDT 2023
% Result : Unsatisfiable 2.24s 1.16s
% Output : CNFRefutation 2.24s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ARI752_1 : TPTP v8.1.2. Released v7.0.0.
% 0.06/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n012.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 : Tue Aug 29 17:59:54 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.47 Running TFA theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.24/1.16 % SZS status Started for theBenchmark.p
% 2.24/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 2.24/1.16
% 2.24/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.24/1.16
% 2.24/1.16 ------ iProver source info
% 2.24/1.16
% 2.24/1.16 git: date: 2023-05-31 18:12:56 +0000
% 2.24/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.24/1.16 git: non_committed_changes: false
% 2.24/1.16 git: last_make_outside_of_git: false
% 2.24/1.16
% 2.24/1.16 ------ Parsing...
% 2.24/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.24/1.16
% 2.24/1.16 ------ Preprocessing...
% 2.24/1.16
% 2.24/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 2.24/1.16
% 2.24/1.16 % SZS output start CNFRefutation for theBenchmark.p
% 2.24/1.16
% 2.24/1.16 tff(f170,axiom,(
% 2.24/1.16 ~(c_Boolean_true = c_Boolean_true => ! [X812 : c_unsorted] : (integer_of_int32(c_sort(int32,X812)) = 18 => ! [X813 : c_unsorted] : (c_sort(int32,X812) = c_sort(int32,X813) => ! [X814 : c_unsorted] : ? [X815 : c_sorted] : ((c_sort(int32,X813) = X815 => 18 = integer_of_int32(X815)) & c_sort(int32,X814) = X815))))),
% 2.24/1.16 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_170)).
% 2.24/1.16
% 2.24/1.16 tff(f417,plain,(
% 2.24/1.16 ~(c_Boolean_true = c_Boolean_true => ! [X0 : c_unsorted] : (18 = 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 => 18 = integer_of_int32(X3)) & c_sort(int32,X2) = X3))))),
% 2.24/1.16 inference(rectify,[],[f170])).
% 2.24/1.16
% 2.24/1.16 tff(f495,plain,(
% 2.24/1.16 ? [X0 : c_unsorted] : (? [X1 : c_unsorted] : (? [X2 : c_unsorted] : ! [X3 : c_sorted] : ((18 != integer_of_int32(X3) & c_sort(int32,X1) = X3) | c_sort(int32,X2) != X3) & c_sort(int32,X1) = c_sort(int32,X0)) & 18 = integer_of_int32(c_sort(int32,X0))) & c_Boolean_true = c_Boolean_true),
% 2.24/1.16 inference(ennf_transformation,[],[f417])).
% 2.24/1.16
% 2.24/1.16 tff(f925,plain,(
% 2.24/1.16 ? [X0 : c_unsorted] : (? [X1 : c_unsorted] : (? [X2 : c_unsorted] : ! [X3 : c_sorted] : ((18 != integer_of_int32(X3) & c_sort(int32,X1) = X3) | c_sort(int32,X2) != X3) & c_sort(int32,X1) = c_sort(int32,X0)) & 18 = integer_of_int32(c_sort(int32,X0))) => (? [X1 : c_unsorted] : (? [X2 : c_unsorted] : ! [X3 : c_sorted] : ((18 != integer_of_int32(X3) & c_sort(int32,X1) = X3) | c_sort(int32,X2) != X3) & c_sort(int32,X1) = c_sort(int32,sK295)) & 18 = integer_of_int32(c_sort(int32,sK295)))),
% 2.24/1.16 introduced(choice_axiom,[])).
% 2.24/1.16
% 2.24/1.16 tff(f926,plain,(
% 2.24/1.16 ? [X1 : c_unsorted] : (? [X2 : c_unsorted] : ! [X3 : c_sorted] : ((18 != 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] : ((18 != integer_of_int32(X3) & c_sort(int32,sK296) = X3) | c_sort(int32,X2) != X3) & c_sort(int32,sK295) = c_sort(int32,sK296))),
% 2.24/1.16 introduced(choice_axiom,[])).
% 2.24/1.16
% 2.24/1.16 tff(f927,plain,(
% 2.24/1.16 ? [X2 : c_unsorted] : ! [X3 : c_sorted] : ((18 != integer_of_int32(X3) & c_sort(int32,sK296) = X3) | c_sort(int32,X2) != X3) => ! [X3 : c_sorted] : ((18 != integer_of_int32(X3) & c_sort(int32,sK296) = X3) | c_sort(int32,sK297) != X3)),
% 2.24/1.16 introduced(choice_axiom,[])).
% 2.24/1.16
% 2.24/1.16 tff(f928,plain,(
% 2.24/1.16 ((! [X3 : c_sorted] : ((18 != integer_of_int32(X3) & c_sort(int32,sK296) = X3) | c_sort(int32,sK297) != X3) & c_sort(int32,sK295) = c_sort(int32,sK296)) & 18 = integer_of_int32(c_sort(int32,sK295))) & c_Boolean_true = c_Boolean_true),
% 2.24/1.16 inference(skolemisation,[status(esa),new_symbols(skolem,[sK295,sK296,sK297])],[f495,f927,f926,f925])).
% 2.24/1.16
% 2.24/1.16 tff(f1479,plain,(
% 2.24/1.16 18 = integer_of_int32(c_sort(int32,sK295))),
% 2.24/1.16 inference(cnf_transformation,[],[f928])).
% 2.24/1.16
% 2.24/1.16 tff(f1480,plain,(
% 2.24/1.16 c_sort(int32,sK295) = c_sort(int32,sK296)),
% 2.24/1.16 inference(cnf_transformation,[],[f928])).
% 2.24/1.16
% 2.24/1.16 tff(f1481,plain,(
% 2.24/1.16 ( ! [X3 : c_sorted] : (c_sort(int32,sK296) = X3 | c_sort(int32,sK297) != X3) )),
% 2.24/1.16 inference(cnf_transformation,[],[f928])).
% 2.24/1.16
% 2.24/1.16 tff(f1482,plain,(
% 2.24/1.16 ( ! [X3 : c_sorted] : (18 != integer_of_int32(X3) | c_sort(int32,sK297) != X3) )),
% 2.24/1.16 inference(cnf_transformation,[],[f928])).
% 2.24/1.16
% 2.24/1.16 tff(f1875,plain,(
% 2.24/1.16 18 != integer_of_int32(c_sort(int32,sK297))),
% 2.24/1.16 inference(equality_resolution,[],[f1482])).
% 2.24/1.16
% 2.24/1.16 tff(f1876,plain,(
% 2.24/1.16 c_sort(int32,sK296) = c_sort(int32,sK297)),
% 2.24/1.16 inference(equality_resolution,[],[f1481])).
% 2.24/1.16
% 2.24/1.16 cnf(c_372,plain,
% 2.24/1.16 (integer_of_int32(c_sort(int32,sK297)) != 18),
% 2.24/1.16 inference(cnf_transformation,[],[f1875])).
% 2.24/1.16
% 2.24/1.16 cnf(c_373,plain,
% 2.24/1.16 (c_sort(int32,sK296) = c_sort(int32,sK297)),
% 2.24/1.16 inference(cnf_transformation,[],[f1876])).
% 2.24/1.16
% 2.24/1.16 cnf(c_374,plain,
% 2.24/1.16 (c_sort(int32,sK295) = c_sort(int32,sK296)),
% 2.24/1.16 inference(cnf_transformation,[],[f1480])).
% 2.24/1.16
% 2.24/1.16 cnf(c_375,plain,
% 2.24/1.16 (integer_of_int32(c_sort(int32,sK295)) = 18),
% 2.24/1.16 inference(cnf_transformation,[],[f1479])).
% 2.24/1.16
% 2.24/1.16 cnf(c_2907,plain,
% 2.24/1.16 (c_sort(int32,sK295) = c_sort(int32,sK297)),
% 2.24/1.16 inference(light_normalisation,[status(thm)],[c_373,c_374])).
% 2.24/1.16
% 2.24/1.16 cnf(c_2908,plain,
% 2.24/1.16 (18 != 18),
% 2.24/1.16 inference(light_normalisation,[status(thm)],[c_372,c_375,c_2907])).
% 2.24/1.16
% 2.24/1.16 cnf(c_2909,plain,
% 2.24/1.16 ($false),
% 2.24/1.16 inference(equality_resolution_simp,[status(thm)],[c_2908])).
% 2.24/1.16
% 2.24/1.16
% 2.24/1.16 % SZS output end CNFRefutation for theBenchmark.p
% 2.24/1.16
% 2.24/1.16
%------------------------------------------------------------------------------