TSTP Solution File: SYN038-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN038-1 : 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/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 : 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:09:04 EDT 2023
% Result : Unsatisfiable 2.70s 1.67s
% Output : CNFRefutation 2.97s
% 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 :
%------------------------------------------------------------------------------
%$ q > p > f > #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(q,type,
q: ( $i * $i ) > $o ).
tff(p,type,
p: ( $i * $i ) > $o ).
tff(f,type,
f: ( $i * $i ) > $i ).
tff(f_65,axiom,
! [X,Y] :
( q(X,Y)
| q(f(X,Y),f(X,Y)) ),
file(unknown,unknown) ).
tff(f_61,axiom,
! [X,Y] :
( p(X,Y)
| ~ q(f(X,Y),f(X,Y)) ),
file(unknown,unknown) ).
tff(f_44,axiom,
! [X,Y] :
( ~ p(X,Y)
| ~ q(Y,f(X,Y))
| p(X,f(X,Y)) ),
file(unknown,unknown) ).
tff(f_36,axiom,
! [X,Y] :
( ~ p(X,f(X,Y))
| ~ p(X,Y)
| q(Y,f(X,Y)) ),
file(unknown,unknown) ).
tff(f_71,axiom,
! [X,Y] :
( ~ q(X,Y)
| ~ q(f(X,Y),f(X,Y)) ),
file(unknown,unknown) ).
tff(f_52,axiom,
! [X,Y] :
( ~ p(X,Y)
| ~ p(f(X,Y),f(X,Y))
| q(f(X,Y),f(X,Y)) ),
file(unknown,unknown) ).
tff(f_56,axiom,
! [X,Y] :
( p(X,Y)
| p(f(X,Y),f(X,Y)) ),
file(unknown,unknown) ).
tff(c_12,plain,
! [X_11,Y_12] :
( q(f(X_11,Y_12),f(X_11,Y_12))
| q(X_11,Y_12) ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_22,plain,
! [X_21,Y_22] :
( ~ q(f(X_21,Y_22),f(X_21,Y_22))
| p(X_21,Y_22) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_26,plain,
! [X_11,Y_12] :
( p(X_11,Y_12)
| q(X_11,Y_12) ),
inference(resolution,[status(thm)],[c_12,c_22]) ).
tff(c_38,plain,
! [X_29,Y_30] :
( p(X_29,f(X_29,Y_30))
| ~ q(Y_30,f(X_29,Y_30))
| ~ p(X_29,Y_30) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_42,plain,
! [X_29,X_11] :
( p(X_29,f(X_29,X_11))
| ~ p(X_29,X_11)
| p(X_11,f(X_29,X_11)) ),
inference(resolution,[status(thm)],[c_26,c_38]) ).
tff(c_55,plain,
! [X_29] :
( ~ p(X_29,X_29)
| p(X_29,f(X_29,X_29)) ),
inference(factorization,[status(thm),theory(equality)],[c_42]) ).
tff(c_71,plain,
! [X_35] :
( ~ p(X_35,X_35)
| p(X_35,f(X_35,X_35)) ),
inference(factorization,[status(thm),theory(equality)],[c_42]) ).
tff(c_2,plain,
! [Y_2,X_1] :
( q(Y_2,f(X_1,Y_2))
| ~ p(X_1,Y_2)
| ~ p(X_1,f(X_1,Y_2)) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_74,plain,
! [X_35] :
( q(X_35,f(X_35,X_35))
| ~ p(X_35,X_35) ),
inference(resolution,[status(thm)],[c_71,c_2]) ).
tff(c_27,plain,
! [X_23,Y_24] :
( p(X_23,Y_24)
| q(X_23,Y_24) ),
inference(resolution,[status(thm)],[c_12,c_22]) ).
tff(c_14,plain,
! [X_13,Y_14] :
( ~ q(f(X_13,Y_14),f(X_13,Y_14))
| ~ q(X_13,Y_14) ),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_35,plain,
! [X_13,Y_14] :
( ~ q(X_13,Y_14)
| p(f(X_13,Y_14),f(X_13,Y_14)) ),
inference(resolution,[status(thm)],[c_27,c_14]) ).
tff(c_62,plain,
! [X_33,Y_34] :
( q(f(X_33,Y_34),f(X_33,Y_34))
| ~ p(f(X_33,Y_34),f(X_33,Y_34))
| ~ p(X_33,Y_34) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_79,plain,
! [X_37,Y_38] :
( ~ q(X_37,Y_38)
| ~ p(f(X_37,Y_38),f(X_37,Y_38))
| ~ p(X_37,Y_38) ),
inference(resolution,[status(thm)],[c_62,c_14]) ).
tff(c_88,plain,
! [X_39,Y_40] :
( ~ p(X_39,Y_40)
| ~ q(X_39,Y_40) ),
inference(resolution,[status(thm)],[c_35,c_79]) ).
tff(c_114,plain,
! [X_43] :
( ~ p(X_43,f(X_43,X_43))
| ~ p(X_43,X_43) ),
inference(resolution,[status(thm)],[c_74,c_88]) ).
tff(c_122,plain,
! [X_29] : ~ p(X_29,X_29),
inference(resolution,[status(thm)],[c_55,c_114]) ).
tff(c_8,plain,
! [X_7,Y_8] :
( p(f(X_7,Y_8),f(X_7,Y_8))
| p(X_7,Y_8) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_124,plain,
! [X_7,Y_8] : p(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.12 % Problem : SYN038-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % 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.13/0.33 % Computer : n009.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Thu Aug 3 17:11:38 EDT 2023
% 0.13/0.33 % CPUTime :
% 2.70/1.67 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.70/1.67
% 2.70/1.67 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.97/1.70
% 2.97/1.70 Inference rules
% 2.97/1.70 ----------------------
% 2.97/1.70 #Ref : 0
% 2.97/1.70 #Sup : 19
% 2.97/1.70 #Fact : 2
% 2.97/1.70 #Define : 0
% 2.97/1.70 #Split : 0
% 2.97/1.70 #Chain : 0
% 2.97/1.70 #Close : 0
% 2.97/1.70
% 2.97/1.70 Ordering : KBO
% 2.97/1.70
% 2.97/1.70 Simplification rules
% 2.97/1.70 ----------------------
% 2.97/1.70 #Subsume : 11
% 2.97/1.70 #Demod : 11
% 2.97/1.70 #Tautology : 9
% 2.97/1.70 #SimpNegUnit : 2
% 2.97/1.70 #BackRed : 5
% 2.97/1.70
% 2.97/1.70 #Partial instantiations: 0
% 2.97/1.70 #Strategies tried : 1
% 2.97/1.70
% 2.97/1.70 Timing (in seconds)
% 2.97/1.70 ----------------------
% 2.97/1.71 Preprocessing : 0.41
% 2.97/1.71 Parsing : 0.23
% 2.97/1.71 CNF conversion : 0.02
% 2.97/1.71 Main loop : 0.25
% 2.97/1.71 Inferencing : 0.13
% 2.97/1.71 Reduction : 0.03
% 2.97/1.71 Demodulation : 0.02
% 2.97/1.71 BG Simplification : 0.02
% 2.97/1.71 Subsumption : 0.06
% 2.97/1.71 Abstraction : 0.01
% 2.97/1.71 MUC search : 0.00
% 2.97/1.71 Cooper : 0.00
% 2.97/1.71 Total : 0.71
% 2.97/1.71 Index Insertion : 0.00
% 2.97/1.71 Index Deletion : 0.00
% 2.97/1.71 Index Matching : 0.00
% 2.97/1.71 BG Taut test : 0.00
%------------------------------------------------------------------------------