TSTP Solution File: SYN326+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN326+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 : 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:10:26 EDT 2023
% Result : Theorem 2.11s 1.67s
% Output : CNFRefutation 2.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 14 ( 5 unt; 5 typ; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 17 ( 6 ~; 3 |; 0 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 5 >; 1 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 10 (; 9 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_f > big_h > big_g > #nlpp > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(big_h,type,
big_h: $i > $o ).
tff(big_g,type,
big_g: $i > $o ).
tff(big_f,type,
big_f: ( $i * $i ) > $o ).
tff(f_44,negated_conjecture,
~ ? [X] :
! [Y,Z] :
( ( ( big_f(Y,Z)
=> ( big_g(Y)
=> big_h(X) ) )
=> big_f(X,X) )
=> ( ( ( big_f(Z,X)
=> big_g(X) )
=> big_h(Z) )
=> ( big_f(X,Y)
=> big_f(Z,Z) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_12_1) ).
tff(c_18,plain,
! [X_7] :
( ~ big_h(X_7)
| big_f(X_7,X_7) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_2,plain,
! [X_1] : ~ big_f('#skF_2'(X_1),'#skF_2'(X_1)),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_22,plain,
! [X_1] : ~ big_h('#skF_2'(X_1)),
inference(resolution,[status(thm)],[c_18,c_2]) ).
tff(c_6,plain,
! [X_1] :
( ~ big_g(X_1)
| big_h('#skF_2'(X_1)) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_23,plain,
! [X_1] : ~ big_g(X_1),
inference(negUnitSimplification,[status(thm)],[c_22,c_6]) ).
tff(c_12,plain,
! [X_1] :
( big_g('#skF_1'(X_1))
| big_f(X_1,X_1) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_26,plain,
! [X_1] : big_f(X_1,X_1),
inference(negUnitSimplification,[status(thm)],[c_23,c_12]) ).
tff(c_30,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_26,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN326+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.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 17:35:32 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.11/1.67 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.11/1.67
% 2.11/1.67 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.29/1.70
% 2.29/1.70 Inference rules
% 2.29/1.70 ----------------------
% 2.29/1.70 #Ref : 0
% 2.29/1.70 #Sup : 1
% 2.29/1.70 #Fact : 0
% 2.29/1.70 #Define : 0
% 2.29/1.70 #Split : 0
% 2.29/1.70 #Chain : 0
% 2.29/1.70 #Close : 0
% 2.29/1.70
% 2.29/1.70 Ordering : KBO
% 2.29/1.70
% 2.29/1.70 Simplification rules
% 2.29/1.70 ----------------------
% 2.29/1.70 #Subsume : 0
% 2.29/1.70 #Demod : 2
% 2.29/1.70 #Tautology : 1
% 2.29/1.70 #SimpNegUnit : 2
% 2.29/1.70 #BackRed : 2
% 2.29/1.70
% 2.29/1.70 #Partial instantiations: 0
% 2.29/1.70 #Strategies tried : 1
% 2.29/1.70
% 2.29/1.70 Timing (in seconds)
% 2.29/1.70 ----------------------
% 2.29/1.71 Preprocessing : 0.44
% 2.29/1.71 Parsing : 0.25
% 2.29/1.71 CNF conversion : 0.03
% 2.29/1.71 Main loop : 0.16
% 2.29/1.71 Inferencing : 0.07
% 2.29/1.71 Reduction : 0.03
% 2.29/1.71 Demodulation : 0.02
% 2.29/1.71 BG Simplification : 0.01
% 2.29/1.71 Subsumption : 0.03
% 2.29/1.71 Abstraction : 0.00
% 2.29/1.71 MUC search : 0.00
% 2.29/1.71 Cooper : 0.00
% 2.29/1.71 Total : 0.65
% 2.29/1.71 Index Insertion : 0.00
% 2.29/1.71 Index Deletion : 0.00
% 2.29/1.71 Index Matching : 0.00
% 2.29/1.71 BG Taut test : 0.00
%------------------------------------------------------------------------------