TSTP Solution File: HWV022-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : HWV022-1 : TPTP v8.1.2. Released v2.5.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 : Thu Aug 31 02:20:03 EDT 2023
% Result : Unsatisfiable 0.45s 1.16s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 21
% Syntax : Number of clauses : 57 ( 23 unt; 19 nHn; 51 RR)
% Number of literals : 117 ( 43 equ; 44 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 39 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
plus(level(t_139),n1) = fifo_length,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_1) ).
cnf(c_50,negated_conjecture,
~ p_Rd(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_2) ).
cnf(c_51,negated_conjecture,
p_Wr(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_3) ).
cnf(c_52,negated_conjecture,
~ p_Reset(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_4) ).
cnf(c_53,negated_conjecture,
level(plus(t_139,n1)) != fifo_length,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_5) ).
cnf(c_54,plain,
plus(X0,n1) != n0,
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_1) ).
cnf(c_55,plain,
gt(plus(X0,n1),n0),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_2) ).
cnf(c_56,plain,
( ~ gt(X0,n0)
| gt(X0,minus(X0,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_3) ).
cnf(c_58,plain,
( plus(X0,X1) != X2
| minus(X2,X1) = X0
| def_10(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_5) ).
cnf(c_59,plain,
( ~ gt(X0,X1)
| ~ def_10(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_6) ).
cnf(c_61,plain,
( ~ gt(X0,X1)
| gt(plus(X0,n1),plus(X1,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_8) ).
cnf(c_62,plain,
( ~ gt(plus(X0,n1),plus(X1,n1))
| gt(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_9) ).
cnf(c_63,plain,
( ~ gt(plus(X0,n1),X1)
| X0 = X1
| gt(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_10) ).
cnf(c_65,plain,
( X0 = X1
| gt(X0,X1)
| gt(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_12) ).
cnf(c_66,plain,
( ~ gt(X0,X1)
| ~ gt(X1,X2)
| gt(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_13) ).
cnf(c_67,plain,
( ~ gt(X0,X1)
| plus(X1,n1) = X0
| gt(X0,plus(X1,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_14) ).
cnf(c_70,plain,
~ gt(X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_17) ).
cnf(c_71,plain,
( plus(X0,n1) != plus(X1,n1)
| X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_18) ).
cnf(c_72,plain,
plus(n0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_19) ).
cnf(c_74,plain,
level(X0) = int_level(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_21) ).
cnf(c_88,plain,
( ~ gt(fifo_length,int_level(X0))
| ~ p_Wr(X0)
| plus(int_level(X0),n1) = int_level(plus(X0,n1))
| p_Rd(X0)
| p_Reset(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_35) ).
cnf(c_145,plain,
( minus(plus(X0,X1),X1) = X0
| def_10(X1,plus(X0,X1)) ),
inference(unflattening,[status(thm)],[c_58]) ).
cnf(c_996,plain,
plus(int_level(t_139),n1) = fifo_length,
inference(demodulation,[status(thm)],[c_49,c_74]) ).
cnf(c_1025,plain,
int_level(plus(t_139,n1)) != fifo_length,
inference(demodulation,[status(thm)],[c_53,c_74]) ).
cnf(c_10715,plain,
gt(fifo_length,n0),
inference(superposition,[status(thm)],[c_996,c_55]) ).
cnf(c_10721,plain,
gt(n1,n0),
inference(superposition,[status(thm)],[c_72,c_55]) ).
cnf(c_10723,plain,
fifo_length != n0,
inference(superposition,[status(thm)],[c_996,c_54]) ).
cnf(c_10911,plain,
( plus(X0,n1) != fifo_length
| int_level(t_139) = X0 ),
inference(superposition,[status(thm)],[c_996,c_71]) ).
cnf(c_10931,plain,
( ~ gt(X0,int_level(t_139))
| gt(plus(X0,n1),fifo_length) ),
inference(superposition,[status(thm)],[c_996,c_61]) ).
cnf(c_10968,plain,
( ~ gt(plus(X0,n1),fifo_length)
| gt(X0,int_level(t_139)) ),
inference(superposition,[status(thm)],[c_996,c_62]) ).
cnf(c_11001,plain,
( ~ gt(n0,X0)
| gt(plus(X1,n1),X0) ),
inference(superposition,[status(thm)],[c_55,c_66]) ).
cnf(c_11180,plain,
( ~ gt(n1,fifo_length)
| gt(n0,int_level(t_139)) ),
inference(superposition,[status(thm)],[c_72,c_10968]) ).
cnf(c_11203,plain,
( n1 != fifo_length
| int_level(t_139) = n0 ),
inference(superposition,[status(thm)],[c_72,c_10911]) ).
cnf(c_11347,plain,
( ~ gt(X0,int_level(t_139))
| X0 = fifo_length
| gt(X0,fifo_length) ),
inference(superposition,[status(thm)],[c_10931,c_63]) ).
cnf(c_11491,plain,
( ~ gt(n1,fifo_length)
| fifo_length = n0
| gt(n0,fifo_length) ),
inference(superposition,[status(thm)],[c_11180,c_11347]) ).
cnf(c_11492,plain,
( ~ gt(n1,fifo_length)
| gt(n0,fifo_length) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11491,c_10723]) ).
cnf(c_11529,plain,
( minus(plus(int_level(t_139),n1),n1) = int_level(t_139)
| def_10(n1,fifo_length) ),
inference(superposition,[status(thm)],[c_996,c_145]) ).
cnf(c_11533,plain,
( minus(fifo_length,n1) = int_level(t_139)
| def_10(n1,fifo_length) ),
inference(light_normalisation,[status(thm)],[c_11529,c_996]) ).
cnf(c_12404,plain,
~ gt(n0,plus(X0,n1)),
inference(superposition,[status(thm)],[c_11001,c_70]) ).
cnf(c_12451,plain,
( ~ gt(n0,X0)
| plus(X0,n1) = n0 ),
inference(superposition,[status(thm)],[c_67,c_12404]) ).
cnf(c_12457,plain,
~ gt(n0,X0),
inference(forward_subsumption_resolution,[status(thm)],[c_12451,c_54]) ).
cnf(c_12458,plain,
~ gt(n1,fifo_length),
inference(backward_subsumption_resolution,[status(thm)],[c_11492,c_12457]) ).
cnf(c_12762,plain,
( n1 = fifo_length
| gt(fifo_length,n1) ),
inference(superposition,[status(thm)],[c_65,c_12458]) ).
cnf(c_13102,plain,
( ~ def_10(n1,fifo_length)
| n1 = fifo_length ),
inference(superposition,[status(thm)],[c_12762,c_59]) ).
cnf(c_13132,plain,
( minus(fifo_length,n1) = int_level(t_139)
| n1 = fifo_length ),
inference(superposition,[status(thm)],[c_11533,c_13102]) ).
cnf(c_13204,plain,
( ~ gt(fifo_length,n0)
| n1 = fifo_length
| gt(fifo_length,int_level(t_139)) ),
inference(superposition,[status(thm)],[c_13132,c_56]) ).
cnf(c_13207,plain,
( n1 = fifo_length
| gt(fifo_length,int_level(t_139)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_13204,c_10715]) ).
cnf(c_13271,plain,
( ~ p_Wr(t_139)
| plus(int_level(t_139),n1) = int_level(plus(t_139,n1))
| n1 = fifo_length
| p_Rd(t_139)
| p_Reset(t_139) ),
inference(superposition,[status(thm)],[c_13207,c_88]) ).
cnf(c_13276,plain,
( ~ p_Wr(t_139)
| int_level(plus(t_139,n1)) = fifo_length
| n1 = fifo_length
| p_Rd(t_139)
| p_Reset(t_139) ),
inference(light_normalisation,[status(thm)],[c_13271,c_996]) ).
cnf(c_13277,plain,
n1 = fifo_length,
inference(forward_subsumption_resolution,[status(thm)],[c_13276,c_52,c_50,c_1025,c_51]) ).
cnf(c_13278,plain,
int_level(t_139) = n0,
inference(backward_subsumption_resolution,[status(thm)],[c_11203,c_13277]) ).
cnf(c_13292,plain,
( ~ gt(n1,int_level(X0))
| ~ p_Wr(X0)
| plus(int_level(X0),n1) = int_level(plus(X0,n1))
| p_Rd(X0)
| p_Reset(X0) ),
inference(demodulation,[status(thm)],[c_88,c_13277]) ).
cnf(c_13339,plain,
int_level(plus(t_139,n1)) != n1,
inference(demodulation,[status(thm)],[c_1025,c_13277]) ).
cnf(c_13340,plain,
plus(int_level(t_139),n1) = n1,
inference(demodulation,[status(thm)],[c_996,c_13277]) ).
cnf(c_14415,plain,
( ~ gt(n1,n0)
| ~ p_Wr(t_139)
| plus(int_level(t_139),n1) = int_level(plus(t_139,n1))
| p_Rd(t_139)
| p_Reset(t_139) ),
inference(superposition,[status(thm)],[c_13278,c_13292]) ).
cnf(c_14416,plain,
( ~ gt(n1,n0)
| ~ p_Wr(t_139)
| int_level(plus(t_139,n1)) = n1
| p_Rd(t_139)
| p_Reset(t_139) ),
inference(light_normalisation,[status(thm)],[c_14415,c_13340]) ).
cnf(c_14417,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_14416,c_52,c_50,c_13339,c_51,c_10721]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HWV022-1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 29 14:54:49 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.45/1.16 % SZS status Started for theBenchmark.p
% 0.45/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 0.45/1.16
% 0.45/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.45/1.16
% 0.45/1.16 ------ iProver source info
% 0.45/1.16
% 0.45/1.16 git: date: 2023-05-31 18:12:56 +0000
% 0.45/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.45/1.16 git: non_committed_changes: false
% 0.45/1.16 git: last_make_outside_of_git: false
% 0.45/1.16
% 0.45/1.16 ------ Parsing...successful
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16 ------ Preprocessing... sup_sim: 2 sf_s rm: 21 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e
% 0.45/1.16
% 0.45/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.45/1.16
% 0.45/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.45/1.16 ------ Proving...
% 0.45/1.16 ------ Problem Properties
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16 clauses 55
% 0.45/1.16 conjectures 3
% 0.45/1.16 EPR 9
% 0.45/1.16 Horn 25
% 0.45/1.16 unary 11
% 0.45/1.16 binary 14
% 0.45/1.16 lits 155
% 0.45/1.16 lits eq 35
% 0.45/1.16 fd_pure 0
% 0.45/1.16 fd_pseudo 0
% 0.45/1.16 fd_cond 1
% 0.45/1.16 fd_pseudo_cond 4
% 0.45/1.16 AC symbols 0
% 0.45/1.16
% 0.45/1.16 ------ Schedule dynamic 5 is on
% 0.45/1.16
% 0.45/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16 ------
% 0.45/1.16 Current options:
% 0.45/1.16 ------
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16 ------ Proving...
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 0.45/1.16
% 0.45/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.16
% 0.45/1.16
%------------------------------------------------------------------------------