TSTP Solution File: ANA023-10 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ANA023-10 : TPTP v8.2.0. Released v7.5.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 : Mon Jun 24 04:15:28 EDT 2024
% Result : Unsatisfiable 0.47s 1.15s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of clauses : 38 ( 38 unt; 0 nHn; 20 RR)
% Number of literals : 38 ( 37 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 4 con; 0-4 aty)
% Number of variables : 37 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
ifeq2(X0,X0,X1,X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(c_50,plain,
ifeq(X0,X0,X1,X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom_001) ).
cnf(c_51,plain,
ifeq2(class_OrderedGroup_Ocomm__monoid__add(X0),true,c_plus(c_0,X1,X0),X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_OrderedGroup_Ocomm__monoid__add__class_Oaxioms_0) ).
cnf(c_52,plain,
ifeq(class_OrderedGroup_Opordered__ab__group__add(X0),true,ifeq(c_lessequals(X1,c_minus(X2,X3,X0),X0),true,c_lessequals(c_plus(X1,X3,X0),X2,X0),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_OrderedGroup_Ocompare__rls__9_0) ).
cnf(c_53,plain,
ifeq(class_OrderedGroup_Opordered__ab__group__add(X0),true,ifeq(c_lessequals(c_plus(X1,X2,X0),X3,X0),true,c_lessequals(X1,c_minus(X3,X2,X0),X0),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_OrderedGroup_Ocompare__rls__9_1) ).
cnf(c_54,plain,
ifeq(class_Orderings_Oorder(X0),true,ifeq(c_lessequals(X1,X2,X0),true,ifeq(c_lessequals(X2,X3,X0),true,c_lessequals(X1,X3,X0),true),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Orderings_Oorder__class_Oorder__trans_0) ).
cnf(c_55,negated_conjecture,
c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(c_56,negated_conjecture,
c_lessequals(v_k(v_x),v_f(v_x),t_b) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(c_57,negated_conjecture,
c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(c_58,plain,
ifeq(class_Orderings_Olinorder(X0),true,class_Orderings_Oorder(X0),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsrel_Orderings_Olinorder_4) ).
cnf(c_59,plain,
ifeq(class_Ring__and__Field_Oordered__idom(X0),true,class_OrderedGroup_Ocomm__monoid__add(X0),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsrel_Ring__and__Field_Oordered__idom_23) ).
cnf(c_60,plain,
ifeq(class_Ring__and__Field_Oordered__idom(X0),true,class_Orderings_Olinorder(X0),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsrel_Ring__and__Field_Oordered__idom_33) ).
cnf(c_61,plain,
ifeq(class_Ring__and__Field_Oordered__idom(X0),true,class_OrderedGroup_Opordered__ab__group__add(X0),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsrel_Ring__and__Field_Oordered__idom_54) ).
cnf(c_62,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tfree_tcs) ).
cnf(c_223,plain,
ifeq(true,true,class_OrderedGroup_Ocomm__monoid__add(t_b),true) = true,
inference(superposition,[status(thm)],[c_62,c_59]) ).
cnf(c_224,plain,
class_OrderedGroup_Ocomm__monoid__add(t_b) = true,
inference(demodulation,[status(thm)],[c_223,c_50]) ).
cnf(c_227,plain,
ifeq(true,true,class_Orderings_Olinorder(t_b),true) = true,
inference(superposition,[status(thm)],[c_62,c_60]) ).
cnf(c_228,plain,
ifeq(true,true,class_OrderedGroup_Opordered__ab__group__add(t_b),true) = true,
inference(superposition,[status(thm)],[c_62,c_61]) ).
cnf(c_229,plain,
ifeq2(true,true,c_plus(c_0,X0,t_b),X0) = X0,
inference(superposition,[status(thm)],[c_224,c_51]) ).
cnf(c_231,plain,
ifeq(class_OrderedGroup_Opordered__ab__group__add(t_b),true,ifeq(true,true,c_lessequals(c_plus(c_0,v_g(v_x),t_b),v_k(v_x),t_b),true),true) = true,
inference(superposition,[status(thm)],[c_55,c_52]) ).
cnf(c_232,plain,
class_Orderings_Olinorder(t_b) = true,
inference(demodulation,[status(thm)],[c_227,c_50]) ).
cnf(c_234,plain,
ifeq(true,true,class_Orderings_Oorder(t_b),true) = true,
inference(superposition,[status(thm)],[c_232,c_58]) ).
cnf(c_235,plain,
class_OrderedGroup_Opordered__ab__group__add(t_b) = true,
inference(demodulation,[status(thm)],[c_228,c_50]) ).
cnf(c_239,plain,
class_Orderings_Oorder(t_b) = true,
inference(demodulation,[status(thm)],[c_234,c_50]) ).
cnf(c_242,plain,
c_plus(c_0,X0,t_b) = X0,
inference(demodulation,[status(thm)],[c_229,c_49]) ).
cnf(c_248,plain,
ifeq(true,true,ifeq(true,true,c_lessequals(c_plus(c_0,v_g(v_x),t_b),v_k(v_x),t_b),true),true) = true,
inference(light_normalisation,[status(thm)],[c_231,c_235]) ).
cnf(c_249,plain,
c_lessequals(v_g(v_x),v_k(v_x),t_b) = true,
inference(demodulation,[status(thm)],[c_248,c_50,c_242]) ).
cnf(c_262,plain,
ifeq(true,true,ifeq(c_lessequals(c_plus(X0,X1,t_b),X2,t_b),true,c_lessequals(X0,c_minus(X2,X1,t_b),t_b),true),true) = true,
inference(superposition,[status(thm)],[c_235,c_53]) ).
cnf(c_269,plain,
ifeq(c_lessequals(c_plus(X0,X1,t_b),X2,t_b),true,c_lessequals(X0,c_minus(X2,X1,t_b),t_b),true) = true,
inference(demodulation,[status(thm)],[c_262,c_50]) ).
cnf(c_270,plain,
ifeq(c_lessequals(X0,X1,t_b),true,c_lessequals(c_0,c_minus(X1,X0,t_b),t_b),true) = true,
inference(superposition,[status(thm)],[c_242,c_269]) ).
cnf(c_279,plain,
ifeq(class_Orderings_Oorder(t_b),true,ifeq(c_lessequals(X0,v_k(v_x),t_b),true,ifeq(true,true,c_lessequals(X0,v_f(v_x),t_b),true),true),true) = true,
inference(superposition,[status(thm)],[c_56,c_54]) ).
cnf(c_287,plain,
ifeq(true,true,ifeq(c_lessequals(X0,v_k(v_x),t_b),true,ifeq(true,true,c_lessequals(X0,v_f(v_x),t_b),true),true),true) = true,
inference(light_normalisation,[status(thm)],[c_279,c_239]) ).
cnf(c_380,plain,
ifeq(c_lessequals(X0,v_k(v_x),t_b),true,c_lessequals(X0,v_f(v_x),t_b),true) = true,
inference(demodulation,[status(thm)],[c_287,c_50]) ).
cnf(c_381,plain,
ifeq(true,true,c_lessequals(v_g(v_x),v_f(v_x),t_b),true) = true,
inference(superposition,[status(thm)],[c_249,c_380]) ).
cnf(c_455,plain,
c_lessequals(v_g(v_x),v_f(v_x),t_b) = true,
inference(demodulation,[status(thm)],[c_381,c_50]) ).
cnf(c_460,plain,
ifeq(true,true,c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b),true) = true,
inference(superposition,[status(thm)],[c_455,c_270]) ).
cnf(c_486,plain,
c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b) = true,
inference(demodulation,[status(thm)],[c_460,c_50]) ).
cnf(c_487,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_486,c_57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : ANA023-10 : TPTP v8.2.0. Released v7.5.0.
% 0.08/0.14 % Command : run_iprover %s %d THM
% 0.15/0.35 % Computer : n027.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 : Sun Jun 23 04:37:54 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.49 Running UEQ theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_j12_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.47/1.15 % SZS status Started for theBenchmark.p
% 0.47/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 0.47/1.15
% 0.47/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.47/1.15
% 0.47/1.15 ------ iProver source info
% 0.47/1.15
% 0.47/1.15 git: date: 2024-06-12 09:56:46 +0000
% 0.47/1.15 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 0.47/1.15 git: non_committed_changes: false
% 0.47/1.15
% 0.47/1.15 ------ Parsing...successful
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 0.47/1.15
% 0.47/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.47/1.15
% 0.47/1.15 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.47/1.15 ------ Proving...
% 0.47/1.15 ------ Problem Properties
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15 clauses 14
% 0.47/1.15 conjectures 4
% 0.47/1.15 EPR 0
% 0.47/1.15 Horn 14
% 0.47/1.15 unary 14
% 0.47/1.15 binary 0
% 0.47/1.15 lits 14
% 0.47/1.15 lits eq 14
% 0.47/1.15 fd_pure 0
% 0.47/1.15 fd_pseudo 0
% 0.47/1.15 fd_cond 0
% 0.47/1.15 fd_pseudo_cond 0
% 0.47/1.15 AC symbols 0
% 0.47/1.15
% 0.47/1.15 ------ Input Options Time Limit: Unbounded
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15 ------
% 0.47/1.15 Current options:
% 0.47/1.15 ------
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15 ------ Proving...
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 0.47/1.15
% 0.47/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.47/1.15
% 0.47/1.15
%------------------------------------------------------------------------------