TSTP Solution File: SYN413+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN413+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 : n028.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.83s 1.75s
% Output : CNFRefutation 2.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 3 unt; 3 typ; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 20 ( 11 ~; 6 |; 1 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 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 : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 15 (; 13 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ f > #nlpp > #skF_1 > #skF_2
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(f,type,
f: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(f_40,negated_conjecture,
~ ( ! [Z] :
? [Y] :
! [X] :
( f(X,Y)
<=> ( f(X,Z)
& ~ f(X,X) ) )
=> ~ ? [V] :
! [U] : f(U,V) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kalish256) ).
tff(c_2,plain,
! [U_8] : f(U_8,'#skF_2'),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_4,plain,
! [X_6,Z_1] :
( f(X_6,'#skF_1'(Z_1))
| f(X_6,X_6)
| ~ f(X_6,Z_1) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_29,plain,
! [Z_1] :
( ~ f('#skF_1'(Z_1),Z_1)
| f('#skF_1'(Z_1),'#skF_1'(Z_1)) ),
inference(factorization,[status(thm),theory(equality)],[c_4]) ).
tff(c_51,plain,
! [Z_17] :
( ~ f('#skF_1'(Z_17),Z_17)
| f('#skF_1'(Z_17),'#skF_1'(Z_17)) ),
inference(factorization,[status(thm),theory(equality)],[c_4]) ).
tff(c_6,plain,
! [X_6,Z_1] :
( ~ f(X_6,X_6)
| ~ f(X_6,'#skF_1'(Z_1)) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_59,plain,
! [Z_18,Z_19] :
( ~ f('#skF_1'(Z_18),'#skF_1'(Z_19))
| ~ f('#skF_1'(Z_18),Z_18) ),
inference(resolution,[status(thm)],[c_51,c_6]) ).
tff(c_71,plain,
! [Z_20] : ~ f('#skF_1'(Z_20),Z_20),
inference(resolution,[status(thm)],[c_29,c_59]) ).
tff(c_78,plain,
$false,
inference(resolution,[status(thm)],[c_2,c_71]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN413+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 : n028.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:37:39 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.83/1.75 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.83/1.75
% 2.83/1.75 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.83/1.78
% 2.83/1.78 Inference rules
% 2.83/1.78 ----------------------
% 2.83/1.78 #Ref : 0
% 2.83/1.78 #Sup : 11
% 2.83/1.78 #Fact : 2
% 2.83/1.78 #Define : 0
% 2.83/1.78 #Split : 0
% 2.83/1.78 #Chain : 0
% 2.83/1.78 #Close : 0
% 2.83/1.78
% 2.83/1.78 Ordering : KBO
% 2.83/1.78
% 2.83/1.78 Simplification rules
% 2.83/1.78 ----------------------
% 2.83/1.78 #Subsume : 4
% 2.83/1.78 #Demod : 1
% 2.83/1.78 #Tautology : 3
% 2.83/1.78 #SimpNegUnit : 0
% 2.83/1.78 #BackRed : 0
% 2.83/1.78
% 2.83/1.78 #Partial instantiations: 0
% 2.83/1.78 #Strategies tried : 1
% 2.83/1.78
% 2.83/1.78 Timing (in seconds)
% 2.83/1.78 ----------------------
% 2.83/1.79 Preprocessing : 0.40
% 2.83/1.79 Parsing : 0.22
% 2.83/1.79 CNF conversion : 0.03
% 2.83/1.79 Main loop : 0.18
% 2.83/1.79 Inferencing : 0.08
% 2.83/1.79 Reduction : 0.03
% 2.83/1.79 Demodulation : 0.03
% 2.83/1.79 BG Simplification : 0.01
% 2.83/1.79 Subsumption : 0.04
% 2.83/1.79 Abstraction : 0.01
% 2.83/1.79 MUC search : 0.00
% 2.83/1.79 Cooper : 0.00
% 2.83/1.79 Total : 0.63
% 2.83/1.79 Index Insertion : 0.00
% 2.83/1.79 Index Deletion : 0.00
% 2.83/1.79 Index Matching : 0.00
% 2.83/1.79 BG Taut test : 0.00
%------------------------------------------------------------------------------