TSTP Solution File: SYN065+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN065+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 : n018.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:13 EDT 2023
% Result : Theorem 2.73s 1.94s
% Output : CNFRefutation 2.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of formulae : 15 ( 6 unt; 6 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 12 ( 5 ~; 5 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 15 (; 13 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_h > 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('#skF_3',type,
'#skF_3': $i ).
tff(big_g,type,
big_g: ( $i * $i ) > $o ).
tff(big_f,type,
big_f: ( $i * $i ) > $o ).
tff(f_32,axiom,
! [X] :
? [Y] : big_g(X,Y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel36_2) ).
tff(f_43,axiom,
! [X,Y] :
( ( big_f(X,Y)
| big_g(X,Y) )
=> ! [Z] :
( ( big_f(Y,Z)
| big_g(Y,Z) )
=> big_h(X,Z) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel36_3) ).
tff(f_47,negated_conjecture,
~ ! [X] :
? [Y] : big_h(X,Y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel36) ).
tff(c_4,plain,
! [X_3] : big_g(X_3,'#skF_2'(X_3)),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_18,plain,
! [X_14,Y_15,Z_16] :
( ~ big_g(X_14,Y_15)
| ~ big_g(Y_15,Z_16)
| big_h(X_14,Z_16) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_22,plain,
! [X_17,Z_18] :
( ~ big_g('#skF_2'(X_17),Z_18)
| big_h(X_17,Z_18) ),
inference(resolution,[status(thm)],[c_4,c_18]) ).
tff(c_32,plain,
! [X_22] : big_h(X_22,'#skF_2'('#skF_2'(X_22))),
inference(resolution,[status(thm)],[c_4,c_22]) ).
tff(c_14,plain,
! [Y_10] : ~ big_h('#skF_3',Y_10),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_37,plain,
$false,
inference(resolution,[status(thm)],[c_32,c_14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN065+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.11/0.32 % Computer : n018.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu Aug 3 17:44:35 EDT 2023
% 0.11/0.32 % CPUTime :
% 2.73/1.94 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.73/1.94
% 2.73/1.94 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.73/2.00
% 2.73/2.00 Inference rules
% 2.73/2.00 ----------------------
% 2.73/2.00 #Ref : 0
% 2.73/2.00 #Sup : 4
% 2.73/2.00 #Fact : 0
% 2.73/2.00 #Define : 0
% 2.73/2.00 #Split : 0
% 2.73/2.00 #Chain : 0
% 2.73/2.00 #Close : 0
% 2.73/2.00
% 2.73/2.00 Ordering : KBO
% 2.73/2.00
% 2.73/2.00 Simplification rules
% 2.73/2.00 ----------------------
% 2.73/2.00 #Subsume : 0
% 2.73/2.00 #Demod : 0
% 2.73/2.00 #Tautology : 0
% 2.73/2.00 #SimpNegUnit : 0
% 2.73/2.00 #BackRed : 0
% 2.73/2.00
% 2.73/2.00 #Partial instantiations: 0
% 2.73/2.00 #Strategies tried : 1
% 2.73/2.00
% 2.73/2.00 Timing (in seconds)
% 2.73/2.00 ----------------------
% 2.73/2.00 Preprocessing : 0.60
% 2.73/2.00 Parsing : 0.33
% 2.73/2.01 CNF conversion : 0.04
% 2.73/2.01 Main loop : 0.22
% 2.73/2.01 Inferencing : 0.10
% 2.73/2.01 Reduction : 0.04
% 2.73/2.01 Demodulation : 0.03
% 2.73/2.01 BG Simplification : 0.02
% 2.73/2.01 Subsumption : 0.05
% 2.73/2.01 Abstraction : 0.01
% 2.73/2.01 MUC search : 0.00
% 2.73/2.01 Cooper : 0.00
% 2.73/2.01 Total : 0.90
% 2.73/2.01 Index Insertion : 0.00
% 2.73/2.01 Index Deletion : 0.00
% 2.73/2.01 Index Matching : 0.00
% 2.73/2.01 BG Taut test : 0.00
%------------------------------------------------------------------------------