TSTP Solution File: SYN082+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN082+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/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 : n013.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:09:33 EDT 2023
% Result : Theorem 2.80s 1.64s
% Output : CNFRefutation 2.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 45 ( 20 unt; 6 typ; 0 def)
% Number of atoms : 69 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 68 ( 38 ~; 27 |; 1 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 21 (; 20 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_f > #nlpp > f > #skF_4 > #skF_2 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(f,type,
f: $i > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(big_f,type,
big_f: ( $i * $i ) > $o ).
tff(f_37,negated_conjecture,
~ ! [X] :
( big_f(X,f(X))
<=> ? [Y] :
( ! [Z] :
( big_f(Z,Y)
=> big_f(Z,f(X)) )
& big_f(X,Y) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel60) ).
tff(c_16,plain,
( big_f('#skF_1','#skF_2')
| big_f('#skF_3',f('#skF_3')) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_19,plain,
big_f('#skF_3',f('#skF_3')),
inference(splitLeft,[status(thm)],[c_16]) ).
tff(c_10,plain,
! [Y_9] :
( big_f('#skF_1','#skF_2')
| big_f('#skF_4'(Y_9),Y_9)
| ~ big_f('#skF_3',Y_9) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_21,plain,
big_f('#skF_1','#skF_2'),
inference(splitLeft,[status(thm)],[c_10]) ).
tff(c_12,plain,
! [Z_5,Y_9] :
( big_f(Z_5,f('#skF_1'))
| ~ big_f(Z_5,'#skF_2')
| big_f('#skF_4'(Y_9),Y_9)
| ~ big_f('#skF_3',Y_9) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_25,plain,
! [Y_9] :
( big_f('#skF_4'(Y_9),Y_9)
| ~ big_f('#skF_3',Y_9) ),
inference(splitLeft,[status(thm)],[c_12]) ).
tff(c_6,plain,
! [Z_5,Y_9] :
( big_f(Z_5,f('#skF_1'))
| ~ big_f(Z_5,'#skF_2')
| ~ big_f('#skF_4'(Y_9),f('#skF_3'))
| ~ big_f('#skF_3',Y_9) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_28,plain,
! [Y_12] :
( ~ big_f('#skF_4'(Y_12),f('#skF_3'))
| ~ big_f('#skF_3',Y_12) ),
inference(splitLeft,[status(thm)],[c_6]) ).
tff(c_32,plain,
~ big_f('#skF_3',f('#skF_3')),
inference(resolution,[status(thm)],[c_25,c_28]) ).
tff(c_36,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_19,c_32]) ).
tff(c_38,plain,
! [Z_13] :
( big_f(Z_13,f('#skF_1'))
| ~ big_f(Z_13,'#skF_2') ),
inference(splitRight,[status(thm)],[c_6]) ).
tff(c_8,plain,
! [Y_9] :
( ~ big_f('#skF_1',f('#skF_1'))
| big_f('#skF_4'(Y_9),Y_9)
| ~ big_f('#skF_3',Y_9) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_22,plain,
~ big_f('#skF_1',f('#skF_1')),
inference(splitLeft,[status(thm)],[c_8]) ).
tff(c_41,plain,
~ big_f('#skF_1','#skF_2'),
inference(resolution,[status(thm)],[c_38,c_22]) ).
tff(c_45,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_21,c_41]) ).
tff(c_47,plain,
! [Z_14] :
( big_f(Z_14,f('#skF_1'))
| ~ big_f(Z_14,'#skF_2') ),
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_50,plain,
~ big_f('#skF_1','#skF_2'),
inference(resolution,[status(thm)],[c_47,c_22]) ).
tff(c_54,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_21,c_50]) ).
tff(c_55,plain,
! [Y_9] :
( big_f('#skF_4'(Y_9),Y_9)
| ~ big_f('#skF_3',Y_9) ),
inference(splitRight,[status(thm)],[c_8]) ).
tff(c_56,plain,
big_f('#skF_1',f('#skF_1')),
inference(splitRight,[status(thm)],[c_8]) ).
tff(c_2,plain,
! [Y_9] :
( ~ big_f('#skF_1',f('#skF_1'))
| ~ big_f('#skF_4'(Y_9),f('#skF_3'))
| ~ big_f('#skF_3',Y_9) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_62,plain,
! [Y_16] :
( ~ big_f('#skF_4'(Y_16),f('#skF_3'))
| ~ big_f('#skF_3',Y_16) ),
inference(demodulation,[status(thm),theory(equality)],[c_56,c_2]) ).
tff(c_66,plain,
~ big_f('#skF_3',f('#skF_3')),
inference(resolution,[status(thm)],[c_55,c_62]) ).
tff(c_70,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_19,c_66]) ).
tff(c_71,plain,
! [Y_9] :
( big_f('#skF_4'(Y_9),Y_9)
| ~ big_f('#skF_3',Y_9) ),
inference(splitRight,[status(thm)],[c_10]) ).
tff(c_72,plain,
~ big_f('#skF_1','#skF_2'),
inference(splitRight,[status(thm)],[c_10]) ).
tff(c_4,plain,
! [Y_9] :
( big_f('#skF_1','#skF_2')
| ~ big_f('#skF_4'(Y_9),f('#skF_3'))
| ~ big_f('#skF_3',Y_9) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_76,plain,
! [Y_18] :
( ~ big_f('#skF_4'(Y_18),f('#skF_3'))
| ~ big_f('#skF_3',Y_18) ),
inference(negUnitSimplification,[status(thm)],[c_72,c_4]) ).
tff(c_80,plain,
~ big_f('#skF_3',f('#skF_3')),
inference(resolution,[status(thm)],[c_71,c_76]) ).
tff(c_84,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_19,c_80]) ).
tff(c_85,plain,
big_f('#skF_1','#skF_2'),
inference(splitRight,[status(thm)],[c_16]) ).
tff(c_86,plain,
~ big_f('#skF_3',f('#skF_3')),
inference(splitRight,[status(thm)],[c_16]) ).
tff(c_18,plain,
! [Z_5] :
( big_f(Z_5,f('#skF_1'))
| ~ big_f(Z_5,'#skF_2')
| big_f('#skF_3',f('#skF_3')) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_90,plain,
! [Z_19] :
( big_f(Z_19,f('#skF_1'))
| ~ big_f(Z_19,'#skF_2') ),
inference(negUnitSimplification,[status(thm)],[c_86,c_18]) ).
tff(c_14,plain,
( ~ big_f('#skF_1',f('#skF_1'))
| big_f('#skF_3',f('#skF_3')) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_87,plain,
~ big_f('#skF_1',f('#skF_1')),
inference(negUnitSimplification,[status(thm)],[c_86,c_14]) ).
tff(c_93,plain,
~ big_f('#skF_1','#skF_2'),
inference(resolution,[status(thm)],[c_90,c_87]) ).
tff(c_97,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_85,c_93]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SYN082+1 : TPTP v8.1.2. Released v2.0.0.
% 0.13/0.15 % 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.15/0.36 % Computer : n013.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 17:11:48 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.80/1.64 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.80/1.64
% 2.80/1.64 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.84/1.68
% 2.84/1.68 Inference rules
% 2.84/1.68 ----------------------
% 2.84/1.68 #Ref : 0
% 2.84/1.68 #Sup : 6
% 2.84/1.68 #Fact : 0
% 2.84/1.68 #Define : 0
% 2.84/1.68 #Split : 5
% 2.84/1.68 #Chain : 0
% 2.84/1.68 #Close : 0
% 2.84/1.68
% 2.84/1.68 Ordering : KBO
% 2.84/1.68
% 2.84/1.68 Simplification rules
% 2.84/1.68 ----------------------
% 2.84/1.68 #Subsume : 3
% 2.84/1.68 #Demod : 14
% 2.84/1.68 #Tautology : 7
% 2.84/1.68 #SimpNegUnit : 3
% 2.84/1.68 #BackRed : 0
% 2.84/1.68
% 2.84/1.68 #Partial instantiations: 0
% 2.84/1.68 #Strategies tried : 1
% 2.84/1.68
% 2.84/1.68 Timing (in seconds)
% 2.84/1.68 ----------------------
% 2.84/1.68 Preprocessing : 0.41
% 2.84/1.68 Parsing : 0.22
% 2.84/1.68 CNF conversion : 0.03
% 2.84/1.68 Main loop : 0.20
% 2.84/1.68 Inferencing : 0.08
% 2.84/1.68 Reduction : 0.04
% 2.84/1.68 Demodulation : 0.02
% 2.84/1.69 BG Simplification : 0.02
% 2.84/1.69 Subsumption : 0.05
% 2.84/1.69 Abstraction : 0.01
% 2.84/1.69 MUC search : 0.00
% 2.84/1.69 Cooper : 0.00
% 2.84/1.69 Total : 0.66
% 2.84/1.69 Index Insertion : 0.00
% 2.84/1.69 Index Deletion : 0.00
% 2.84/1.69 Index Matching : 0.00
% 2.84/1.69 BG Taut test : 0.00
%------------------------------------------------------------------------------