TSTP Solution File: SYN411+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN411+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 : 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:47 EDT 2023
% Result : Theorem 2.04s 1.48s
% Output : CNFRefutation 2.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 8
% Syntax : Number of formulae : 14 ( 4 unt; 7 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 8 ( 5 ~; 2 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 1 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 18 (; 15 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ f > #nlpp > #skF_5 > #skF_6 > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f,type,
f: ( $i * $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(f_33,negated_conjecture,
~ ( ! [X,Y,Z] : f(X,Y,Z)
<=> ~ ? [U,V,W] : ~ f(U,V,W) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish250) ).
tff(c_8,plain,
! [U_4,Z_3,W_6,V_5,X_1,Y_2] :
( f(X_1,Y_2,Z_3)
| f(U_4,V_5,W_6) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_9,plain,
! [U_4,V_5,W_6] : f(U_4,V_5,W_6),
inference(splitLeft,[status(thm)],[c_8]) ).
tff(c_2,plain,
( ~ f('#skF_1','#skF_2','#skF_3')
| ~ f('#skF_4','#skF_5','#skF_6') ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_16,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_9,c_9,c_2]) ).
tff(c_17,plain,
! [X_1,Y_2,Z_3] : f(X_1,Y_2,Z_3),
inference(splitRight,[status(thm)],[c_8]) ).
tff(c_20,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_17,c_17,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN411+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 : n002.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:36:16 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.04/1.48 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.04/1.49
% 2.04/1.49 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.04/1.52
% 2.04/1.52 Inference rules
% 2.04/1.52 ----------------------
% 2.04/1.52 #Ref : 0
% 2.04/1.52 #Sup : 0
% 2.04/1.52 #Fact : 0
% 2.04/1.52 #Define : 0
% 2.04/1.52 #Split : 1
% 2.04/1.52 #Chain : 0
% 2.04/1.52 #Close : 0
% 2.04/1.52
% 2.04/1.52 Ordering : KBO
% 2.04/1.52
% 2.04/1.52 Simplification rules
% 2.04/1.52 ----------------------
% 2.04/1.52 #Subsume : 0
% 2.04/1.52 #Demod : 8
% 2.04/1.52 #Tautology : 2
% 2.04/1.52 #SimpNegUnit : 0
% 2.04/1.52 #BackRed : 0
% 2.04/1.52
% 2.04/1.52 #Partial instantiations: 0
% 2.04/1.52 #Strategies tried : 1
% 2.04/1.52
% 2.04/1.52 Timing (in seconds)
% 2.04/1.52 ----------------------
% 2.04/1.53 Preprocessing : 0.36
% 2.04/1.53 Parsing : 0.19
% 2.04/1.53 CNF conversion : 0.02
% 2.04/1.53 Main loop : 0.10
% 2.04/1.53 Inferencing : 0.03
% 2.04/1.53 Reduction : 0.02
% 2.04/1.53 Demodulation : 0.01
% 2.04/1.53 BG Simplification : 0.01
% 2.04/1.53 Subsumption : 0.03
% 2.04/1.53 Abstraction : 0.00
% 2.04/1.53 MUC search : 0.00
% 2.04/1.53 Cooper : 0.00
% 2.04/1.53 Total : 0.51
% 2.04/1.53 Index Insertion : 0.00
% 2.04/1.53 Index Deletion : 0.00
% 2.04/1.53 Index Matching : 0.00
% 2.04/1.53 BG Taut test : 0.00
%------------------------------------------------------------------------------