TSTP Solution File: SYN380+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN380+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 : n001.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:41 EDT 2023
% Result : Theorem 2.05s 1.57s
% Output : CNFRefutation 2.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 10 ( 4 unt; 3 typ; 0 def)
% Number of atoms : 12 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 10 ( 5 ~; 2 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 12 (; 10 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_r > big_q > #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 ) > $i ).
tff(big_q,type,
big_q: ( $i * $i ) > $o ).
tff(f_38,negated_conjecture,
~ ( ! [W] : ~ big_r(W,W)
=> ? [X,Y] :
( ~ big_r(X,Y)
& ( big_q(Y,X)
=> ! [Z] : big_q(Z,Z) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2132) ).
tff(c_8,plain,
! [Y_6,X_7] :
( big_q(Y_6,X_7)
| big_r(X_7,Y_6) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_2,plain,
! [W_1] : ~ big_r(W_1,W_1),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_13,plain,
! [Y_6] : big_q(Y_6,Y_6),
inference(resolution,[status(thm)],[c_8,c_2]) ).
tff(c_4,plain,
! [X_2,Y_3] :
( ~ big_q('#skF_1'(X_2,Y_3),'#skF_1'(X_2,Y_3))
| big_r(X_2,Y_3) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_16,plain,
! [X_2,Y_3] : big_r(X_2,Y_3),
inference(demodulation,[status(thm),theory(equality)],[c_13,c_4]) ).
tff(c_20,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN380+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 : n001.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 18:01:25 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.05/1.57 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.05/1.58
% 2.05/1.58 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.05/1.60
% 2.05/1.60 Inference rules
% 2.05/1.60 ----------------------
% 2.05/1.60 #Ref : 0
% 2.05/1.60 #Sup : 1
% 2.05/1.60 #Fact : 0
% 2.05/1.60 #Define : 0
% 2.05/1.60 #Split : 0
% 2.05/1.60 #Chain : 0
% 2.05/1.60 #Close : 0
% 2.05/1.60
% 2.05/1.60 Ordering : KBO
% 2.05/1.60
% 2.05/1.60 Simplification rules
% 2.05/1.60 ----------------------
% 2.05/1.60 #Subsume : 0
% 2.05/1.60 #Demod : 3
% 2.05/1.60 #Tautology : 1
% 2.05/1.60 #SimpNegUnit : 0
% 2.05/1.60 #BackRed : 1
% 2.05/1.60
% 2.05/1.60 #Partial instantiations: 0
% 2.05/1.60 #Strategies tried : 1
% 2.05/1.60
% 2.05/1.60 Timing (in seconds)
% 2.05/1.60 ----------------------
% 2.05/1.61 Preprocessing : 0.39
% 2.05/1.61 Parsing : 0.22
% 2.05/1.61 CNF conversion : 0.02
% 2.05/1.61 Main loop : 0.14
% 2.05/1.61 Inferencing : 0.08
% 2.05/1.61 Reduction : 0.02
% 2.05/1.61 Demodulation : 0.01
% 2.05/1.61 BG Simplification : 0.01
% 2.05/1.61 Subsumption : 0.03
% 2.05/1.61 Abstraction : 0.00
% 2.05/1.61 MUC search : 0.00
% 2.05/1.61 Cooper : 0.00
% 2.05/1.61 Total : 0.57
% 2.05/1.61 Index Insertion : 0.00
% 2.05/1.61 Index Deletion : 0.00
% 2.05/1.61 Index Matching : 0.00
% 2.05/1.61 BG Taut test : 0.00
%------------------------------------------------------------------------------