TSTP Solution File: SYN371+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN371+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 : n015.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:39 EDT 2023
% Result : Theorem 1.93s 1.58s
% Output : CNFRefutation 2.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of formulae : 6 ( 3 unt; 2 typ; 0 def)
% Number of atoms : 7 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 5 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 6 (; 4 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_r > #nlpp > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(big_r,type,
big_r: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(f_37,negated_conjecture,
~ ( ( ? [X] : big_r(X,X)
=> ! [Y] : big_r(Y,Y) )
=> ? [U] :
! [V] :
( big_r(U,U)
=> big_r(V,V) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2122) ).
tff(c_4,plain,
! [U_3] : big_r(U_3,U_3),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_2,plain,
! [U_3] : ~ big_r('#skF_1'(U_3),'#skF_1'(U_3)),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_10,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN371+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.14/0.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 17:33:59 EDT 2023
% 0.14/0.35 % CPUTime :
% 1.93/1.58 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.93/1.58
% 1.93/1.58 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.41/1.62
% 2.41/1.62 Inference rules
% 2.41/1.62 ----------------------
% 2.41/1.62 #Ref : 0
% 2.41/1.62 #Sup : 0
% 2.41/1.62 #Fact : 0
% 2.41/1.62 #Define : 0
% 2.41/1.62 #Split : 0
% 2.41/1.62 #Chain : 0
% 2.41/1.62 #Close : 0
% 2.41/1.62
% 2.41/1.62 Ordering : KBO
% 2.41/1.62
% 2.41/1.62 Simplification rules
% 2.41/1.62 ----------------------
% 2.41/1.62 #Subsume : 1
% 2.41/1.62 #Demod : 3
% 2.41/1.62 #Tautology : 1
% 2.41/1.62 #SimpNegUnit : 0
% 2.41/1.62 #BackRed : 0
% 2.41/1.62
% 2.41/1.62 #Partial instantiations: 0
% 2.41/1.62 #Strategies tried : 1
% 2.41/1.62
% 2.41/1.62 Timing (in seconds)
% 2.41/1.62 ----------------------
% 2.41/1.63 Preprocessing : 0.42
% 2.41/1.63 Parsing : 0.24
% 2.41/1.63 CNF conversion : 0.02
% 2.41/1.63 Main loop : 0.05
% 2.41/1.63 Inferencing : 0.00
% 2.41/1.63 Reduction : 0.02
% 2.41/1.63 Demodulation : 0.02
% 2.41/1.63 BG Simplification : 0.01
% 2.41/1.63 Subsumption : 0.02
% 2.41/1.63 Abstraction : 0.00
% 2.41/1.63 MUC search : 0.00
% 2.41/1.63 Cooper : 0.00
% 2.41/1.63 Total : 0.53
% 2.41/1.63 Index Insertion : 0.00
% 2.41/1.63 Index Deletion : 0.00
% 2.41/1.63 Index Matching : 0.00
% 2.41/1.63 BG Taut test : 0.00
%------------------------------------------------------------------------------