TSTP Solution File: REL014+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : REL014+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n002.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 : Tue Aug 22 10:54:28 EDT 2023
% Result : Theorem 4.09s 2.03s
% Output : CNFRefutation 4.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of formulae : 29 ( 17 unt; 10 typ; 0 def)
% Number of atoms : 21 ( 20 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 4 ~; 1 |; 1 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 24 (; 24 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ meet > join > composition > #nlpp > converse > complement > zero > top > one > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(top,type,
top: $i ).
tff(converse,type,
converse: $i > $i ).
tff(join,type,
join: ( $i * $i ) > $i ).
tff(composition,type,
composition: ( $i * $i ) > $i ).
tff(complement,type,
complement: $i > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(one,type,
one: $i ).
tff(meet,type,
meet: ( $i * $i ) > $i ).
tff(zero,type,
zero: $i ).
tff(f_69,axiom,
! [X0] : ( converse(converse(X0)) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).
tff(f_64,axiom,
! [X0] : ( composition(X0,one) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',composition_identity) ).
tff(f_73,axiom,
! [X0,X1] : ( converse(composition(X0,X1)) = composition(converse(X1),converse(X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_multiplicativity) ).
tff(f_62,axiom,
! [X0,X1,X2] : ( composition(X0,composition(X1,X2)) = composition(composition(X0,X1),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',composition_associativity) ).
tff(f_87,negated_conjecture,
~ ! [X0] :
( ( composition(X0,one) = X0 )
& ( composition(one,X0) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
tff(c_16,plain,
! [X0_17] : ( converse(converse(X0_17)) = X0_17 ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_12,plain,
! [X0_13] : ( composition(X0_13,one) = X0_13 ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_105,plain,
! [X1_32,X0_33] : ( composition(converse(X1_32),converse(X0_33)) = converse(composition(X0_33,X1_32)) ),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_903,plain,
! [X0_60,X1_61] : ( converse(composition(converse(X0_60),X1_61)) = composition(converse(X1_61),X0_60) ),
inference(superposition,[status(thm),theory(equality)],[c_16,c_105]) ).
tff(c_944,plain,
! [X0_60] : ( composition(converse(one),X0_60) = converse(converse(X0_60)) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_903]) ).
tff(c_957,plain,
! [X0_60] : ( composition(converse(one),X0_60) = X0_60 ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_944]) ).
tff(c_959,plain,
! [X0_62] : ( composition(converse(one),X0_62) = X0_62 ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_944]) ).
tff(c_404,plain,
! [X0_44,X1_45,X2_46] : ( composition(composition(X0_44,X1_45),X2_46) = composition(X0_44,composition(X1_45,X2_46)) ),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_426,plain,
! [X0_13,X2_46] : ( composition(X0_13,composition(one,X2_46)) = composition(X0_13,X2_46) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_404]) ).
tff(c_982,plain,
! [X2_46] : ( composition(converse(one),X2_46) = composition(one,X2_46) ),
inference(superposition,[status(thm),theory(equality)],[c_959,c_426]) ).
tff(c_1012,plain,
! [X2_46] : ( composition(one,X2_46) = X2_46 ),
inference(demodulation,[status(thm),theory(equality)],[c_957,c_982]) ).
tff(c_28,plain,
( ( composition('#skF_2',one) != '#skF_2' )
| ( composition(one,'#skF_1') != '#skF_1' ) ),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_30,plain,
composition(one,'#skF_1') != '#skF_1',
inference(demodulation,[status(thm),theory(equality)],[c_12,c_28]) ).
tff(c_1053,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1012,c_30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : REL014+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.36 % Computer : n002.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 15:53:16 EDT 2023
% 0.14/0.36 % CPUTime :
% 4.09/2.03 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.09/2.04
% 4.09/2.04 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.09/2.06
% 4.09/2.06 Inference rules
% 4.09/2.06 ----------------------
% 4.09/2.06 #Ref : 0
% 4.09/2.06 #Sup : 286
% 4.09/2.06 #Fact : 0
% 4.09/2.06 #Define : 0
% 4.09/2.06 #Split : 0
% 4.09/2.06 #Chain : 0
% 4.09/2.06 #Close : 0
% 4.09/2.06
% 4.09/2.06 Ordering : KBO
% 4.09/2.06
% 4.09/2.06 Simplification rules
% 4.09/2.06 ----------------------
% 4.09/2.06 #Subsume : 3
% 4.09/2.06 #Demod : 147
% 4.09/2.06 #Tautology : 141
% 4.09/2.06 #SimpNegUnit : 0
% 4.09/2.06 #BackRed : 10
% 4.09/2.06
% 4.09/2.06 #Partial instantiations: 0
% 4.09/2.06 #Strategies tried : 1
% 4.09/2.06
% 4.09/2.06 Timing (in seconds)
% 4.09/2.06 ----------------------
% 4.09/2.07 Preprocessing : 0.46
% 4.09/2.07 Parsing : 0.25
% 4.09/2.07 CNF conversion : 0.03
% 4.09/2.07 Main loop : 0.53
% 4.09/2.07 Inferencing : 0.19
% 4.09/2.07 Reduction : 0.19
% 4.09/2.07 Demodulation : 0.15
% 4.09/2.07 BG Simplification : 0.02
% 4.09/2.07 Subsumption : 0.09
% 4.09/2.07 Abstraction : 0.02
% 4.09/2.07 MUC search : 0.00
% 4.09/2.07 Cooper : 0.00
% 4.09/2.07 Total : 1.03
% 4.09/2.07 Index Insertion : 0.00
% 4.09/2.07 Index Deletion : 0.00
% 4.09/2.07 Index Matching : 0.00
% 4.09/2.07 BG Taut test : 0.00
%------------------------------------------------------------------------------