TSTP Solution File: SYN319+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN319+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:10:24 EDT 2023
% Result : Theorem 1.98s 1.58s
% Output : CNFRefutation 2.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of formulae : 16 ( 7 unt; 5 typ; 0 def)
% Number of atoms : 25 ( 0 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 19 ( 5 ~; 5 |; 2 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 5 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 0 con; 2-2 aty)
% Number of variables : 14 (; 12 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_h > big_g > big_f > #nlpp > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(big_h,type,
big_h: $i > $o ).
tff(big_g,type,
big_g: $i > $o ).
tff(big_f,type,
big_f: $i > $o ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_51,negated_conjecture,
~ ? [X,Y] :
! [Z1,Z2] :
( ( ( big_f(Y)
=> big_g(Z1) )
=> ( big_g(X)
& ~ big_f(Z1) ) )
=> ( ( ( big_f(X)
| big_g(X) )
=> big_h(X) )
=> ( big_h(Z2)
& ( big_h(Y)
=> ( ( big_f(Z2)
| big_g(Z2) )
=> big_h(Z2) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_2_5) ).
tff(c_18,plain,
! [Y_2,X_1] :
( big_f(Y_2)
| big_g(X_1) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_19,plain,
! [X_1] : big_g(X_1),
inference(splitLeft,[status(thm)],[c_18]) ).
tff(c_8,plain,
! [X_1] :
( ~ big_g(X_1)
| big_h(X_1) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_22,plain,
! [X_1] : big_h(X_1),
inference(demodulation,[status(thm),theory(equality)],[c_19,c_8]) ).
tff(c_2,plain,
! [X_1,Y_2] : ~ big_h('#skF_2'(X_1,Y_2)),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_26,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_22,c_2]) ).
tff(c_27,plain,
! [Y_2] : big_f(Y_2),
inference(splitRight,[status(thm)],[c_18]) ).
tff(c_10,plain,
! [X_1] :
( ~ big_f(X_1)
| big_h(X_1) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_31,plain,
! [X_1] : big_h(X_1),
inference(demodulation,[status(thm),theory(equality)],[c_27,c_10]) ).
tff(c_34,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_31,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN319+1 : TPTP v8.1.2. Released v2.0.0.
% 0.13/0.14 % 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:31 EDT 2023
% 0.15/0.36 % CPUTime :
% 1.98/1.58 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.20/1.58
% 2.20/1.58 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.20/1.62
% 2.20/1.62 Inference rules
% 2.20/1.62 ----------------------
% 2.20/1.62 #Ref : 0
% 2.20/1.62 #Sup : 0
% 2.20/1.62 #Fact : 0
% 2.20/1.62 #Define : 0
% 2.20/1.62 #Split : 1
% 2.20/1.62 #Chain : 0
% 2.20/1.62 #Close : 0
% 2.20/1.62
% 2.20/1.62 Ordering : KBO
% 2.20/1.62
% 2.20/1.62 Simplification rules
% 2.20/1.62 ----------------------
% 2.20/1.62 #Subsume : 2
% 2.20/1.62 #Demod : 5
% 2.20/1.62 #Tautology : 1
% 2.20/1.62 #SimpNegUnit : 0
% 2.20/1.62 #BackRed : 1
% 2.20/1.62
% 2.20/1.62 #Partial instantiations: 0
% 2.20/1.62 #Strategies tried : 1
% 2.20/1.62
% 2.20/1.62 Timing (in seconds)
% 2.20/1.62 ----------------------
% 2.20/1.62 Preprocessing : 0.40
% 2.20/1.62 Parsing : 0.22
% 2.20/1.62 CNF conversion : 0.03
% 2.20/1.62 Main loop : 0.12
% 2.20/1.62 Inferencing : 0.04
% 2.20/1.62 Reduction : 0.02
% 2.20/1.62 Demodulation : 0.01
% 2.20/1.62 BG Simplification : 0.01
% 2.20/1.62 Subsumption : 0.03
% 2.20/1.62 Abstraction : 0.00
% 2.20/1.62 MUC search : 0.00
% 2.20/1.62 Cooper : 0.00
% 2.20/1.62 Total : 0.58
% 2.20/1.62 Index Insertion : 0.00
% 2.20/1.63 Index Deletion : 0.00
% 2.20/1.63 Index Matching : 0.00
% 2.20/1.63 BG Taut test : 0.00
%------------------------------------------------------------------------------