TSTP Solution File: HWV017-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : HWV017-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n016.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:00:04 EDT 2023
% Result : Unsatisfiable 0.54s 0.63s
% Output : CNFRefutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 51
% Syntax : Number of formulae : 123 ( 32 unt; 23 typ; 0 def)
% Number of atoms : 217 ( 80 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 189 ( 72 ~; 117 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 27 ( 19 >; 8 *; 0 +; 0 <<)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 105 ( 6 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
n1: $i ).
tff(decl_23,type,
plus: ( $i * $i ) > $i ).
tff(decl_24,type,
n0: $i ).
tff(decl_25,type,
gt: ( $i * $i ) > $o ).
tff(decl_26,type,
minus: ( $i * $i ) > $i ).
tff(decl_27,type,
def_10: ( $i * $i ) > $o ).
tff(decl_28,type,
y_27: $i > $i ).
tff(decl_29,type,
level: $i > $i ).
tff(decl_30,type,
int_level: $i > $i ).
tff(decl_31,type,
fifo_length: $i ).
tff(decl_32,type,
p_Full: $i > $o ).
tff(decl_33,type,
p_Empty: $i > $o ).
tff(decl_34,type,
p_Reset: $i > $o ).
tff(decl_35,type,
wr_level: $i > $i ).
tff(decl_36,type,
rd_level: $i > $i ).
tff(decl_37,type,
p_Wr_error: $i > $o ).
tff(decl_38,type,
p_Rd_error: $i > $o ).
tff(decl_39,type,
p_Mem: ( $i * $i * $i ) > $o ).
tff(decl_40,type,
p_Data_out: ( $i * $i ) > $o ).
tff(decl_41,type,
p_Wr: $i > $o ).
tff(decl_42,type,
p_Rd: $i > $o ).
tff(decl_43,type,
p_Data_in: ( $i * $i ) > $o ).
tff(decl_44,type,
t_139: $i ).
cnf(axiom_4,axiom,
( plus(X3,X2) = X1
| def_10(X2,X1)
| minus(X1,X2) != X3 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_4) ).
cnf(axiom_6,axiom,
( ~ def_10(X1,X2)
| ~ gt(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_6) ).
cnf(axiom_2,axiom,
gt(plus(X1,n1),n0),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_2) ).
cnf(axiom_19,axiom,
plus(n0,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_19) ).
cnf(axiom_8,axiom,
( gt(plus(X1,n1),plus(X2,n1))
| ~ gt(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_8) ).
cnf(axiom_13,axiom,
( gt(X1,X3)
| ~ gt(X1,X2)
| ~ gt(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_13) ).
cnf(axiom_9,axiom,
( gt(X1,X2)
| ~ gt(plus(X1,n1),plus(X2,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_9) ).
cnf(axiom_16,axiom,
( X1 = n0
| X1 = plus(y_27(X1),n1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_16) ).
cnf(quest_1,negated_conjecture,
~ gt(level(t_139),fifo_length),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_1) ).
cnf(axiom_12,axiom,
( gt(X1,X2)
| X2 = X1
| gt(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_12) ).
cnf(axiom_3,axiom,
( gt(X1,minus(X1,n1))
| ~ gt(X1,n0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_3) ).
cnf(axiom_17,axiom,
~ gt(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_17) ).
cnf(axiom_18,axiom,
( X1 = X2
| plus(X1,n1) != plus(X2,n1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_18) ).
cnf(axiom_1,axiom,
plus(X1,n1) != n0,
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_1) ).
cnf(axiom_10,axiom,
( gt(X1,X2)
| X2 = X1
| ~ gt(plus(X1,n1),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_10) ).
cnf(axiom_23,axiom,
( int_level(X1) = fifo_length
| ~ p_Full(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_23) ).
cnf(axiom_21,axiom,
level(X1) = int_level(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_21) ).
cnf(axiom_71,axiom,
( p_Reset(X1)
| p_Wr(X1)
| int_level(plus(X1,n1)) = minus(int_level(X1),n1)
| ~ p_Rd(X1)
| ~ gt(int_level(X1),n0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_71) ).
cnf(quest_5,negated_conjecture,
p_Full(plus(t_139,n1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_5) ).
cnf(quest_2,negated_conjecture,
p_Rd(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_2) ).
cnf(quest_3,negated_conjecture,
~ p_Wr(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_3) ).
cnf(quest_4,negated_conjecture,
~ p_Reset(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_4) ).
cnf(axiom_15,axiom,
( X1 = n0
| gt(X1,n0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_15) ).
cnf(axiom_78,axiom,
( p_Reset(X1)
| p_Wr(X1)
| gt(int_level(X1),n0)
| int_level(plus(X1,n1)) = int_level(X1)
| ~ p_Rd(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_78) ).
cnf(axiom_82,axiom,
( p_Reset(X1)
| p_Wr(X1)
| p_Rd(X1)
| int_level(plus(X1,n1)) = int_level(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_82) ).
cnf(quest_6,negated_conjecture,
gt(fifo_length,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_6) ).
cnf(axiom_5,axiom,
( minus(X1,X2) = X3
| def_10(X2,X1)
| plus(X3,X2) != X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_5) ).
cnf(axiom_7,axiom,
( ~ def_10(X1,X2)
| X2 != X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_7) ).
cnf(c_0_28,axiom,
( plus(X3,X2) = X1
| def_10(X2,X1)
| minus(X1,X2) != X3 ),
axiom_4 ).
cnf(c_0_29,axiom,
( ~ def_10(X1,X2)
| ~ gt(X2,X1) ),
axiom_6 ).
cnf(c_0_30,plain,
( plus(minus(X1,X2),X2) = X1
| def_10(X2,X1) ),
inference(er,[status(thm)],[c_0_28]) ).
cnf(c_0_31,axiom,
gt(plus(X1,n1),n0),
axiom_2 ).
cnf(c_0_32,axiom,
plus(n0,X1) = X1,
axiom_19 ).
cnf(c_0_33,axiom,
( gt(plus(X1,n1),plus(X2,n1))
| ~ gt(X1,X2) ),
axiom_8 ).
cnf(c_0_34,plain,
( plus(minus(X1,X2),X2) = X1
| ~ gt(X1,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,axiom,
( gt(X1,X3)
| ~ gt(X1,X2)
| ~ gt(X2,X3) ),
axiom_13 ).
cnf(c_0_36,plain,
gt(n1,n0),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,axiom,
( gt(X1,X2)
| ~ gt(plus(X1,n1),plus(X2,n1)) ),
axiom_9 ).
cnf(c_0_38,axiom,
( X1 = n0
| X1 = plus(y_27(X1),n1) ),
axiom_16 ).
cnf(c_0_39,negated_conjecture,
~ gt(level(t_139),fifo_length),
quest_1 ).
cnf(c_0_40,axiom,
( gt(X1,X2)
| X2 = X1
| gt(X2,X1) ),
axiom_12 ).
cnf(c_0_41,plain,
( gt(plus(X1,n1),X2)
| ~ gt(X1,minus(X2,n1))
| ~ gt(X2,n1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_42,axiom,
( gt(X1,minus(X1,n1))
| ~ gt(X1,n0) ),
axiom_3 ).
cnf(c_0_43,plain,
( gt(X1,n0)
| ~ gt(X1,n1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_44,axiom,
~ gt(X1,X1),
axiom_17 ).
cnf(c_0_45,plain,
( X1 = n0
| gt(X2,y_27(X1))
| ~ gt(plus(X2,n1),X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_46,negated_conjecture,
( level(t_139) = fifo_length
| gt(fifo_length,level(t_139)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_47,axiom,
( X1 = X2
| plus(X1,n1) != plus(X2,n1) ),
axiom_18 ).
cnf(c_0_48,axiom,
plus(X1,n1) != n0,
axiom_1 ).
cnf(c_0_49,plain,
( gt(plus(X1,n1),X1)
| ~ gt(X1,n1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_50,axiom,
( gt(X1,X2)
| X2 = X1
| ~ gt(plus(X1,n1),X2) ),
axiom_10 ).
cnf(c_0_51,plain,
( X1 = n0
| ~ gt(plus(y_27(X1),n1),X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_52,negated_conjecture,
( level(t_139) = fifo_length
| gt(X1,level(t_139))
| ~ gt(X1,fifo_length) ),
inference(spm,[status(thm)],[c_0_35,c_0_46]) ).
cnf(c_0_53,plain,
y_27(plus(X1,n1)) = X1,
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_38])]),c_0_48]) ).
cnf(c_0_54,axiom,
( int_level(X1) = fifo_length
| ~ p_Full(X1) ),
axiom_23 ).
cnf(c_0_55,axiom,
level(X1) = int_level(X1),
axiom_21 ).
cnf(c_0_56,plain,
( gt(plus(X1,n1),X1)
| ~ gt(plus(X1,n1),n1) ),
inference(spm,[status(thm)],[c_0_37,c_0_49]) ).
cnf(c_0_57,plain,
( gt(plus(X1,n1),n1)
| ~ gt(X1,n0) ),
inference(spm,[status(thm)],[c_0_33,c_0_32]) ).
cnf(c_0_58,plain,
( gt(X1,n0)
| ~ gt(X1,plus(X2,n1)) ),
inference(spm,[status(thm)],[c_0_35,c_0_31]) ).
cnf(c_0_59,plain,
( n0 = X1
| gt(n0,X1)
| ~ gt(n1,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_32]) ).
cnf(c_0_60,negated_conjecture,
( level(t_139) = fifo_length
| level(t_139) = n0
| ~ gt(plus(y_27(level(t_139)),n1),fifo_length) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_61,plain,
( y_27(X1) = minus(X1,n1)
| ~ gt(X1,n1) ),
inference(spm,[status(thm)],[c_0_53,c_0_34]) ).
cnf(c_0_62,axiom,
( p_Reset(X1)
| p_Wr(X1)
| int_level(plus(X1,n1)) = minus(int_level(X1),n1)
| ~ p_Rd(X1)
| ~ gt(int_level(X1),n0) ),
axiom_71 ).
cnf(c_0_63,plain,
( level(X1) = fifo_length
| ~ p_Full(X1) ),
inference(rw,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_64,negated_conjecture,
p_Full(plus(t_139,n1)),
quest_5 ).
cnf(c_0_65,plain,
( gt(plus(X1,n1),X1)
| ~ gt(X1,n0) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_66,plain,
~ gt(n1,plus(X1,n1)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_44]),c_0_48]) ).
cnf(c_0_67,negated_conjecture,
( level(t_139) = n0
| level(t_139) = fifo_length
| ~ gt(plus(minus(level(t_139),n1),n1),fifo_length)
| ~ gt(level(t_139),n1) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_68,plain,
( level(plus(X1,n1)) = minus(level(X1),n1)
| p_Reset(X1)
| p_Wr(X1)
| ~ p_Rd(X1)
| ~ gt(level(X1),n0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_55]),c_0_55]),c_0_55]) ).
cnf(c_0_69,negated_conjecture,
level(plus(t_139,n1)) = fifo_length,
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_70,plain,
gt(plus(X1,n1),X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_65]),c_0_31])]) ).
cnf(c_0_71,negated_conjecture,
p_Rd(t_139),
quest_2 ).
cnf(c_0_72,negated_conjecture,
~ p_Wr(t_139),
quest_3 ).
cnf(c_0_73,negated_conjecture,
~ p_Reset(t_139),
quest_4 ).
cnf(c_0_74,axiom,
( X1 = n0
| gt(X1,n0) ),
axiom_15 ).
cnf(c_0_75,plain,
( X1 = n0
| ~ gt(n1,X1) ),
inference(spm,[status(thm)],[c_0_66,c_0_38]) ).
cnf(c_0_76,negated_conjecture,
( level(t_139) = fifo_length
| level(t_139) = n0
| ~ gt(level(t_139),n1) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_70]),c_0_71])]),c_0_72]),c_0_73]),c_0_74]) ).
cnf(c_0_77,plain,
( X1 = n1
| X1 = n0
| gt(X1,n1) ),
inference(spm,[status(thm)],[c_0_75,c_0_40]) ).
cnf(c_0_78,axiom,
( p_Reset(X1)
| p_Wr(X1)
| gt(int_level(X1),n0)
| int_level(plus(X1,n1)) = int_level(X1)
| ~ p_Rd(X1) ),
axiom_78 ).
cnf(c_0_79,axiom,
( p_Reset(X1)
| p_Wr(X1)
| p_Rd(X1)
| int_level(plus(X1,n1)) = int_level(X1) ),
axiom_82 ).
cnf(c_0_80,negated_conjecture,
( level(t_139) = n1
| level(t_139) = n0
| level(t_139) = fifo_length ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_81,negated_conjecture,
gt(fifo_length,n0),
quest_6 ).
cnf(c_0_82,plain,
( X1 = n1
| gt(X1,n1)
| ~ gt(X1,n0) ),
inference(spm,[status(thm)],[c_0_50,c_0_57]) ).
cnf(c_0_83,plain,
( level(plus(X1,n1)) = level(X1)
| p_Reset(X1)
| p_Wr(X1)
| gt(level(X1),n0)
| ~ p_Rd(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_55]),c_0_55]),c_0_55]) ).
cnf(c_0_84,plain,
( level(plus(X1,n1)) = level(X1)
| p_Reset(X1)
| p_Wr(X1)
| p_Rd(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_55]),c_0_55]) ).
cnf(c_0_85,negated_conjecture,
( minus(fifo_length,n1) = fifo_length
| level(t_139) = n0
| level(t_139) = n1 ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_80]),c_0_69]),c_0_71]),c_0_81])]),c_0_72]),c_0_73]) ).
cnf(c_0_86,axiom,
( minus(X1,X2) = X3
| def_10(X2,X1)
| plus(X3,X2) != X1 ),
axiom_5 ).
cnf(c_0_87,axiom,
( ~ def_10(X1,X2)
| X2 != X1 ),
axiom_7 ).
cnf(c_0_88,negated_conjecture,
( fifo_length = n1
| gt(fifo_length,n1) ),
inference(spm,[status(thm)],[c_0_82,c_0_81]) ).
cnf(c_0_89,plain,
( level(plus(X1,n1)) = level(X1)
| p_Wr(X1)
| p_Reset(X1)
| gt(level(X1),n0) ),
inference(csr,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_90,negated_conjecture,
( level(t_139) = n1
| level(t_139) = n0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_85]),c_0_81])]),c_0_44]) ).
cnf(c_0_91,plain,
( minus(plus(X1,X2),X2) = X1
| def_10(X2,plus(X1,X2)) ),
inference(er,[status(thm)],[c_0_86]) ).
cnf(c_0_92,plain,
~ def_10(X1,X1),
inference(er,[status(thm)],[c_0_87]) ).
cnf(c_0_93,negated_conjecture,
( fifo_length = n1
| gt(X1,n1)
| ~ gt(X1,fifo_length) ),
inference(spm,[status(thm)],[c_0_35,c_0_88]) ).
cnf(c_0_94,negated_conjecture,
( level(t_139) = n1
| fifo_length = n0 ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_69]),c_0_72]),c_0_73]),c_0_44]) ).
cnf(c_0_95,plain,
minus(X1,X1) = n0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_32]),c_0_92]) ).
cnf(c_0_96,negated_conjecture,
( fifo_length = n1
| gt(plus(fifo_length,n1),n1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_49]),c_0_88]) ).
cnf(c_0_97,negated_conjecture,
fifo_length = n0,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_94]),c_0_95]),c_0_69]),c_0_71]),c_0_36])]),c_0_72]),c_0_73]) ).
cnf(c_0_98,plain,
n0 != n1,
inference(spm,[status(thm)],[c_0_48,c_0_32]) ).
cnf(c_0_99,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_97]),c_0_97]),c_0_32]),c_0_98]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : HWV017-1 : TPTP v8.1.2. Released v2.5.0.
% 0.11/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n016.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 29 16:40:46 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.55 start to proof: theBenchmark
% 0.54/0.63 % Version : CSE_E---1.5
% 0.54/0.63 % Problem : theBenchmark.p
% 0.54/0.63 % Proof found
% 0.54/0.63 % SZS status Theorem for theBenchmark.p
% 0.54/0.63 % SZS output start Proof
% See solution above
% 0.54/0.63 % Total time : 0.067000 s
% 0.54/0.63 % SZS output end Proof
% 0.54/0.63 % Total time : 0.072000 s
%------------------------------------------------------------------------------