TSTP Solution File: ANA010-2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : ANA010-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:18:00 EDT 2023
% Result : Unsatisfiable 1.88s 1.17s
% Output : CNFRefutation 1.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 11 unt; 0 nHn; 19 RR)
% Number of literals : 46 ( 13 equ; 24 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 36 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
( ~ c_lessequals(c_0,X0,X1)
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
| c_HOL_Oabs(X0,X1) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_OrderedGroup_Oabs__of__nonneg_0) ).
cnf(c_50,plain,
( ~ c_lessequals(X0,X1,X2)
| ~ c_lessequals(X3,X0,X2)
| ~ class_Orderings_Oorder(X2)
| c_lessequals(X3,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Orderings_Oorder__class_Oorder__trans_0) ).
cnf(c_51,plain,
( ~ class_Ring__and__Field_Oordered__idom(X0)
| c_times(c_HOL_Oabs(X1,X0),c_HOL_Oabs(X2,X0),X0) = c_HOL_Oabs(c_times(X1,X2,X0),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Ring__and__Field_Oabs__mult_0) ).
cnf(c_52,negated_conjecture,
c_lessequals(c_0,v_f(X0),t_b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_53,negated_conjecture,
c_lessequals(v_f(X0),c_times(v_c,v_g(X0),t_b),t_b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(c_54,negated_conjecture,
~ c_lessequals(v_f(v_x(X0)),c_times(X0,c_HOL_Oabs(v_g(v_x(X0)),t_b),t_b),t_b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(c_55,plain,
( ~ class_OrderedGroup_Olordered__ab__group__abs(X0)
| class_Orderings_Oorder(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsrel_OrderedGroup_Olordered__ab__group__abs_17) ).
cnf(c_56,plain,
( ~ class_Ring__and__Field_Oordered__idom(X0)
| class_OrderedGroup_Olordered__ab__group__abs(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsrel_Ring__and__Field_Oordered__idom_50) ).
cnf(c_57,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tfree_tcs) ).
cnf(c_132,plain,
( X0 != t_b
| class_OrderedGroup_Olordered__ab__group__abs(X0) ),
inference(resolution_lifted,[status(thm)],[c_56,c_57]) ).
cnf(c_133,plain,
class_OrderedGroup_Olordered__ab__group__abs(t_b),
inference(unflattening,[status(thm)],[c_132]) ).
cnf(c_137,plain,
( X0 != t_b
| c_times(c_HOL_Oabs(X1,X0),c_HOL_Oabs(X2,X0),X0) = c_HOL_Oabs(c_times(X1,X2,X0),X0) ),
inference(resolution_lifted,[status(thm)],[c_51,c_57]) ).
cnf(c_138,plain,
c_times(c_HOL_Oabs(X0,t_b),c_HOL_Oabs(X1,t_b),t_b) = c_HOL_Oabs(c_times(X0,X1,t_b),t_b),
inference(unflattening,[status(thm)],[c_137]) ).
cnf(c_145,plain,
( X0 != t_b
| class_Orderings_Oorder(X0) ),
inference(resolution_lifted,[status(thm)],[c_55,c_133]) ).
cnf(c_146,plain,
class_Orderings_Oorder(t_b),
inference(unflattening,[status(thm)],[c_145]) ).
cnf(c_150,plain,
( X0 != t_b
| ~ c_lessequals(c_0,X1,X0)
| c_HOL_Oabs(X1,X0) = X1 ),
inference(resolution_lifted,[status(thm)],[c_49,c_133]) ).
cnf(c_151,plain,
( ~ c_lessequals(c_0,X0,t_b)
| c_HOL_Oabs(X0,t_b) = X0 ),
inference(unflattening,[status(thm)],[c_150]) ).
cnf(c_162,plain,
( X0 != t_b
| ~ c_lessequals(X1,X2,X0)
| ~ c_lessequals(X3,X1,X0)
| c_lessequals(X3,X2,X0) ),
inference(resolution_lifted,[status(thm)],[c_50,c_146]) ).
cnf(c_163,plain,
( ~ c_lessequals(X0,X1,t_b)
| ~ c_lessequals(X2,X0,t_b)
| c_lessequals(X2,X1,t_b) ),
inference(unflattening,[status(thm)],[c_162]) ).
cnf(c_342,plain,
~ c_lessequals(v_f(v_x(c_HOL_Oabs(X0,t_b))),c_HOL_Oabs(c_times(X0,v_g(v_x(c_HOL_Oabs(X0,t_b))),t_b),t_b),t_b),
inference(superposition,[status(thm)],[c_138,c_54]) ).
cnf(c_363,plain,
( ~ c_lessequals(X0,v_f(X1),t_b)
| c_lessequals(X0,c_times(v_c,v_g(X1),t_b),t_b) ),
inference(superposition,[status(thm)],[c_53,c_163]) ).
cnf(c_383,plain,
( ~ c_lessequals(c_0,v_f(X0),t_b)
| c_HOL_Oabs(c_times(v_c,v_g(X0),t_b),t_b) = c_times(v_c,v_g(X0),t_b) ),
inference(superposition,[status(thm)],[c_363,c_151]) ).
cnf(c_388,plain,
c_HOL_Oabs(c_times(v_c,v_g(X0),t_b),t_b) = c_times(v_c,v_g(X0),t_b),
inference(forward_subsumption_resolution,[status(thm)],[c_383,c_52]) ).
cnf(c_394,plain,
~ c_lessequals(v_f(v_x(c_HOL_Oabs(v_c,t_b))),c_times(v_c,v_g(v_x(c_HOL_Oabs(v_c,t_b))),t_b),t_b),
inference(superposition,[status(thm)],[c_388,c_342]) ).
cnf(c_395,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_394,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ANA010-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n022.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 : Fri Aug 25 18:15:25 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.88/1.17 % SZS status Started for theBenchmark.p
% 1.88/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 1.88/1.17
% 1.88/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.88/1.17
% 1.88/1.17 ------ iProver source info
% 1.88/1.17
% 1.88/1.17 git: date: 2023-05-31 18:12:56 +0000
% 1.88/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.88/1.17 git: non_committed_changes: false
% 1.88/1.17 git: last_make_outside_of_git: false
% 1.88/1.17
% 1.88/1.17 ------ Parsing...successful
% 1.88/1.17
% 1.88/1.17
% 1.88/1.17
% 1.88/1.17 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 1.88/1.17
% 1.88/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.88/1.17
% 1.88/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.88/1.17 ------ Proving...
% 1.88/1.17 ------ Problem Properties
% 1.88/1.17
% 1.88/1.17
% 1.88/1.17 clauses 6
% 1.88/1.17 conjectures 3
% 1.88/1.17 EPR 1
% 1.88/1.17 Horn 6
% 1.88/1.17 unary 4
% 1.88/1.17 binary 1
% 1.88/1.17 lits 9
% 1.88/1.17 lits eq 2
% 1.88/1.17 fd_pure 0
% 1.88/1.17 fd_pseudo 0
% 1.88/1.17 fd_cond 0
% 1.88/1.17 fd_pseudo_cond 0
% 1.88/1.17 AC symbols 0
% 1.88/1.17
% 1.88/1.17 ------ Schedule dynamic 5 is on
% 1.88/1.17
% 1.88/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.88/1.17
% 1.88/1.17
% 1.88/1.17 ------
% 1.88/1.17 Current options:
% 1.88/1.17 ------
% 1.88/1.17
% 1.88/1.17
% 1.88/1.17
% 1.88/1.17
% 1.88/1.17 ------ Proving...
% 1.88/1.17
% 1.88/1.17
% 1.88/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 1.88/1.17
% 1.88/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.88/1.17
% 1.88/1.17
%------------------------------------------------------------------------------