TSTP Solution File: SYN966+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN966+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n015.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 11:17:00 EDT 2023
% Result : Theorem 3.14s 1.79s
% Output : CNFRefutation 3.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 4 unt; 6 typ; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 59 ( 23 ~; 32 |; 0 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 4 >; 4 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 40 (; 40 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ eq > a_member_of > #nlpp > #skF_3 > #skF_4 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a_member_of,type,
a_member_of: ( $i * $i ) > $o ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(eq,type,
eq: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_37,negated_conjecture,
~ ( ! [X,Y] :
( eq(X,Y)
<=> ! [Z] :
( a_member_of(Z,X)
<=> a_member_of(Z,Y) ) )
=> ! [A,B] :
( eq(A,B)
=> eq(B,A) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tff(c_2,plain,
~ eq('#skF_4','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_4,plain,
eq('#skF_3','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_26,plain,
! [X_14,Y_15] :
( a_member_of('#skF_1'(X_14,Y_15),Y_15)
| a_member_of('#skF_2'(X_14,Y_15),X_14)
| eq(X_14,Y_15) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_8,plain,
! [Z_5,X_1,Y_2] :
( a_member_of(Z_5,X_1)
| ~ a_member_of(Z_5,Y_2)
| ~ eq(X_1,Y_2) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_88,plain,
! [X_27,Y_28,X_29] :
( a_member_of('#skF_2'(X_27,Y_28),X_29)
| ~ eq(X_29,X_27)
| a_member_of('#skF_1'(X_27,Y_28),Y_28)
| eq(X_27,Y_28) ),
inference(resolution,[status(thm)],[c_26,c_8]) ).
tff(c_12,plain,
! [X_1,Y_2] :
( a_member_of('#skF_1'(X_1,Y_2),Y_2)
| ~ a_member_of('#skF_2'(X_1,Y_2),Y_2)
| eq(X_1,Y_2) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_116,plain,
! [X_30,X_31] :
( ~ eq(X_30,X_31)
| a_member_of('#skF_1'(X_31,X_30),X_30)
| eq(X_31,X_30) ),
inference(resolution,[status(thm)],[c_88,c_12]) ).
tff(c_6,plain,
! [Z_5,Y_2,X_1] :
( a_member_of(Z_5,Y_2)
| ~ a_member_of(Z_5,X_1)
| ~ eq(X_1,Y_2) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_134,plain,
! [X_31,X_30,Y_2] :
( a_member_of('#skF_1'(X_31,X_30),Y_2)
| ~ eq(X_30,Y_2)
| ~ eq(X_30,X_31)
| eq(X_31,X_30) ),
inference(resolution,[status(thm)],[c_116,c_6]) ).
tff(c_19,plain,
! [X_12,Y_13] :
( ~ a_member_of('#skF_1'(X_12,Y_13),X_12)
| a_member_of('#skF_2'(X_12,Y_13),X_12)
| eq(X_12,Y_13) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_235,plain,
! [X_46,Y_47,X_48] :
( a_member_of('#skF_2'(X_46,Y_47),X_48)
| ~ eq(X_48,X_46)
| ~ a_member_of('#skF_1'(X_46,Y_47),X_46)
| eq(X_46,Y_47) ),
inference(resolution,[status(thm)],[c_19,c_8]) ).
tff(c_261,plain,
! [Y_49,X_50,X_51] :
( a_member_of('#skF_2'(Y_49,X_50),X_51)
| ~ eq(X_51,Y_49)
| ~ eq(X_50,Y_49)
| eq(Y_49,X_50) ),
inference(resolution,[status(thm)],[c_134,c_235]) ).
tff(c_150,plain,
! [X_35,X_36,Y_37] :
( a_member_of('#skF_1'(X_35,X_36),Y_37)
| ~ eq(X_36,Y_37)
| ~ eq(X_36,X_35)
| eq(X_35,X_36) ),
inference(resolution,[status(thm)],[c_116,c_6]) ).
tff(c_10,plain,
! [X_1,Y_2] :
( ~ a_member_of('#skF_1'(X_1,Y_2),X_1)
| ~ a_member_of('#skF_2'(X_1,Y_2),Y_2)
| eq(X_1,Y_2) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_162,plain,
! [Y_37,X_36] :
( ~ a_member_of('#skF_2'(Y_37,X_36),X_36)
| ~ eq(X_36,Y_37)
| eq(Y_37,X_36) ),
inference(resolution,[status(thm)],[c_150,c_10]) ).
tff(c_278,plain,
! [X_52,Y_53] :
( ~ eq(X_52,Y_53)
| eq(Y_53,X_52) ),
inference(resolution,[status(thm)],[c_261,c_162]) ).
tff(c_282,plain,
eq('#skF_4','#skF_3'),
inference(resolution,[status(thm)],[c_4,c_278]) ).
tff(c_288,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2,c_282]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN966+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 17:33:28 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.14/1.79 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.14/1.79
% 3.14/1.79 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.27/1.82
% 3.27/1.82 Inference rules
% 3.27/1.82 ----------------------
% 3.27/1.82 #Ref : 0
% 3.27/1.82 #Sup : 59
% 3.27/1.82 #Fact : 0
% 3.27/1.82 #Define : 0
% 3.27/1.82 #Split : 0
% 3.27/1.82 #Chain : 0
% 3.27/1.82 #Close : 0
% 3.27/1.82
% 3.27/1.82 Ordering : KBO
% 3.27/1.82
% 3.27/1.82 Simplification rules
% 3.27/1.82 ----------------------
% 3.27/1.82 #Subsume : 13
% 3.27/1.82 #Demod : 22
% 3.27/1.82 #Tautology : 21
% 3.27/1.82 #SimpNegUnit : 1
% 3.27/1.82 #BackRed : 0
% 3.27/1.82
% 3.27/1.82 #Partial instantiations: 0
% 3.27/1.82 #Strategies tried : 1
% 3.27/1.82
% 3.27/1.82 Timing (in seconds)
% 3.27/1.82 ----------------------
% 3.27/1.83 Preprocessing : 0.40
% 3.27/1.83 Parsing : 0.21
% 3.27/1.83 CNF conversion : 0.03
% 3.27/1.83 Main loop : 0.37
% 3.27/1.83 Inferencing : 0.17
% 3.27/1.83 Reduction : 0.07
% 3.27/1.83 Demodulation : 0.05
% 3.27/1.83 BG Simplification : 0.02
% 3.27/1.83 Subsumption : 0.09
% 3.27/1.83 Abstraction : 0.01
% 3.27/1.83 MUC search : 0.00
% 3.27/1.83 Cooper : 0.00
% 3.27/1.83 Total : 0.82
% 3.27/1.83 Index Insertion : 0.00
% 3.27/1.83 Index Deletion : 0.00
% 3.27/1.83 Index Matching : 0.00
% 3.27/1.83 BG Taut test : 0.00
%------------------------------------------------------------------------------