TSTP Solution File: SYN068+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN068+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 : n032.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:29 EDT 2023
% Result : Theorem 2.13s 1.58s
% Output : CNFRefutation 2.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of formulae : 20 ( 5 unt; 7 typ; 0 def)
% Number of atoms : 25 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 24 ( 12 ~; 5 |; 5 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 6 >; 1 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 10 (; 6 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_h > big_j > big_g > big_f > #nlpp > #skF_2 > #skF_1 > #skF_3
%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 * $i ) > $o ).
tff(big_g,type,
big_g: $i > $o ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(big_f,type,
big_f: $i > $o ).
tff(big_j,type,
big_j: $i > $o ).
tff(f_46,axiom,
? [X] :
( big_j(X)
& ! [Y] :
( big_g(Y)
=> big_h(X,Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel44_2) ).
tff(f_52,negated_conjecture,
~ ? [X] :
( big_j(X)
& ~ big_f(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel44) ).
tff(f_39,axiom,
! [X] :
( big_f(X)
=> ( ? [Y] :
( big_g(Y)
& big_h(X,Y) )
& ? [Y1] :
( big_g(Y1)
& ~ big_h(X,Y1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel44_1) ).
tff(c_12,plain,
big_j('#skF_3'),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_15,plain,
! [X_7] :
( big_f(X_7)
| ~ big_j(X_7) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_19,plain,
big_f('#skF_3'),
inference(resolution,[status(thm)],[c_12,c_15]) ).
tff(c_4,plain,
! [X_1] :
( big_g('#skF_2'(X_1))
| ~ big_f(X_1) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_10,plain,
! [Y_5] :
( big_h('#skF_3',Y_5)
| ~ big_g(Y_5) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_24,plain,
! [X_12] :
( ~ big_h(X_12,'#skF_2'(X_12))
| ~ big_f(X_12) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_28,plain,
( ~ big_f('#skF_3')
| ~ big_g('#skF_2'('#skF_3')) ),
inference(resolution,[status(thm)],[c_10,c_24]) ).
tff(c_31,plain,
~ big_g('#skF_2'('#skF_3')),
inference(demodulation,[status(thm),theory(equality)],[c_19,c_28]) ).
tff(c_34,plain,
~ big_f('#skF_3'),
inference(resolution,[status(thm)],[c_4,c_31]) ).
tff(c_38,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_19,c_34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN068+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.12 % 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.12/0.33 % Computer : n032.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Aug 3 17:25:21 EDT 2023
% 0.12/0.33 % CPUTime :
% 2.13/1.58 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.13/1.58
% 2.13/1.58 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.13/1.61
% 2.13/1.61 Inference rules
% 2.13/1.61 ----------------------
% 2.13/1.61 #Ref : 0
% 2.13/1.61 #Sup : 3
% 2.13/1.61 #Fact : 0
% 2.13/1.61 #Define : 0
% 2.13/1.61 #Split : 0
% 2.13/1.61 #Chain : 0
% 2.13/1.61 #Close : 0
% 2.13/1.61
% 2.13/1.61 Ordering : KBO
% 2.13/1.61
% 2.13/1.61 Simplification rules
% 2.13/1.61 ----------------------
% 2.13/1.61 #Subsume : 0
% 2.13/1.61 #Demod : 2
% 2.13/1.61 #Tautology : 0
% 2.13/1.61 #SimpNegUnit : 0
% 2.13/1.61 #BackRed : 0
% 2.13/1.61
% 2.13/1.61 #Partial instantiations: 0
% 2.13/1.61 #Strategies tried : 1
% 2.13/1.61
% 2.13/1.61 Timing (in seconds)
% 2.13/1.61 ----------------------
% 2.13/1.61 Preprocessing : 0.46
% 2.13/1.61 Parsing : 0.26
% 2.13/1.61 CNF conversion : 0.03
% 2.13/1.61 Main loop : 0.16
% 2.13/1.61 Inferencing : 0.08
% 2.13/1.61 Reduction : 0.03
% 2.13/1.61 Demodulation : 0.02
% 2.13/1.61 BG Simplification : 0.01
% 2.13/1.61 Subsumption : 0.03
% 2.13/1.61 Abstraction : 0.00
% 2.13/1.61 MUC search : 0.00
% 2.13/1.61 Cooper : 0.00
% 2.13/1.61 Total : 0.67
% 2.13/1.61 Index Insertion : 0.00
% 2.13/1.61 Index Deletion : 0.00
% 2.13/1.61 Index Matching : 0.00
% 2.13/1.61 BG Taut test : 0.00
%------------------------------------------------------------------------------