TSTP Solution File: SYN317+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN317+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 : n001.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:24 EDT 2023
% Result : Theorem 2.06s 1.56s
% Output : CNFRefutation 2.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 10 unt; 6 typ; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 19 ( 7 ~; 9 |; 0 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 13 (; 10 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_g > big_f > #nlpp > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(big_g,type,
big_g: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(big_f,type,
big_f: $i > $o ).
tff(f_34,negated_conjecture,
~ ( ? [X] :
( big_f(X)
=> big_g(X) )
<=> ? [X,Y] :
( big_f(X)
=> big_g(Y) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_2_3) ).
tff(c_10,plain,
! [Y_2,X_3] :
( ~ big_g(Y_2)
| ~ big_g(X_3) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_19,plain,
! [X_3] : ~ big_g(X_3),
inference(splitLeft,[status(thm)],[c_10]) ).
tff(c_2,plain,
! [X_1,X_3] :
( big_f(X_1)
| big_f(X_3) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_21,plain,
! [X_3] : big_f(X_3),
inference(splitLeft,[status(thm)],[c_2]) ).
tff(c_18,plain,
( ~ big_f('#skF_2')
| big_g('#skF_1')
| ~ big_f('#skF_4')
| big_g('#skF_3') ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_37,plain,
( big_g('#skF_1')
| big_g('#skF_3') ),
inference(demodulation,[status(thm),theory(equality)],[c_21,c_21,c_18]) ).
tff(c_38,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_19,c_19,c_37]) ).
tff(c_39,plain,
! [X_1] : big_f(X_1),
inference(splitRight,[status(thm)],[c_2]) ).
tff(c_55,plain,
( big_g('#skF_1')
| big_g('#skF_3') ),
inference(demodulation,[status(thm),theory(equality)],[c_39,c_39,c_18]) ).
tff(c_56,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_19,c_19,c_55]) ).
tff(c_57,plain,
! [Y_2] : ~ big_g(Y_2),
inference(splitRight,[status(thm)],[c_10]) ).
tff(c_59,plain,
! [X_3] : big_f(X_3),
inference(splitLeft,[status(thm)],[c_2]) ).
tff(c_74,plain,
( big_g('#skF_1')
| big_g('#skF_3') ),
inference(demodulation,[status(thm),theory(equality)],[c_59,c_59,c_18]) ).
tff(c_75,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_57,c_57,c_74]) ).
tff(c_76,plain,
! [X_1] : big_f(X_1),
inference(splitRight,[status(thm)],[c_2]) ).
tff(c_92,plain,
( big_g('#skF_1')
| big_g('#skF_3') ),
inference(demodulation,[status(thm),theory(equality)],[c_76,c_76,c_18]) ).
tff(c_93,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_57,c_57,c_92]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN317+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/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.14/0.36 % Computer : n001.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 18:01:10 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.06/1.56 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.06/1.57
% 2.06/1.57 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.06/1.61
% 2.06/1.61 Inference rules
% 2.06/1.61 ----------------------
% 2.06/1.61 #Ref : 0
% 2.06/1.61 #Sup : 0
% 2.06/1.61 #Fact : 0
% 2.06/1.61 #Define : 0
% 2.06/1.61 #Split : 3
% 2.06/1.61 #Chain : 0
% 2.06/1.61 #Close : 0
% 2.06/1.61
% 2.06/1.61 Ordering : KBO
% 2.06/1.61
% 2.06/1.61 Simplification rules
% 2.06/1.61 ----------------------
% 2.06/1.61 #Subsume : 13
% 2.06/1.61 #Demod : 35
% 2.06/1.61 #Tautology : 8
% 2.06/1.61 #SimpNegUnit : 20
% 2.06/1.61 #BackRed : 0
% 2.06/1.61
% 2.06/1.61 #Partial instantiations: 0
% 2.06/1.61 #Strategies tried : 1
% 2.06/1.61
% 2.06/1.61 Timing (in seconds)
% 2.06/1.61 ----------------------
% 2.06/1.61 Preprocessing : 0.40
% 2.06/1.61 Parsing : 0.21
% 2.06/1.61 CNF conversion : 0.03
% 2.06/1.61 Main loop : 0.15
% 2.06/1.61 Inferencing : 0.03
% 2.06/1.61 Reduction : 0.04
% 2.06/1.61 Demodulation : 0.03
% 2.06/1.61 BG Simplification : 0.01
% 2.06/1.61 Subsumption : 0.04
% 2.06/1.61 Abstraction : 0.01
% 2.06/1.61 MUC search : 0.00
% 2.06/1.61 Cooper : 0.00
% 2.06/1.61 Total : 0.60
% 2.06/1.61 Index Insertion : 0.00
% 2.06/1.61 Index Deletion : 0.00
% 2.06/1.61 Index Matching : 0.00
% 2.06/1.61 BG Taut test : 0.00
%------------------------------------------------------------------------------