TSTP Solution File: LCL203-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL203-3 : TPTP v8.1.2. Released v2.3.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 : n004.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:47:39 EDT 2023
% Result : Unsatisfiable 7.27s 2.78s
% Output : CNFRefutation 7.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 16
% Syntax : Number of formulae : 63 ( 27 unt; 7 typ; 0 def)
% Number of atoms : 92 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 77 ( 41 ~; 36 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 5 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 111 (; 111 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ theorem > axiom > or > implies > #nlpp > not > q > p
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(theorem,type,
theorem: $i > $o ).
tff(or,type,
or: ( $i * $i ) > $i ).
tff(not,type,
not: $i > $i ).
tff(q,type,
q: $i ).
tff(axiom,type,
axiom: $i > $o ).
tff(p,type,
p: $i ).
tff(implies,type,
implies: ( $i * $i ) > $i ).
tff(f_48,axiom,
! [A,B] : axiom(implies(A,or(B,A))),
file(unknown,unknown) ).
tff(f_56,axiom,
! [X,Y] : ( implies(X,Y) = or(not(X),Y) ),
file(unknown,unknown) ).
tff(f_61,axiom,
! [X] :
( theorem(X)
| ~ axiom(X) ),
file(unknown,unknown) ).
tff(f_52,axiom,
! [A,B,C] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
file(unknown,unknown) ).
tff(f_69,axiom,
! [X,Y] :
( theorem(X)
| ~ theorem(implies(Y,X))
| ~ theorem(Y) ),
file(unknown,unknown) ).
tff(f_50,axiom,
! [A,B] : axiom(implies(or(A,B),or(B,A))),
file(unknown,unknown) ).
tff(f_46,axiom,
! [A] : axiom(implies(or(A,A),A)),
file(unknown,unknown) ).
tff(f_54,axiom,
! [A,B,C] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
file(unknown,unknown) ).
tff(f_77,axiom,
~ theorem(implies(not(or(p,q)),or(not(p),not(q)))),
file(unknown,unknown) ).
tff(c_4,plain,
! [A_2,B_3] : axiom(implies(A_2,or(B_3,A_2))),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_12,plain,
! [X_12,Y_13] : ( or(not(X_12),Y_13) = implies(X_12,Y_13) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_14,plain,
! [X_14] :
( ~ axiom(X_14)
| theorem(X_14) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_135,plain,
! [A_41,B_42,C_43] : axiom(implies(or(A_41,or(B_42,C_43)),or(B_42,or(A_41,C_43)))),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_145,plain,
! [X_12,B_42,C_43] : axiom(implies(implies(X_12,or(B_42,C_43)),or(B_42,or(not(X_12),C_43)))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_135]) ).
tff(c_359,plain,
! [X_78,B_79,C_80] : axiom(implies(implies(X_78,or(B_79,C_80)),or(B_79,implies(X_78,C_80)))),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_145]) ).
tff(c_47,plain,
! [Y_27,X_28] :
( ~ theorem(Y_27)
| ~ theorem(implies(Y_27,X_28))
| theorem(X_28) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_51,plain,
! [Y_27,X_28] :
( ~ theorem(Y_27)
| theorem(X_28)
| ~ axiom(implies(Y_27,X_28)) ),
inference(resolution,[status(thm)],[c_14,c_47]) ).
tff(c_557,plain,
! [X_110,B_111,C_112] :
( ~ theorem(implies(X_110,or(B_111,C_112)))
| theorem(or(B_111,implies(X_110,C_112))) ),
inference(resolution,[status(thm)],[c_359,c_51]) ).
tff(c_6,plain,
! [A_4,B_5] : axiom(implies(or(A_4,B_5),or(B_5,A_4))),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_53,plain,
! [Y_30,X_31] :
( ~ theorem(Y_30)
| theorem(X_31)
| ~ axiom(implies(Y_30,X_31)) ),
inference(resolution,[status(thm)],[c_14,c_47]) ).
tff(c_70,plain,
! [A_4,B_5] :
( ~ theorem(or(A_4,B_5))
| theorem(or(B_5,A_4)) ),
inference(resolution,[status(thm)],[c_6,c_53]) ).
tff(c_1758,plain,
! [X_227,C_228,B_229] :
( theorem(or(implies(X_227,C_228),B_229))
| ~ theorem(implies(X_227,or(B_229,C_228))) ),
inference(resolution,[status(thm)],[c_557,c_70]) ).
tff(c_73,plain,
! [A_2,B_3] :
( ~ theorem(A_2)
| theorem(or(B_3,A_2)) ),
inference(resolution,[status(thm)],[c_4,c_53]) ).
tff(c_776,plain,
! [A_131,B_132,C_133] :
( ~ theorem(or(A_131,or(B_132,C_133)))
| theorem(or(B_132,or(A_131,C_133))) ),
inference(resolution,[status(thm)],[c_135,c_51]) ).
tff(c_1063,plain,
! [B_164,B_165,C_166] :
( theorem(or(B_164,or(B_165,C_166)))
| ~ theorem(or(B_164,C_166)) ),
inference(resolution,[status(thm)],[c_73,c_776]) ).
tff(c_2,plain,
! [A_1] : axiom(implies(or(A_1,A_1),A_1)),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_72,plain,
! [A_1] :
( ~ theorem(or(A_1,A_1))
| theorem(A_1) ),
inference(resolution,[status(thm)],[c_2,c_53]) ).
tff(c_1163,plain,
! [B_176,C_177] :
( theorem(or(B_176,C_177))
| ~ theorem(or(or(B_176,C_177),C_177)) ),
inference(resolution,[status(thm)],[c_1063,c_72]) ).
tff(c_1222,plain,
! [X_12,Y_13] :
( theorem(or(not(X_12),Y_13))
| ~ theorem(or(implies(X_12,Y_13),Y_13)) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_1163]) ).
tff(c_1240,plain,
! [X_12,Y_13] :
( theorem(implies(X_12,Y_13))
| ~ theorem(or(implies(X_12,Y_13),Y_13)) ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_1222]) ).
tff(c_1800,plain,
! [X_230,B_231] :
( theorem(implies(X_230,B_231))
| ~ theorem(implies(X_230,or(B_231,B_231))) ),
inference(resolution,[status(thm)],[c_1758,c_1240]) ).
tff(c_1873,plain,
! [X_234,B_235] :
( theorem(implies(X_234,B_235))
| ~ axiom(implies(X_234,or(B_235,B_235))) ),
inference(resolution,[status(thm)],[c_14,c_1800]) ).
tff(c_1908,plain,
! [A_236] : theorem(implies(A_236,A_236)),
inference(resolution,[status(thm)],[c_4,c_1873]) ).
tff(c_40,plain,
! [A_25,B_26] : axiom(implies(or(A_25,B_26),or(B_26,A_25))),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_233,plain,
! [Y_56,X_57] : axiom(implies(or(Y_56,not(X_57)),implies(X_57,Y_56))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_40]) ).
tff(c_302,plain,
! [X_66,X_67] : axiom(implies(implies(X_66,not(X_67)),implies(X_67,not(X_66)))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_233]) ).
tff(c_306,plain,
! [X_66,X_67] :
( ~ theorem(implies(X_66,not(X_67)))
| theorem(implies(X_67,not(X_66))) ),
inference(resolution,[status(thm)],[c_302,c_51]) ).
tff(c_1926,plain,
! [X_67] : theorem(implies(X_67,not(not(X_67)))),
inference(resolution,[status(thm)],[c_1908,c_306]) ).
tff(c_74,plain,
! [A_32,B_33,C_34] : axiom(implies(implies(A_32,B_33),implies(or(C_34,A_32),or(C_34,B_33)))),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_394,plain,
! [A_83,B_84,C_85] :
( ~ theorem(implies(A_83,B_84))
| theorem(implies(or(C_85,A_83),or(C_85,B_84))) ),
inference(resolution,[status(thm)],[c_74,c_51]) ).
tff(c_16,plain,
! [Y_16,X_15] :
( ~ theorem(Y_16)
| ~ theorem(implies(Y_16,X_15))
| theorem(X_15) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_3832,plain,
! [C_356,A_357,B_358] :
( ~ theorem(or(C_356,A_357))
| theorem(or(C_356,B_358))
| ~ theorem(implies(A_357,B_358)) ),
inference(resolution,[status(thm)],[c_394,c_16]) ).
tff(c_5996,plain,
! [C_443,B_444,A_445] :
( theorem(or(C_443,B_444))
| ~ theorem(implies(A_445,B_444))
| ~ axiom(or(C_443,A_445)) ),
inference(resolution,[status(thm)],[c_14,c_3832]) ).
tff(c_6118,plain,
! [C_446,X_447] :
( theorem(or(C_446,not(not(X_447))))
| ~ axiom(or(C_446,X_447)) ),
inference(resolution,[status(thm)],[c_1926,c_5996]) ).
tff(c_241,plain,
! [Y_56,X_57] :
( ~ theorem(or(Y_56,not(X_57)))
| theorem(implies(X_57,Y_56)) ),
inference(resolution,[status(thm)],[c_233,c_51]) ).
tff(c_6176,plain,
! [X_448,C_449] :
( theorem(implies(not(X_448),C_449))
| ~ axiom(or(C_449,X_448)) ),
inference(resolution,[status(thm)],[c_6118,c_241]) ).
tff(c_141,plain,
! [A_41,X_12,Y_13] : axiom(implies(or(A_41,implies(X_12,Y_13)),or(not(X_12),or(A_41,Y_13)))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_135]) ).
tff(c_407,plain,
! [A_86,X_87,Y_88] : axiom(implies(or(A_86,implies(X_87,Y_88)),implies(X_87,or(A_86,Y_88)))),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_141]) ).
tff(c_424,plain,
! [A_89,X_90,Y_91] :
( ~ theorem(or(A_89,implies(X_90,Y_91)))
| theorem(implies(X_90,or(A_89,Y_91))) ),
inference(resolution,[status(thm)],[c_407,c_51]) ).
tff(c_466,plain,
! [X_98,B_99,Y_100] :
( theorem(implies(X_98,or(B_99,Y_100)))
| ~ theorem(implies(X_98,Y_100)) ),
inference(resolution,[status(thm)],[c_73,c_424]) ).
tff(c_500,plain,
! [X_104,X_105,Y_106] :
( theorem(implies(X_104,implies(X_105,Y_106)))
| ~ theorem(implies(X_104,Y_106)) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_466]) ).
tff(c_18,plain,
~ theorem(implies(not(or(p,q)),or(not(p),not(q)))),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_19,plain,
~ theorem(implies(not(or(p,q)),implies(p,not(q)))),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_18]) ).
tff(c_510,plain,
~ theorem(implies(not(or(p,q)),not(q))),
inference(resolution,[status(thm)],[c_500,c_19]) ).
tff(c_6221,plain,
~ axiom(or(not(q),or(p,q))),
inference(resolution,[status(thm)],[c_6176,c_510]) ).
tff(c_6259,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_12,c_6221]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL203-3 : TPTP v8.1.2. Released v2.3.0.
% 0.13/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.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 13:56:11 EDT 2023
% 0.13/0.34 % CPUTime :
% 7.27/2.78 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.27/2.79
% 7.27/2.79 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.27/2.83
% 7.27/2.83 Inference rules
% 7.27/2.83 ----------------------
% 7.27/2.83 #Ref : 0
% 7.27/2.83 #Sup : 1492
% 7.27/2.83 #Fact : 0
% 7.27/2.83 #Define : 0
% 7.27/2.83 #Split : 3
% 7.27/2.83 #Chain : 0
% 7.27/2.83 #Close : 0
% 7.27/2.83
% 7.27/2.83 Ordering : KBO
% 7.27/2.83
% 7.27/2.83 Simplification rules
% 7.27/2.83 ----------------------
% 7.27/2.83 #Subsume : 715
% 7.27/2.83 #Demod : 103
% 7.27/2.83 #Tautology : 67
% 7.27/2.83 #SimpNegUnit : 42
% 7.27/2.83 #BackRed : 19
% 7.27/2.83
% 7.27/2.83 #Partial instantiations: 0
% 7.27/2.83 #Strategies tried : 1
% 7.27/2.83
% 7.27/2.83 Timing (in seconds)
% 7.27/2.83 ----------------------
% 7.27/2.83 Preprocessing : 0.42
% 7.27/2.83 Parsing : 0.23
% 7.27/2.83 CNF conversion : 0.02
% 7.27/2.83 Main loop : 1.35
% 7.27/2.83 Inferencing : 0.52
% 7.27/2.83 Reduction : 0.34
% 7.27/2.83 Demodulation : 0.22
% 7.27/2.83 BG Simplification : 0.03
% 7.27/2.83 Subsumption : 0.36
% 7.27/2.83 Abstraction : 0.04
% 7.27/2.83 MUC search : 0.00
% 7.27/2.83 Cooper : 0.00
% 7.27/2.83 Total : 1.83
% 7.27/2.83 Index Insertion : 0.00
% 7.27/2.83 Index Deletion : 0.00
% 7.27/2.83 Index Matching : 0.00
% 7.27/2.83 BG Taut test : 0.00
%------------------------------------------------------------------------------