TSTP Solution File: SYN328+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN328+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 : n016.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:27 EDT 2023
% Result : Theorem 2.33s 1.62s
% Output : CNFRefutation 2.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 4 unt; 5 typ; 0 def)
% Number of atoms : 59 ( 0 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 56 ( 20 ~; 24 |; 2 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 24 (; 23 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_h > big_g > big_f > #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 > $o ).
tff(f_52,negated_conjecture,
~ ? [X] :
! [Y,Z] :
( ( ( big_f(Y)
=> big_g(Y) )
<=> big_f(X) )
=> ( ( ( big_f(Y)
=> big_h(Y) )
<=> big_g(X) )
=> ( ( ( ( big_f(Y)
=> big_g(Y) )
=> big_h(Y) )
<=> big_h(X) )
=> ( big_f(Z)
& big_g(Z)
& big_h(Z) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_12_3) ).
tff(c_22,plain,
! [X_1] :
( big_f('#skF_1'(X_1))
| big_f(X_1) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_60,plain,
! [X_13] :
( big_g('#skF_1'(X_13))
| ~ big_f('#skF_1'(X_13))
| big_h(X_13) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_20,plain,
! [X_1] :
( ~ big_g('#skF_1'(X_1))
| big_f(X_1) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_74,plain,
! [X_15] :
( big_f(X_15)
| ~ big_f('#skF_1'(X_15))
| big_h(X_15) ),
inference(resolution,[status(thm)],[c_60,c_20]) ).
tff(c_83,plain,
! [X_16] :
( big_h(X_16)
| big_f(X_16) ),
inference(resolution,[status(thm)],[c_22,c_74]) ).
tff(c_12,plain,
! [X_1] :
( ~ big_h('#skF_1'(X_1))
| big_h(X_1) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_90,plain,
! [X_1] :
( big_h(X_1)
| big_f('#skF_1'(X_1)) ),
inference(resolution,[status(thm)],[c_83,c_12]) ).
tff(c_14,plain,
! [X_1] :
( big_g('#skF_1'(X_1))
| ~ big_f('#skF_1'(X_1))
| big_h(X_1) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_92,plain,
! [X_17] :
( big_h(X_17)
| big_f('#skF_1'(X_17)) ),
inference(resolution,[status(thm)],[c_83,c_12]) ).
tff(c_42,plain,
! [X_11] :
( big_h('#skF_1'(X_11))
| ~ big_f('#skF_1'(X_11))
| ~ big_g(X_11) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_49,plain,
! [X_11] :
( big_h(X_11)
| ~ big_f('#skF_1'(X_11))
| ~ big_g(X_11) ),
inference(resolution,[status(thm)],[c_42,c_12]) ).
tff(c_97,plain,
! [X_18] :
( ~ big_g(X_18)
| big_h(X_18) ),
inference(resolution,[status(thm)],[c_92,c_49]) ).
tff(c_106,plain,
! [X_19] :
( big_h(X_19)
| ~ big_g('#skF_1'(X_19)) ),
inference(resolution,[status(thm)],[c_97,c_12]) ).
tff(c_124,plain,
! [X_21] :
( ~ big_f('#skF_1'(X_21))
| big_h(X_21) ),
inference(resolution,[status(thm)],[c_14,c_106]) ).
tff(c_134,plain,
! [X_1] : big_h(X_1),
inference(resolution,[status(thm)],[c_90,c_124]) ).
tff(c_16,plain,
! [X_1] :
( ~ big_h('#skF_1'(X_1))
| big_g(X_1) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_157,plain,
! [X_1] : big_g(X_1),
inference(demodulation,[status(thm),theory(equality)],[c_134,c_16]) ).
tff(c_164,plain,
! [X_1] : big_f(X_1),
inference(demodulation,[status(thm),theory(equality)],[c_157,c_20]) ).
tff(c_96,plain,
! [X_17] :
( ~ big_g(X_17)
| big_h(X_17) ),
inference(resolution,[status(thm)],[c_92,c_49]) ).
tff(c_137,plain,
! [X_22] :
( ~ big_h('#skF_2'(X_22))
| ~ big_g('#skF_2'(X_22))
| ~ big_f('#skF_2'(X_22)) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_144,plain,
! [X_22] :
( ~ big_f('#skF_2'(X_22))
| ~ big_g('#skF_2'(X_22)) ),
inference(resolution,[status(thm)],[c_96,c_137]) ).
tff(c_173,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_157,c_164,c_144]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN328+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/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.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 18:00:07 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.33/1.62 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.33/1.62
% 2.33/1.62 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.33/1.65
% 2.33/1.65 Inference rules
% 2.33/1.65 ----------------------
% 2.33/1.65 #Ref : 0
% 2.33/1.65 #Sup : 26
% 2.33/1.65 #Fact : 0
% 2.33/1.65 #Define : 0
% 2.33/1.65 #Split : 0
% 2.33/1.65 #Chain : 0
% 2.33/1.65 #Close : 0
% 2.33/1.65
% 2.33/1.65 Ordering : KBO
% 2.33/1.65
% 2.33/1.65 Simplification rules
% 2.33/1.65 ----------------------
% 2.33/1.65 #Subsume : 10
% 2.33/1.65 #Demod : 27
% 2.33/1.65 #Tautology : 19
% 2.33/1.65 #SimpNegUnit : 0
% 2.33/1.65 #BackRed : 3
% 2.33/1.65
% 2.33/1.65 #Partial instantiations: 0
% 2.33/1.65 #Strategies tried : 1
% 2.33/1.65
% 2.33/1.65 Timing (in seconds)
% 2.33/1.65 ----------------------
% 2.33/1.66 Preprocessing : 0.41
% 2.33/1.66 Parsing : 0.23
% 2.33/1.66 CNF conversion : 0.03
% 2.33/1.66 Main loop : 0.27
% 2.33/1.66 Inferencing : 0.13
% 2.33/1.66 Reduction : 0.04
% 2.33/1.66 Demodulation : 0.03
% 2.33/1.66 BG Simplification : 0.02
% 2.33/1.66 Subsumption : 0.07
% 2.33/1.66 Abstraction : 0.01
% 2.33/1.66 MUC search : 0.00
% 2.33/1.66 Cooper : 0.00
% 2.33/1.66 Total : 0.73
% 2.33/1.66 Index Insertion : 0.00
% 2.33/1.66 Index Deletion : 0.00
% 2.33/1.66 Index Matching : 0.00
% 2.33/1.66 BG Taut test : 0.00
%------------------------------------------------------------------------------