TSTP Solution File: ALG011-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ALG011-1 : TPTP v8.1.2. Released v2.7.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 : n007.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:30:49 EDT 2023
% Result : Unsatisfiable 3.17s 1.77s
% Output : CNFRefutation 3.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 38 ( 14 unt; 5 typ; 0 def)
% Number of atoms : 70 ( 2 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 86 ( 49 ~; 37 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 49 (; 49 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ d > c > f > #nlpp > a2 > a1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a1,type,
a1: $i ).
tff(d,type,
d: $i > $o ).
tff(a2,type,
a2: $i ).
tff(c,type,
c: $i > $o ).
tff(f,type,
f: ( $i * $i ) > $i ).
tff(f_44,axiom,
! [X,Y] :
( d(f(X,Y))
| ~ c(X)
| ~ c(Y) ),
file(unknown,unknown) ).
tff(f_28,axiom,
! [X] :
( c(X)
| d(X) ),
file(unknown,unknown) ).
tff(f_52,axiom,
! [X,Y] :
( c(f(X,Y))
| ~ d(X)
| ~ d(Y) ),
file(unknown,unknown) ).
tff(f_24,axiom,
! [X,Y,Z] : ( f(X,f(Y,Z)) = f(f(X,Y),Z) ),
file(unknown,unknown) ).
tff(f_34,axiom,
! [X] :
( ~ c(X)
| ~ d(X) ),
file(unknown,unknown) ).
tff(f_36,axiom,
d(a2),
file(unknown,unknown) ).
tff(f_35,axiom,
c(a1),
file(unknown,unknown) ).
tff(c_12,plain,
! [Y_7,X_6] :
( ~ c(Y_7)
| ~ c(X_6)
| d(f(X_6,Y_7)) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_4,plain,
! [X_4] :
( d(X_4)
| c(X_4) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_14,plain,
! [Y_9,X_8] :
( ~ d(Y_9)
| ~ d(X_8)
| c(f(X_8,Y_9)) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_36,plain,
! [X_18,Y_19,Z_20] : ( f(f(X_18,Y_19),Z_20) = f(X_18,f(Y_19,Z_20)) ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_62,plain,
! [Z_21,X_22,Y_23] :
( ~ d(Z_21)
| ~ d(f(X_22,Y_23))
| c(f(X_22,f(Y_23,Z_21))) ),
inference(superposition,[status(thm),theory(equality)],[c_36,c_14]) ).
tff(c_25,plain,
! [Y_12,X_13] :
( ~ c(Y_12)
| ~ c(X_13)
| d(f(X_13,Y_12)) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_6,plain,
! [X_5] :
( ~ d(X_5)
| ~ c(X_5) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_29,plain,
! [X_13,Y_12] :
( ~ c(f(X_13,Y_12))
| ~ c(Y_12)
| ~ c(X_13) ),
inference(resolution,[status(thm)],[c_25,c_6]) ).
tff(c_106,plain,
! [Y_30,Z_31,X_32] :
( ~ c(f(Y_30,Z_31))
| ~ c(X_32)
| ~ d(Z_31)
| ~ d(f(X_32,Y_30)) ),
inference(resolution,[status(thm)],[c_62,c_29]) ).
tff(c_114,plain,
! [X_32,X_8,Y_9] :
( ~ c(X_32)
| ~ d(f(X_32,X_8))
| ~ d(Y_9)
| ~ d(X_8) ),
inference(resolution,[status(thm)],[c_14,c_106]) ).
tff(c_134,plain,
! [X_37,X_38] :
( ~ c(X_37)
| ~ d(f(X_37,X_38))
| ~ d(X_38) ),
inference(splitLeft,[status(thm)],[c_114]) ).
tff(c_154,plain,
! [X_39,X_40] :
( ~ c(X_39)
| ~ d(X_40)
| c(f(X_39,X_40)) ),
inference(resolution,[status(thm)],[c_4,c_134]) ).
tff(c_73,plain,
! [Y_23,Z_21,X_22] :
( ~ c(f(Y_23,Z_21))
| ~ c(X_22)
| ~ d(Z_21)
| ~ d(f(X_22,Y_23)) ),
inference(resolution,[status(thm)],[c_62,c_29]) ).
tff(c_167,plain,
! [X_22,X_39,X_40] :
( ~ c(X_22)
| ~ d(f(X_22,X_39))
| ~ c(X_39)
| ~ d(X_40) ),
inference(resolution,[status(thm)],[c_154,c_73]) ).
tff(c_170,plain,
! [X_40] : ~ d(X_40),
inference(splitLeft,[status(thm)],[c_167]) ).
tff(c_10,plain,
d(a2),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_189,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_170,c_10]) ).
tff(c_191,plain,
! [X_44,X_45] :
( ~ c(X_44)
| ~ d(f(X_44,X_45))
| ~ c(X_45) ),
inference(splitRight,[status(thm)],[c_167]) ).
tff(c_209,plain,
! [Y_7,X_6] :
( ~ c(Y_7)
| ~ c(X_6) ),
inference(resolution,[status(thm)],[c_12,c_191]) ).
tff(c_211,plain,
! [X_6] : ~ c(X_6),
inference(splitLeft,[status(thm)],[c_209]) ).
tff(c_8,plain,
c(a1),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_217,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_211,c_8]) ).
tff(c_218,plain,
! [Y_7] : ~ c(Y_7),
inference(splitRight,[status(thm)],[c_209]) ).
tff(c_224,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_218,c_8]) ).
tff(c_225,plain,
! [Y_9] : ~ d(Y_9),
inference(splitRight,[status(thm)],[c_114]) ).
tff(c_249,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_225,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : ALG011-1 : TPTP v8.1.2. Released v2.7.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 : n007.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 20:03:39 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.17/1.77 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.17/1.77
% 3.17/1.77 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.24/1.81
% 3.24/1.81 Inference rules
% 3.24/1.81 ----------------------
% 3.24/1.81 #Ref : 0
% 3.24/1.81 #Sup : 50
% 3.24/1.81 #Fact : 0
% 3.24/1.81 #Define : 0
% 3.24/1.81 #Split : 3
% 3.24/1.81 #Chain : 0
% 3.24/1.81 #Close : 0
% 3.24/1.81
% 3.24/1.81 Ordering : KBO
% 3.24/1.81
% 3.24/1.81 Simplification rules
% 3.24/1.81 ----------------------
% 3.24/1.81 #Subsume : 39
% 3.24/1.81 #Demod : 14
% 3.24/1.81 #Tautology : 5
% 3.24/1.81 #SimpNegUnit : 20
% 3.24/1.81 #BackRed : 18
% 3.24/1.81
% 3.24/1.81 #Partial instantiations: 0
% 3.24/1.81 #Strategies tried : 1
% 3.24/1.81
% 3.24/1.81 Timing (in seconds)
% 3.24/1.81 ----------------------
% 3.24/1.81 Preprocessing : 0.39
% 3.24/1.81 Parsing : 0.22
% 3.24/1.81 CNF conversion : 0.02
% 3.24/1.81 Main loop : 0.35
% 3.24/1.81 Inferencing : 0.15
% 3.24/1.81 Reduction : 0.08
% 3.24/1.81 Demodulation : 0.06
% 3.24/1.81 BG Simplification : 0.01
% 3.24/1.81 Subsumption : 0.09
% 3.24/1.81 Abstraction : 0.01
% 3.24/1.81 MUC search : 0.00
% 3.24/1.81 Cooper : 0.00
% 3.24/1.81 Total : 0.79
% 3.24/1.81 Index Insertion : 0.00
% 3.24/1.82 Index Deletion : 0.00
% 3.24/1.82 Index Matching : 0.00
% 3.24/1.82 BG Taut test : 0.00
%------------------------------------------------------------------------------