TSTP Solution File: SYN078+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN078+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 : n009.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:32 EDT 2023
% Result : Theorem 2.77s 1.64s
% Output : CNFRefutation 2.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 55 ( 28 unt; 5 typ; 0 def)
% Number of atoms : 82 ( 6 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 68 ( 36 ~; 28 |; 1 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 17 (; 16 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_p > #nlpp > f > #skF_2 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
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_p,type,
big_p: $i > $o ).
tff(f_40,negated_conjecture,
~ ( ! [X] :
( ? [Y] :
( big_p(Y)
& ( X = f(Y) ) )
=> big_p(X) )
<=> ! [U] :
( big_p(U)
=> big_p(f(U)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel56) ).
tff(c_4,plain,
( big_p('#skF_1')
| ~ big_p('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_26,plain,
~ big_p('#skF_2'),
inference(splitLeft,[status(thm)],[c_4]) ).
tff(c_16,plain,
( big_p('#skF_1')
| big_p('#skF_3') ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_25,plain,
big_p('#skF_3'),
inference(splitLeft,[status(thm)],[c_16]) ).
tff(c_10,plain,
( big_p('#skF_1')
| ( f('#skF_3') = '#skF_2' ) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_27,plain,
f('#skF_3') = '#skF_2',
inference(splitLeft,[status(thm)],[c_10]) ).
tff(c_22,plain,
! [U_4] :
( big_p('#skF_1')
| big_p(f(U_4))
| ~ big_p(U_4) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_34,plain,
big_p('#skF_1'),
inference(splitLeft,[status(thm)],[c_22]) ).
tff(c_24,plain,
! [Y_3,U_4] :
( big_p(f(Y_3))
| ~ big_p(Y_3)
| big_p(f(U_4))
| ~ big_p(U_4) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_39,plain,
! [U_6] :
( big_p(f(U_6))
| ~ big_p(U_6) ),
inference(splitLeft,[status(thm)],[c_24]) ).
tff(c_20,plain,
! [U_4] :
( ~ big_p(f('#skF_1'))
| big_p(f(U_4))
| ~ big_p(U_4) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_36,plain,
~ big_p(f('#skF_1')),
inference(splitLeft,[status(thm)],[c_20]) ).
tff(c_42,plain,
~ big_p('#skF_1'),
inference(resolution,[status(thm)],[c_39,c_36]) ).
tff(c_49,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_34,c_42]) ).
tff(c_51,plain,
! [Y_7] :
( big_p(f(Y_7))
| ~ big_p(Y_7) ),
inference(splitRight,[status(thm)],[c_24]) ).
tff(c_54,plain,
~ big_p('#skF_1'),
inference(resolution,[status(thm)],[c_51,c_36]) ).
tff(c_61,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_34,c_54]) ).
tff(c_65,plain,
! [U_8] :
( big_p(f(U_8))
| ~ big_p(U_8) ),
inference(splitRight,[status(thm)],[c_20]) ).
tff(c_68,plain,
( big_p('#skF_2')
| ~ big_p('#skF_3') ),
inference(superposition,[status(thm),theory(equality)],[c_27,c_65]) ).
tff(c_70,plain,
big_p('#skF_2'),
inference(demodulation,[status(thm),theory(equality)],[c_25,c_68]) ).
tff(c_72,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_26,c_70]) ).
tff(c_75,plain,
! [U_9] :
( big_p(f(U_9))
| ~ big_p(U_9) ),
inference(splitRight,[status(thm)],[c_22]) ).
tff(c_78,plain,
( big_p('#skF_2')
| ~ big_p('#skF_3') ),
inference(superposition,[status(thm),theory(equality)],[c_27,c_75]) ).
tff(c_80,plain,
big_p('#skF_2'),
inference(demodulation,[status(thm),theory(equality)],[c_25,c_78]) ).
tff(c_82,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_26,c_80]) ).
tff(c_83,plain,
big_p('#skF_1'),
inference(splitRight,[status(thm)],[c_10]) ).
tff(c_84,plain,
f('#skF_3') != '#skF_2',
inference(splitRight,[status(thm)],[c_10]) ).
tff(c_12,plain,
! [Y_3] :
( big_p(f(Y_3))
| ~ big_p(Y_3)
| ( f('#skF_3') = '#skF_2' ) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_90,plain,
! [Y_10] :
( big_p(f(Y_10))
| ~ big_p(Y_10) ),
inference(negUnitSimplification,[status(thm)],[c_84,c_12]) ).
tff(c_8,plain,
( ~ big_p(f('#skF_1'))
| ( f('#skF_3') = '#skF_2' ) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_86,plain,
~ big_p(f('#skF_1')),
inference(negUnitSimplification,[status(thm)],[c_84,c_8]) ).
tff(c_93,plain,
~ big_p('#skF_1'),
inference(resolution,[status(thm)],[c_90,c_86]) ).
tff(c_97,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_83,c_93]) ).
tff(c_98,plain,
big_p('#skF_1'),
inference(splitRight,[status(thm)],[c_4]) ).
tff(c_99,plain,
big_p('#skF_2'),
inference(splitRight,[status(thm)],[c_4]) ).
tff(c_6,plain,
! [Y_3] :
( big_p(f(Y_3))
| ~ big_p(Y_3)
| ~ big_p('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_107,plain,
! [Y_11] :
( big_p(f(Y_11))
| ~ big_p(Y_11) ),
inference(demodulation,[status(thm),theory(equality)],[c_99,c_6]) ).
tff(c_2,plain,
( ~ big_p(f('#skF_1'))
| ~ big_p('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_101,plain,
~ big_p(f('#skF_1')),
inference(demodulation,[status(thm),theory(equality)],[c_99,c_2]) ).
tff(c_110,plain,
~ big_p('#skF_1'),
inference(resolution,[status(thm)],[c_107,c_101]) ).
tff(c_114,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_98,c_110]) ).
tff(c_115,plain,
big_p('#skF_1'),
inference(splitRight,[status(thm)],[c_16]) ).
tff(c_116,plain,
~ big_p('#skF_3'),
inference(splitRight,[status(thm)],[c_16]) ).
tff(c_18,plain,
! [Y_3] :
( big_p(f(Y_3))
| ~ big_p(Y_3)
| big_p('#skF_3') ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_122,plain,
! [Y_12] :
( big_p(f(Y_12))
| ~ big_p(Y_12) ),
inference(negUnitSimplification,[status(thm)],[c_116,c_18]) ).
tff(c_14,plain,
( ~ big_p(f('#skF_1'))
| big_p('#skF_3') ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_119,plain,
~ big_p(f('#skF_1')),
inference(negUnitSimplification,[status(thm)],[c_116,c_14]) ).
tff(c_125,plain,
~ big_p('#skF_1'),
inference(resolution,[status(thm)],[c_122,c_119]) ).
tff(c_129,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_115,c_125]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN078+1 : TPTP v8.1.2. Released v2.0.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.16/0.34 % Computer : n009.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Thu Aug 3 17:02:53 EDT 2023
% 0.16/0.34 % CPUTime :
% 2.77/1.64 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.77/1.65
% 2.77/1.65 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.77/1.69
% 2.77/1.69 Inference rules
% 2.77/1.69 ----------------------
% 2.77/1.69 #Ref : 0
% 2.77/1.69 #Sup : 11
% 2.77/1.69 #Fact : 0
% 2.77/1.69 #Define : 0
% 2.77/1.69 #Split : 6
% 2.77/1.69 #Chain : 0
% 2.77/1.69 #Close : 0
% 2.77/1.69
% 2.77/1.69 Ordering : KBO
% 2.77/1.69
% 2.77/1.69 Simplification rules
% 2.77/1.69 ----------------------
% 2.77/1.69 #Subsume : 9
% 2.77/1.69 #Demod : 23
% 2.77/1.69 #Tautology : 15
% 2.77/1.69 #SimpNegUnit : 6
% 2.77/1.69 #BackRed : 0
% 2.77/1.69
% 2.77/1.69 #Partial instantiations: 0
% 2.77/1.69 #Strategies tried : 1
% 2.77/1.69
% 2.77/1.69 Timing (in seconds)
% 2.77/1.69 ----------------------
% 2.77/1.69 Preprocessing : 0.42
% 2.77/1.69 Parsing : 0.22
% 2.77/1.69 CNF conversion : 0.03
% 2.77/1.69 Main loop : 0.20
% 2.77/1.69 Inferencing : 0.07
% 2.77/1.69 Reduction : 0.05
% 2.77/1.70 Demodulation : 0.03
% 2.77/1.70 BG Simplification : 0.02
% 2.77/1.70 Subsumption : 0.05
% 2.77/1.70 Abstraction : 0.01
% 2.77/1.70 MUC search : 0.00
% 2.77/1.70 Cooper : 0.00
% 2.77/1.70 Total : 0.69
% 2.77/1.70 Index Insertion : 0.00
% 2.77/1.70 Index Deletion : 0.00
% 2.77/1.70 Index Matching : 0.00
% 2.77/1.70 BG Taut test : 0.00
%------------------------------------------------------------------------------