TSTP Solution File: SYN374+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN374+1 : TPTP v8.1.2. Released v2.0.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 : 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 : Tue Aug 22 11:10:40 EDT 2023
% Result : Theorem 2.14s 1.66s
% Output : CNFRefutation 2.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 53 ( 30 unt; 8 typ; 0 def)
% Number of atoms : 78 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 56 ( 23 ~; 30 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 49 (; 47 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_p > #nlpp > #skF_7 > #skF_5 > #skF_2 > #skF_3 > #skF_1 > #skF_4 > #skF_6
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(big_p,type,
big_p: $i > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff('#skF_6',type,
'#skF_6': $i > $i ).
tff(f_37,negated_conjecture,
~ ( ? [X] :
! [Y] :
( big_p(X)
<=> big_p(Y) )
<=> ( ? [X] : big_p(X)
<=> ! [Y] : big_p(Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2125) ).
tff(c_64,plain,
! [Y_2,Y_6,X_5] :
( big_p('#skF_1')
| ~ big_p(Y_2)
| big_p(Y_6)
| ~ big_p(X_5) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_89,plain,
! [X_5] : ~ big_p(X_5),
inference(splitLeft,[status(thm)],[c_64]) ).
tff(c_72,plain,
! [Y_3,Y_6,X_5] :
( big_p('#skF_2')
| big_p(Y_3)
| big_p(Y_6)
| ~ big_p(X_5) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_73,plain,
! [X_5] : ~ big_p(X_5),
inference(splitLeft,[status(thm)],[c_72]) ).
tff(c_48,plain,
! [Y_3,X_7] :
( big_p('#skF_2')
| big_p(Y_3)
| big_p('#skF_6'(X_7))
| big_p(X_7) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_80,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_73,c_73,c_73,c_73,c_48]) ).
tff(c_81,plain,
! [Y_3,Y_6] :
( big_p('#skF_2')
| big_p(Y_3)
| big_p(Y_6) ),
inference(splitRight,[status(thm)],[c_72]) ).
tff(c_82,plain,
big_p('#skF_2'),
inference(splitLeft,[status(thm)],[c_81]) ).
tff(c_91,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_89,c_82]) ).
tff(c_92,plain,
! [Y_2,Y_6] :
( ~ big_p(Y_2)
| big_p('#skF_1')
| big_p(Y_6) ),
inference(splitRight,[status(thm)],[c_64]) ).
tff(c_93,plain,
! [Y_2] : ~ big_p(Y_2),
inference(splitLeft,[status(thm)],[c_92]) ).
tff(c_96,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_93,c_82]) ).
tff(c_97,plain,
! [Y_6] :
( big_p('#skF_1')
| big_p(Y_6) ),
inference(splitRight,[status(thm)],[c_92]) ).
tff(c_98,plain,
big_p('#skF_1'),
inference(splitLeft,[status(thm)],[c_97]) ).
tff(c_62,plain,
! [Y_2,Y_6,X_5] :
( big_p(Y_2)
| ~ big_p('#skF_1')
| big_p(Y_6)
| ~ big_p(X_5) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_100,plain,
! [Y_2,Y_6,X_5] :
( big_p(Y_2)
| big_p(Y_6)
| ~ big_p(X_5) ),
inference(demodulation,[status(thm),theory(equality)],[c_98,c_62]) ).
tff(c_101,plain,
! [X_5] : ~ big_p(X_5),
inference(splitLeft,[status(thm)],[c_100]) ).
tff(c_104,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_101,c_98]) ).
tff(c_105,plain,
! [Y_2,Y_6] :
( big_p(Y_2)
| big_p(Y_6) ),
inference(splitRight,[status(thm)],[c_100]) ).
tff(c_106,plain,
! [Y_6] : big_p(Y_6),
inference(splitLeft,[status(thm)],[c_105]) ).
tff(c_70,plain,
! [Y_3,Y_6,X_5] :
( ~ big_p('#skF_3')
| big_p(Y_3)
| big_p(Y_6)
| ~ big_p(X_5) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_88,plain,
~ big_p('#skF_3'),
inference(splitLeft,[status(thm)],[c_70]) ).
tff(c_111,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_106,c_88]) ).
tff(c_112,plain,
! [Y_2] : big_p(Y_2),
inference(splitRight,[status(thm)],[c_105]) ).
tff(c_117,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_112,c_88]) ).
tff(c_118,plain,
! [Y_6] : big_p(Y_6),
inference(splitRight,[status(thm)],[c_97]) ).
tff(c_119,plain,
~ big_p('#skF_1'),
inference(splitRight,[status(thm)],[c_97]) ).
tff(c_125,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_118,c_119]) ).
tff(c_126,plain,
! [X_5,Y_3,Y_6] :
( ~ big_p(X_5)
| big_p(Y_3)
| big_p(Y_6) ),
inference(splitRight,[status(thm)],[c_70]) ).
tff(c_128,plain,
! [X_5] : ~ big_p(X_5),
inference(splitLeft,[status(thm)],[c_126]) ).
tff(c_127,plain,
big_p('#skF_3'),
inference(splitRight,[status(thm)],[c_70]) ).
tff(c_131,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_128,c_127]) ).
tff(c_132,plain,
! [Y_6,Y_3] :
( big_p(Y_6)
| big_p(Y_3) ),
inference(splitRight,[status(thm)],[c_126]) ).
tff(c_133,plain,
! [Y_3] : big_p(Y_3),
inference(splitLeft,[status(thm)],[c_132]) ).
tff(c_6,plain,
! [X_4,X_7] :
( ~ big_p('#skF_3')
| ~ big_p(X_4)
| ~ big_p(X_7)
| ~ big_p('#skF_7'(X_7)) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_155,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_133,c_133,c_133,c_133,c_6]) ).
tff(c_156,plain,
! [Y_6] : big_p(Y_6),
inference(splitRight,[status(thm)],[c_132]) ).
tff(c_178,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_156,c_156,c_156,c_156,c_6]) ).
tff(c_179,plain,
! [Y_6,Y_3] :
( big_p(Y_6)
| big_p(Y_3) ),
inference(splitRight,[status(thm)],[c_81]) ).
tff(c_181,plain,
! [Y_3] : big_p(Y_3),
inference(splitLeft,[status(thm)],[c_179]) ).
tff(c_180,plain,
~ big_p('#skF_2'),
inference(splitRight,[status(thm)],[c_81]) ).
tff(c_185,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_181,c_180]) ).
tff(c_186,plain,
! [Y_6] : big_p(Y_6),
inference(splitRight,[status(thm)],[c_179]) ).
tff(c_189,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_186,c_180]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN374+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.14 % 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.14/0.36 % Computer : n022.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 17:11:18 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.14/1.66 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.14/1.67
% 2.14/1.67 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.56/1.71
% 2.56/1.71 Inference rules
% 2.56/1.71 ----------------------
% 2.56/1.71 #Ref : 0
% 2.56/1.71 #Sup : 0
% 2.56/1.71 #Fact : 0
% 2.56/1.71 #Define : 0
% 2.56/1.71 #Split : 14
% 2.56/1.71 #Chain : 0
% 2.56/1.71 #Close : 0
% 2.56/1.71
% 2.56/1.71 Ordering : KBO
% 2.56/1.71
% 2.56/1.71 Simplification rules
% 2.56/1.71 ----------------------
% 2.56/1.71 #Subsume : 25
% 2.56/1.71 #Demod : 97
% 2.56/1.71 #Tautology : 34
% 2.56/1.71 #SimpNegUnit : 13
% 2.56/1.71 #BackRed : 13
% 2.56/1.71
% 2.56/1.71 #Partial instantiations: 0
% 2.56/1.71 #Strategies tried : 1
% 2.56/1.71
% 2.56/1.71 Timing (in seconds)
% 2.56/1.71 ----------------------
% 2.56/1.71 Preprocessing : 0.44
% 2.56/1.71 Parsing : 0.22
% 2.56/1.71 CNF conversion : 0.04
% 2.56/1.72 Main loop : 0.19
% 2.56/1.72 Inferencing : 0.04
% 2.56/1.72 Reduction : 0.05
% 2.56/1.72 Demodulation : 0.03
% 2.56/1.72 BG Simplification : 0.02
% 2.56/1.72 Subsumption : 0.05
% 2.56/1.72 Abstraction : 0.01
% 2.56/1.72 MUC search : 0.00
% 2.56/1.72 Cooper : 0.00
% 2.56/1.72 Total : 0.69
% 2.56/1.72 Index Insertion : 0.00
% 2.56/1.72 Index Deletion : 0.00
% 2.56/1.72 Index Matching : 0.00
% 2.56/1.72 BG Taut test : 0.00
%------------------------------------------------------------------------------