TSTP Solution File: SYN056+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN056+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 : n019.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:10 EDT 2023
% Result : Theorem 3.02s 1.80s
% Output : CNFRefutation 3.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of formulae : 72 ( 37 unt; 8 typ; 0 def)
% Number of atoms : 104 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 92 ( 52 ~; 33 |; 1 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 33 (; 31 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_s > big_r > big_q > big_p > #nlpp > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(big_s,type,
big_s: $i > $o ).
tff(big_q,type,
big_q: $i > $o ).
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(big_r,type,
big_r: $i > $o ).
tff(f_49,negated_conjecture,
~ ( ! [X] :
( big_p(X)
=> big_r(X) )
<=> ! [Y] :
( big_q(Y)
=> big_s(Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel26) ).
tff(f_39,axiom,
! [X,Y] :
( ( big_p(X)
& big_q(Y) )
=> ( big_r(X)
<=> big_s(Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel26_2) ).
tff(f_31,axiom,
( ? [X] : big_p(X)
<=> ? [Y] : big_q(Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel26_1) ).
tff(c_18,plain,
( big_q('#skF_3')
| big_p('#skF_4') ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_27,plain,
big_p('#skF_4'),
inference(splitLeft,[status(thm)],[c_18]) ).
tff(c_24,plain,
! [Y_6] :
( big_q('#skF_3')
| big_s(Y_6)
| ~ big_q(Y_6) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_38,plain,
big_q('#skF_3'),
inference(splitLeft,[status(thm)],[c_24]) ).
tff(c_26,plain,
! [X_5,Y_6] :
( big_r(X_5)
| ~ big_p(X_5)
| big_s(Y_6)
| ~ big_q(Y_6) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_44,plain,
! [Y_8] :
( big_s(Y_8)
| ~ big_q(Y_8) ),
inference(splitLeft,[status(thm)],[c_26]) ).
tff(c_22,plain,
! [Y_6] :
( ~ big_s('#skF_3')
| big_s(Y_6)
| ~ big_q(Y_6) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_39,plain,
~ big_s('#skF_3'),
inference(splitLeft,[status(thm)],[c_22]) ).
tff(c_47,plain,
~ big_q('#skF_3'),
inference(resolution,[status(thm)],[c_44,c_39]) ).
tff(c_51,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_38,c_47]) ).
tff(c_54,plain,
! [X_10] :
( big_r(X_10)
| ~ big_p(X_10) ),
inference(splitRight,[status(thm)],[c_26]) ).
tff(c_12,plain,
( big_q('#skF_3')
| ~ big_r('#skF_4') ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_37,plain,
~ big_r('#skF_4'),
inference(splitLeft,[status(thm)],[c_12]) ).
tff(c_60,plain,
~ big_p('#skF_4'),
inference(resolution,[status(thm)],[c_54,c_37]) ).
tff(c_65,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_27,c_60]) ).
tff(c_67,plain,
big_s('#skF_3'),
inference(splitRight,[status(thm)],[c_22]) ).
tff(c_6,plain,
! [X_3,Y_4] :
( big_r(X_3)
| ~ big_s(Y_4)
| ~ big_q(Y_4)
| ~ big_p(X_3) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_71,plain,
! [Y_12] :
( ~ big_s(Y_12)
| ~ big_q(Y_12) ),
inference(splitLeft,[status(thm)],[c_6]) ).
tff(c_77,plain,
~ big_q('#skF_3'),
inference(resolution,[status(thm)],[c_67,c_71]) ).
tff(c_82,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_38,c_77]) ).
tff(c_84,plain,
! [X_13] :
( big_r(X_13)
| ~ big_p(X_13) ),
inference(splitRight,[status(thm)],[c_6]) ).
tff(c_87,plain,
~ big_p('#skF_4'),
inference(resolution,[status(thm)],[c_84,c_37]) ).
tff(c_91,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_27,c_87]) ).
tff(c_92,plain,
! [Y_6] :
( big_s(Y_6)
| ~ big_q(Y_6) ),
inference(splitRight,[status(thm)],[c_24]) ).
tff(c_97,plain,
! [Y_15] :
( ~ big_s(Y_15)
| ~ big_q(Y_15) ),
inference(splitLeft,[status(thm)],[c_6]) ).
tff(c_101,plain,
! [Y_6] : ~ big_q(Y_6),
inference(resolution,[status(thm)],[c_92,c_97]) ).
tff(c_4,plain,
! [X_2] :
( big_q('#skF_2')
| ~ big_p(X_2) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_28,plain,
! [X_2] : ~ big_p(X_2),
inference(splitLeft,[status(thm)],[c_4]) ).
tff(c_30,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_28,c_27]) ).
tff(c_31,plain,
big_q('#skF_2'),
inference(splitRight,[status(thm)],[c_4]) ).
tff(c_103,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_101,c_31]) ).
tff(c_105,plain,
! [X_16] :
( big_r(X_16)
| ~ big_p(X_16) ),
inference(splitRight,[status(thm)],[c_6]) ).
tff(c_108,plain,
~ big_p('#skF_4'),
inference(resolution,[status(thm)],[c_105,c_37]) ).
tff(c_112,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_27,c_108]) ).
tff(c_113,plain,
big_q('#skF_3'),
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_114,plain,
big_r('#skF_4'),
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_8,plain,
! [Y_4,X_3] :
( big_s(Y_4)
| ~ big_r(X_3)
| ~ big_q(Y_4)
| ~ big_p(X_3) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_123,plain,
! [X_18] :
( ~ big_r(X_18)
| ~ big_p(X_18) ),
inference(splitLeft,[status(thm)],[c_8]) ).
tff(c_129,plain,
~ big_p('#skF_4'),
inference(resolution,[status(thm)],[c_114,c_123]) ).
tff(c_134,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_27,c_129]) ).
tff(c_136,plain,
! [Y_19] :
( big_s(Y_19)
| ~ big_q(Y_19) ),
inference(splitRight,[status(thm)],[c_8]) ).
tff(c_10,plain,
( ~ big_s('#skF_3')
| ~ big_r('#skF_4') ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_116,plain,
~ big_s('#skF_3'),
inference(demodulation,[status(thm),theory(equality)],[c_114,c_10]) ).
tff(c_139,plain,
~ big_q('#skF_3'),
inference(resolution,[status(thm)],[c_136,c_116]) ).
tff(c_143,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_113,c_139]) ).
tff(c_144,plain,
big_q('#skF_3'),
inference(splitRight,[status(thm)],[c_18]) ).
tff(c_145,plain,
~ big_p('#skF_4'),
inference(splitRight,[status(thm)],[c_18]) ).
tff(c_20,plain,
! [X_5] :
( big_r(X_5)
| ~ big_p(X_5)
| big_p('#skF_4') ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_156,plain,
! [X_5] :
( big_r(X_5)
| ~ big_p(X_5) ),
inference(negUnitSimplification,[status(thm)],[c_145,c_20]) ).
tff(c_160,plain,
! [X_21] :
( ~ big_r(X_21)
| ~ big_p(X_21) ),
inference(splitLeft,[status(thm)],[c_8]) ).
tff(c_164,plain,
! [X_5] : ~ big_p(X_5),
inference(resolution,[status(thm)],[c_156,c_160]) ).
tff(c_2,plain,
! [Y_1] :
( big_p('#skF_1')
| ~ big_q(Y_1) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_146,plain,
! [Y_1] : ~ big_q(Y_1),
inference(splitLeft,[status(thm)],[c_2]) ).
tff(c_148,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_146,c_144]) ).
tff(c_149,plain,
big_p('#skF_1'),
inference(splitRight,[status(thm)],[c_2]) ).
tff(c_166,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_164,c_149]) ).
tff(c_168,plain,
! [Y_22] :
( big_s(Y_22)
| ~ big_q(Y_22) ),
inference(splitRight,[status(thm)],[c_8]) ).
tff(c_16,plain,
( ~ big_s('#skF_3')
| big_p('#skF_4') ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_150,plain,
~ big_s('#skF_3'),
inference(negUnitSimplification,[status(thm)],[c_145,c_16]) ).
tff(c_171,plain,
~ big_q('#skF_3'),
inference(resolution,[status(thm)],[c_168,c_150]) ).
tff(c_175,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_144,c_171]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SYN056+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.15 % 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.15/0.36 % Computer : n019.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:21:46 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.02/1.80 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.02/1.81
% 3.02/1.81 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.02/1.85
% 3.02/1.85 Inference rules
% 3.02/1.85 ----------------------
% 3.02/1.85 #Ref : 0
% 3.02/1.85 #Sup : 13
% 3.02/1.85 #Fact : 0
% 3.02/1.85 #Define : 0
% 3.02/1.85 #Split : 14
% 3.02/1.85 #Chain : 0
% 3.02/1.85 #Close : 0
% 3.02/1.85
% 3.02/1.85 Ordering : KBO
% 3.02/1.85
% 3.02/1.85 Simplification rules
% 3.02/1.85 ----------------------
% 3.02/1.85 #Subsume : 22
% 3.02/1.85 #Demod : 18
% 3.02/1.85 #Tautology : 8
% 3.02/1.85 #SimpNegUnit : 8
% 3.02/1.85 #BackRed : 6
% 3.02/1.85
% 3.02/1.85 #Partial instantiations: 0
% 3.02/1.85 #Strategies tried : 1
% 3.02/1.85
% 3.02/1.85 Timing (in seconds)
% 3.02/1.85 ----------------------
% 3.02/1.85 Preprocessing : 0.43
% 3.02/1.85 Parsing : 0.23
% 3.02/1.85 CNF conversion : 0.03
% 3.02/1.85 Main loop : 0.26
% 3.02/1.85 Inferencing : 0.11
% 3.02/1.85 Reduction : 0.05
% 3.02/1.85 Demodulation : 0.04
% 3.02/1.85 BG Simplification : 0.02
% 3.02/1.85 Subsumption : 0.05
% 3.02/1.85 Abstraction : 0.01
% 3.02/1.85 MUC search : 0.00
% 3.02/1.85 Cooper : 0.00
% 3.02/1.85 Total : 0.75
% 3.02/1.85 Index Insertion : 0.00
% 3.02/1.85 Index Deletion : 0.00
% 3.02/1.85 Index Matching : 0.00
% 3.02/1.85 BG Taut test : 0.00
%------------------------------------------------------------------------------