TSTP Solution File: SYN012-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN012-1 : TPTP v8.1.2. Released v1.1.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 : n009.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:08:31 EDT 2023
% Result : Unsatisfiable 2.78s 1.74s
% Output : CNFRefutation 3.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 30 ( 3 unt; 3 typ; 0 def)
% Number of atoms : 59 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 63 ( 31 ~; 32 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 5 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 : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 47 (; 47 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_g > big_f > g > #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(g,type,
g: ( $i * $i ) > $i ).
tff(big_g,type,
big_g: ( $i * $i ) > $o ).
tff(big_f,type,
big_f: ( $i * $i ) > $o ).
tff(f_60,axiom,
! [X,Y] :
( big_g(X,Y)
| big_g(g(X,Y),g(X,Y)) ),
file(unknown,unknown) ).
tff(f_56,axiom,
! [X,Y] :
( big_f(X,Y)
| ~ big_g(g(X,Y),g(X,Y)) ),
file(unknown,unknown) ).
tff(f_39,axiom,
! [X,Y] :
( ~ big_f(X,Y)
| big_f(X,g(X,Y))
| ~ big_g(Y,g(X,Y)) ),
file(unknown,unknown) ).
tff(f_31,axiom,
! [X,Y] :
( ~ big_f(X,Y)
| ~ big_f(X,g(X,Y))
| big_g(Y,g(X,Y)) ),
file(unknown,unknown) ).
tff(f_66,axiom,
! [X,Y] :
( ~ big_g(X,Y)
| ~ big_g(g(X,Y),g(X,Y)) ),
file(unknown,unknown) ).
tff(f_47,axiom,
! [X,Y] :
( ~ big_f(X,Y)
| ~ big_f(g(X,Y),g(X,Y))
| big_g(g(X,Y),g(X,Y)) ),
file(unknown,unknown) ).
tff(f_51,axiom,
! [X,Y] :
( big_f(X,Y)
| big_f(g(X,Y),g(X,Y)) ),
file(unknown,unknown) ).
tff(c_12,plain,
! [X_11,Y_12] :
( big_g(g(X_11,Y_12),g(X_11,Y_12))
| big_g(X_11,Y_12) ),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_22,plain,
! [X_21,Y_22] :
( ~ big_g(g(X_21,Y_22),g(X_21,Y_22))
| big_f(X_21,Y_22) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_26,plain,
! [X_11,Y_12] :
( big_f(X_11,Y_12)
| big_g(X_11,Y_12) ),
inference(resolution,[status(thm)],[c_12,c_22]) ).
tff(c_38,plain,
! [Y_29,X_30] :
( ~ big_g(Y_29,g(X_30,Y_29))
| big_f(X_30,g(X_30,Y_29))
| ~ big_f(X_30,Y_29) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_42,plain,
! [X_30,X_11] :
( big_f(X_30,g(X_30,X_11))
| ~ big_f(X_30,X_11)
| big_f(X_11,g(X_30,X_11)) ),
inference(resolution,[status(thm)],[c_26,c_38]) ).
tff(c_55,plain,
! [X_30] :
( ~ big_f(X_30,X_30)
| big_f(X_30,g(X_30,X_30)) ),
inference(factorization,[status(thm),theory(equality)],[c_42]) ).
tff(c_71,plain,
! [X_35] :
( ~ big_f(X_35,X_35)
| big_f(X_35,g(X_35,X_35)) ),
inference(factorization,[status(thm),theory(equality)],[c_42]) ).
tff(c_2,plain,
! [Y_2,X_1] :
( big_g(Y_2,g(X_1,Y_2))
| ~ big_f(X_1,g(X_1,Y_2))
| ~ big_f(X_1,Y_2) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_74,plain,
! [X_35] :
( big_g(X_35,g(X_35,X_35))
| ~ big_f(X_35,X_35) ),
inference(resolution,[status(thm)],[c_71,c_2]) ).
tff(c_27,plain,
! [X_23,Y_24] :
( big_f(X_23,Y_24)
| big_g(X_23,Y_24) ),
inference(resolution,[status(thm)],[c_12,c_22]) ).
tff(c_14,plain,
! [X_13,Y_14] :
( ~ big_g(g(X_13,Y_14),g(X_13,Y_14))
| ~ big_g(X_13,Y_14) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_35,plain,
! [X_13,Y_14] :
( ~ big_g(X_13,Y_14)
| big_f(g(X_13,Y_14),g(X_13,Y_14)) ),
inference(resolution,[status(thm)],[c_27,c_14]) ).
tff(c_62,plain,
! [X_33,Y_34] :
( big_g(g(X_33,Y_34),g(X_33,Y_34))
| ~ big_f(g(X_33,Y_34),g(X_33,Y_34))
| ~ big_f(X_33,Y_34) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_79,plain,
! [X_37,Y_38] :
( ~ big_g(X_37,Y_38)
| ~ big_f(g(X_37,Y_38),g(X_37,Y_38))
| ~ big_f(X_37,Y_38) ),
inference(resolution,[status(thm)],[c_62,c_14]) ).
tff(c_88,plain,
! [X_39,Y_40] :
( ~ big_f(X_39,Y_40)
| ~ big_g(X_39,Y_40) ),
inference(resolution,[status(thm)],[c_35,c_79]) ).
tff(c_114,plain,
! [X_43] :
( ~ big_f(X_43,g(X_43,X_43))
| ~ big_f(X_43,X_43) ),
inference(resolution,[status(thm)],[c_74,c_88]) ).
tff(c_122,plain,
! [X_30] : ~ big_f(X_30,X_30),
inference(resolution,[status(thm)],[c_55,c_114]) ).
tff(c_8,plain,
! [X_7,Y_8] :
( big_f(g(X_7,Y_8),g(X_7,Y_8))
| big_f(X_7,Y_8) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_124,plain,
! [X_7,Y_8] : big_f(X_7,Y_8),
inference(negUnitSimplification,[status(thm)],[c_122,c_8]) ).
tff(c_138,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_124,c_122]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN012-1 : TPTP v8.1.2. Released v1.1.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 : n009.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:19:23 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.78/1.74 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.78/1.75
% 2.78/1.75 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.02/1.78
% 3.02/1.78 Inference rules
% 3.02/1.78 ----------------------
% 3.02/1.78 #Ref : 0
% 3.02/1.78 #Sup : 19
% 3.02/1.78 #Fact : 2
% 3.02/1.78 #Define : 0
% 3.02/1.78 #Split : 0
% 3.02/1.78 #Chain : 0
% 3.02/1.78 #Close : 0
% 3.02/1.78
% 3.02/1.78 Ordering : KBO
% 3.02/1.78
% 3.02/1.78 Simplification rules
% 3.02/1.78 ----------------------
% 3.02/1.78 #Subsume : 11
% 3.02/1.78 #Demod : 11
% 3.02/1.78 #Tautology : 9
% 3.02/1.78 #SimpNegUnit : 2
% 3.02/1.78 #BackRed : 5
% 3.02/1.78
% 3.02/1.78 #Partial instantiations: 0
% 3.02/1.78 #Strategies tried : 1
% 3.02/1.78
% 3.02/1.78 Timing (in seconds)
% 3.02/1.78 ----------------------
% 3.02/1.79 Preprocessing : 0.42
% 3.02/1.79 Parsing : 0.24
% 3.02/1.79 CNF conversion : 0.02
% 3.02/1.79 Main loop : 0.25
% 3.02/1.79 Inferencing : 0.13
% 3.02/1.79 Reduction : 0.03
% 3.02/1.79 Demodulation : 0.02
% 3.02/1.79 BG Simplification : 0.02
% 3.02/1.79 Subsumption : 0.06
% 3.02/1.79 Abstraction : 0.01
% 3.02/1.79 MUC search : 0.00
% 3.02/1.79 Cooper : 0.00
% 3.02/1.79 Total : 0.73
% 3.02/1.79 Index Insertion : 0.00
% 3.02/1.79 Index Deletion : 0.00
% 3.02/1.79 Index Matching : 0.00
% 3.02/1.79 BG Taut test : 0.00
%------------------------------------------------------------------------------