TSTP Solution File: SYN384+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN384+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 : n002.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:42 EDT 2023
% Result : Theorem 1.92s 1.50s
% Output : CNFRefutation 2.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of formulae : 7 ( 3 unt; 3 typ; 0 def)
% Number of atoms : 5 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 3 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 2 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 8 (; 6 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_p > #nlpp > #skF_1 > #skF_2
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(big_p,type,
big_p: ( $i * $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(f_33,negated_conjecture,
~ ! [Z] :
? [X,Y] :
! [U] :
( big_p(X,Y,Z)
=> big_p(U,X,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2136) ).
tff(c_4,plain,
! [X_5,Y_6] : big_p(X_5,Y_6,'#skF_1'),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_6,plain,
! [X_10,Y_11] : ~ big_p('#skF_2'(X_10,Y_11),X_10,X_10),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_11,plain,
$false,
inference(resolution,[status(thm)],[c_4,c_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN384+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.36 % Computer : n002.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 17:23:46 EDT 2023
% 0.14/0.36 % CPUTime :
% 1.92/1.50 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.92/1.51
% 1.92/1.51 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.09/1.54
% 2.09/1.55 Inference rules
% 2.09/1.55 ----------------------
% 2.09/1.55 #Ref : 0
% 2.09/1.55 #Sup : 1
% 2.09/1.55 #Fact : 0
% 2.09/1.55 #Define : 0
% 2.09/1.55 #Split : 0
% 2.09/1.55 #Chain : 0
% 2.09/1.55 #Close : 0
% 2.09/1.55
% 2.09/1.55 Ordering : KBO
% 2.09/1.55
% 2.09/1.55 Simplification rules
% 2.09/1.55 ----------------------
% 2.09/1.55 #Subsume : 0
% 2.09/1.55 #Demod : 0
% 2.09/1.55 #Tautology : 0
% 2.09/1.55 #SimpNegUnit : 0
% 2.09/1.55 #BackRed : 0
% 2.09/1.55
% 2.09/1.55 #Partial instantiations: 0
% 2.09/1.55 #Strategies tried : 1
% 2.09/1.55
% 2.09/1.55 Timing (in seconds)
% 2.09/1.55 ----------------------
% 2.09/1.55 Preprocessing : 0.38
% 2.09/1.55 Parsing : 0.21
% 2.09/1.55 CNF conversion : 0.02
% 2.09/1.55 Main loop : 0.10
% 2.09/1.55 Inferencing : 0.05
% 2.09/1.55 Reduction : 0.02
% 2.09/1.55 Demodulation : 0.02
% 2.09/1.55 BG Simplification : 0.01
% 2.09/1.55 Subsumption : 0.02
% 2.09/1.55 Abstraction : 0.00
% 2.09/1.55 MUC search : 0.00
% 2.09/1.55 Cooper : 0.00
% 2.09/1.55 Total : 0.53
% 2.09/1.55 Index Insertion : 0.00
% 2.09/1.55 Index Deletion : 0.00
% 2.09/1.55 Index Matching : 0.00
% 2.09/1.55 BG Taut test : 0.00
%------------------------------------------------------------------------------