TSTP Solution File: SET047-5 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET047-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 : 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 10:55:41 EDT 2023
% Result : Unsatisfiable 3.09s 1.71s
% Output : CNFRefutation 3.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 36 ( 8 unt; 5 typ; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 76 ( 32 ~; 44 |; 0 &)
% ( 0 <=>; 0 =>; 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 : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 46 (; 46 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ set_equal > element > f > #nlpp > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff(b,type,
b: $i ).
tff(set_equal,type,
set_equal: ( $i * $i ) > $o ).
tff(f,type,
f: ( $i * $i ) > $i ).
tff(f_62,axiom,
( ~ set_equal(b,a)
| ~ set_equal(a,b) ),
file(unknown,unknown) ).
tff(f_57,axiom,
( set_equal(a,b)
| set_equal(b,a) ),
file(unknown,unknown) ).
tff(f_46,axiom,
! [X,Y] :
( element(f(X,Y),X)
| element(f(X,Y),Y)
| set_equal(X,Y) ),
file(unknown,unknown) ).
tff(f_32,axiom,
! [X,Y,Z] :
( ~ set_equal(X,Y)
| ~ element(Z,X)
| element(Z,Y) ),
file(unknown,unknown) ).
tff(f_40,axiom,
! [X,Y,Z] :
( ~ set_equal(X,Y)
| ~ element(Z,Y)
| element(Z,X) ),
file(unknown,unknown) ).
tff(f_54,axiom,
! [X,Y] :
( ~ element(f(X,Y),Y)
| ~ element(f(X,Y),X)
| set_equal(X,Y) ),
file(unknown,unknown) ).
tff(c_12,plain,
( ~ set_equal(a,b)
| ~ set_equal(b,a) ),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_13,plain,
~ set_equal(b,a),
inference(splitLeft,[status(thm)],[c_12]) ).
tff(c_10,plain,
( set_equal(b,a)
| set_equal(a,b) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_14,plain,
set_equal(a,b),
inference(negUnitSimplification,[status(thm)],[c_13,c_10]) ).
tff(c_31,plain,
! [X_17,Y_18] :
( set_equal(X_17,Y_18)
| element(f(X_17,Y_18),Y_18)
| element(f(X_17,Y_18),X_17) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_2,plain,
! [Z_3,Y_2,X_1] :
( element(Z_3,Y_2)
| ~ element(Z_3,X_1)
| ~ set_equal(X_1,Y_2) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_40,plain,
! [X_17,Y_18,Y_2] :
( element(f(X_17,Y_18),Y_2)
| ~ set_equal(Y_18,Y_2)
| set_equal(X_17,Y_18)
| element(f(X_17,Y_18),X_17) ),
inference(resolution,[status(thm)],[c_31,c_2]) ).
tff(c_160,plain,
! [Y_32,Y_33] :
( ~ set_equal(Y_32,Y_33)
| set_equal(Y_33,Y_32)
| element(f(Y_33,Y_32),Y_33) ),
inference(factorization,[status(thm),theory(equality)],[c_40]) ).
tff(c_4,plain,
! [Z_6,X_4,Y_5] :
( element(Z_6,X_4)
| ~ element(Z_6,Y_5)
| ~ set_equal(X_4,Y_5) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_204,plain,
! [Y_36,Y_37,X_38] :
( element(f(Y_36,Y_37),X_38)
| ~ set_equal(X_38,Y_36)
| ~ set_equal(Y_37,Y_36)
| set_equal(Y_36,Y_37) ),
inference(resolution,[status(thm)],[c_160,c_4]) ).
tff(c_8,plain,
! [X_9,Y_10] :
( set_equal(X_9,Y_10)
| ~ element(f(X_9,Y_10),X_9)
| ~ element(f(X_9,Y_10),Y_10) ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_167,plain,
! [Y_33,Y_32] :
( ~ element(f(Y_33,Y_32),Y_32)
| ~ set_equal(Y_32,Y_33)
| set_equal(Y_33,Y_32) ),
inference(resolution,[status(thm)],[c_160,c_8]) ).
tff(c_222,plain,
! [X_39,Y_40] :
( ~ set_equal(X_39,Y_40)
| set_equal(Y_40,X_39) ),
inference(resolution,[status(thm)],[c_204,c_167]) ).
tff(c_226,plain,
set_equal(b,a),
inference(resolution,[status(thm)],[c_14,c_222]) ).
tff(c_232,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_13,c_226]) ).
tff(c_233,plain,
~ set_equal(a,b),
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_234,plain,
set_equal(b,a),
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_254,plain,
! [X_49,Y_50] :
( set_equal(X_49,Y_50)
| element(f(X_49,Y_50),Y_50)
| element(f(X_49,Y_50),X_49) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_266,plain,
! [X_49,Y_50,Y_2] :
( element(f(X_49,Y_50),Y_2)
| ~ set_equal(Y_50,Y_2)
| set_equal(X_49,Y_50)
| element(f(X_49,Y_50),X_49) ),
inference(resolution,[status(thm)],[c_254,c_2]) ).
tff(c_326,plain,
! [Y_57,Y_58] :
( ~ set_equal(Y_57,Y_58)
| set_equal(Y_58,Y_57)
| element(f(Y_58,Y_57),Y_58) ),
inference(factorization,[status(thm),theory(equality)],[c_266]) ).
tff(c_364,plain,
! [Y_61,Y_62,X_63] :
( element(f(Y_61,Y_62),X_63)
| ~ set_equal(X_63,Y_61)
| ~ set_equal(Y_62,Y_61)
| set_equal(Y_61,Y_62) ),
inference(resolution,[status(thm)],[c_326,c_4]) ).
tff(c_333,plain,
! [Y_58,Y_57] :
( ~ element(f(Y_58,Y_57),Y_57)
| ~ set_equal(Y_57,Y_58)
| set_equal(Y_58,Y_57) ),
inference(resolution,[status(thm)],[c_326,c_8]) ).
tff(c_382,plain,
! [X_64,Y_65] :
( ~ set_equal(X_64,Y_65)
| set_equal(Y_65,X_64) ),
inference(resolution,[status(thm)],[c_364,c_333]) ).
tff(c_386,plain,
set_equal(a,b),
inference(resolution,[status(thm)],[c_234,c_382]) ).
tff(c_392,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_233,c_386]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET047-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.12/0.35 % Computer : n015.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Thu Aug 3 16:34:14 EDT 2023
% 0.12/0.35 % CPUTime :
% 3.09/1.71 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.09/1.71
% 3.09/1.71 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.09/1.75
% 3.09/1.75 Inference rules
% 3.09/1.75 ----------------------
% 3.09/1.75 #Ref : 0
% 3.09/1.75 #Sup : 65
% 3.09/1.75 #Fact : 10
% 3.09/1.75 #Define : 0
% 3.09/1.75 #Split : 1
% 3.09/1.75 #Chain : 0
% 3.09/1.75 #Close : 0
% 3.09/1.75
% 3.09/1.75 Ordering : KBO
% 3.09/1.75
% 3.09/1.75 Simplification rules
% 3.09/1.75 ----------------------
% 3.09/1.75 #Subsume : 19
% 3.09/1.75 #Demod : 27
% 3.09/1.75 #Tautology : 24
% 3.09/1.75 #SimpNegUnit : 4
% 3.09/1.75 #BackRed : 0
% 3.09/1.75
% 3.09/1.75 #Partial instantiations: 0
% 3.09/1.75 #Strategies tried : 1
% 3.09/1.75
% 3.09/1.75 Timing (in seconds)
% 3.09/1.75 ----------------------
% 3.09/1.76 Preprocessing : 0.36
% 3.09/1.76 Parsing : 0.20
% 3.09/1.76 CNF conversion : 0.02
% 3.09/1.76 Main loop : 0.35
% 3.09/1.76 Inferencing : 0.15
% 3.09/1.76 Reduction : 0.07
% 3.09/1.76 Demodulation : 0.05
% 3.09/1.76 BG Simplification : 0.02
% 3.09/1.76 Subsumption : 0.09
% 3.09/1.76 Abstraction : 0.01
% 3.09/1.76 MUC search : 0.00
% 3.09/1.76 Cooper : 0.00
% 3.09/1.76 Total : 0.77
% 3.09/1.76 Index Insertion : 0.00
% 3.09/1.76 Index Deletion : 0.00
% 3.09/1.76 Index Matching : 0.00
% 3.09/1.76 BG Taut test : 0.00
%------------------------------------------------------------------------------