TSTP Solution File: SET045-5 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET045-5 : TPTP v8.1.2. Released v1.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 : n026.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 10:55:41 EDT 2023
% Result : Unsatisfiable 2.54s 1.69s
% Output : CNFRefutation 2.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 14 ( 4 unt; 3 typ; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 20 ( 11 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 (; 15 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ element > #nlpp > f > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff(f,type,
f: $i > $i ).
tff(f_47,axiom,
! [X] : element(X,a),
file(unknown,unknown) ).
tff(f_45,axiom,
! [X,Y] :
( ~ element(X,Y)
| element(X,X)
| element(X,f(Y)) ),
file(unknown,unknown) ).
tff(f_38,axiom,
! [X,Y] :
( ~ element(X,f(Y))
| ~ element(X,X) ),
file(unknown,unknown) ).
tff(c_8,plain,
! [X_7] : element(X_7,a),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_6,plain,
! [X_5,Y_6] :
( element(X_5,f(Y_6))
| element(X_5,X_5)
| ~ element(X_5,Y_6) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_29,plain,
! [Y_6] :
( ~ element(f(Y_6),Y_6)
| element(f(Y_6),f(Y_6)) ),
inference(factorization,[status(thm),theory(equality)],[c_6]) ).
tff(c_51,plain,
! [Y_16] :
( ~ element(f(Y_16),Y_16)
| element(f(Y_16),f(Y_16)) ),
inference(factorization,[status(thm),theory(equality)],[c_6]) ).
tff(c_4,plain,
! [X_3,Y_4] :
( ~ element(X_3,X_3)
| ~ element(X_3,f(Y_4)) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_59,plain,
! [Y_17,Y_18] :
( ~ element(f(Y_17),f(Y_18))
| ~ element(f(Y_17),Y_17) ),
inference(resolution,[status(thm)],[c_51,c_4]) ).
tff(c_71,plain,
! [Y_19] : ~ element(f(Y_19),Y_19),
inference(resolution,[status(thm)],[c_29,c_59]) ).
tff(c_78,plain,
$false,
inference(resolution,[status(thm)],[c_8,c_71]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET045-5 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % 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.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 16:33:31 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.54/1.69 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.54/1.69
% 2.54/1.69 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.83/1.72
% 2.83/1.72 Inference rules
% 2.83/1.72 ----------------------
% 2.83/1.72 #Ref : 0
% 2.83/1.72 #Sup : 11
% 2.83/1.72 #Fact : 2
% 2.83/1.72 #Define : 0
% 2.83/1.72 #Split : 0
% 2.83/1.72 #Chain : 0
% 2.83/1.72 #Close : 0
% 2.83/1.72
% 2.83/1.72 Ordering : KBO
% 2.83/1.72
% 2.83/1.72 Simplification rules
% 2.83/1.72 ----------------------
% 2.83/1.72 #Subsume : 4
% 2.83/1.72 #Demod : 1
% 2.83/1.72 #Tautology : 3
% 2.83/1.72 #SimpNegUnit : 0
% 2.83/1.72 #BackRed : 0
% 2.83/1.72
% 2.83/1.72 #Partial instantiations: 0
% 2.83/1.72 #Strategies tried : 1
% 2.83/1.72
% 2.83/1.72 Timing (in seconds)
% 2.83/1.72 ----------------------
% 2.83/1.73 Preprocessing : 0.40
% 2.83/1.73 Parsing : 0.22
% 2.83/1.73 CNF conversion : 0.02
% 2.83/1.73 Main loop : 0.18
% 2.83/1.73 Inferencing : 0.08
% 2.83/1.73 Reduction : 0.03
% 2.83/1.73 Demodulation : 0.03
% 2.83/1.73 BG Simplification : 0.01
% 2.83/1.73 Subsumption : 0.04
% 2.83/1.73 Abstraction : 0.01
% 2.83/1.73 MUC search : 0.00
% 2.83/1.73 Cooper : 0.00
% 2.83/1.73 Total : 0.63
% 2.83/1.73 Index Insertion : 0.00
% 2.83/1.73 Index Deletion : 0.00
% 2.83/1.73 Index Matching : 0.00
% 2.83/1.73 BG Taut test : 0.00
%------------------------------------------------------------------------------