TSTP Solution File: LCL237-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL237-1 : TPTP v8.1.2. Bugfixed 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 : n031.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:45 EDT 2023
% Result : Unsatisfiable 18.77s 10.01s
% Output : CNFRefutation 18.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 15
% Syntax : Number of formulae : 58 ( 27 unt; 6 typ; 0 def)
% Number of atoms : 86 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 70 ( 36 ~; 34 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 4 >; 1 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 122 (; 122 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ theorem > axiom > or > #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(f_58,axiom,
! [A,B] : axiom(or(not(or(A,B)),or(B,A))),
file(unknown,unknown) ).
tff(f_56,axiom,
! [A,B] : axiom(or(not(A),or(B,A))),
file(unknown,unknown) ).
tff(f_67,axiom,
! [X] :
( theorem(X)
| ~ axiom(X) ),
file(unknown,unknown) ).
tff(f_83,axiom,
! [X,Z,Y] :
( theorem(or(not(X),Z))
| ~ axiom(or(not(X),Y))
| ~ theorem(or(not(Y),Z)) ),
file(unknown,unknown) ).
tff(f_60,axiom,
! [A,B,C] : axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
file(unknown,unknown) ).
tff(f_75,axiom,
! [X,Y] :
( theorem(X)
| ~ axiom(or(not(Y),X))
| ~ theorem(Y) ),
file(unknown,unknown) ).
tff(f_54,axiom,
! [A] : axiom(or(not(or(A,A)),A)),
file(unknown,unknown) ).
tff(f_62,axiom,
! [A,B,C] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
file(unknown,unknown) ).
tff(f_87,axiom,
~ theorem(or(not(q),or(not(p),not(or(not(p),not(q)))))),
file(unknown,unknown) ).
tff(c_6,plain,
! [A_4,B_5] : axiom(or(not(or(A_4,B_5)),or(B_5,A_4))),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_4,plain,
! [A_2,B_3] : axiom(or(not(A_2),or(B_3,A_2))),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_12,plain,
! [X_12] :
( ~ axiom(X_12)
| theorem(X_12) ),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_161,plain,
! [Y_48,Z_49,X_50] :
( ~ theorem(or(not(Y_48),Z_49))
| ~ axiom(or(not(X_50),Y_48))
| theorem(or(not(X_50),Z_49)) ),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_565,plain,
! [X_102,Y_103,Z_104] :
( ~ axiom(or(not(X_102),Y_103))
| theorem(or(not(X_102),Z_104))
| ~ axiom(or(not(Y_103),Z_104)) ),
inference(resolution,[status(thm)],[c_12,c_161]) ).
tff(c_601,plain,
! [A_107,Z_108,B_109] :
( theorem(or(not(A_107),Z_108))
| ~ axiom(or(not(or(B_109,A_107)),Z_108)) ),
inference(resolution,[status(thm)],[c_4,c_565]) ).
tff(c_624,plain,
! [B_110,A_111] : theorem(or(not(B_110),or(B_110,A_111))),
inference(resolution,[status(thm)],[c_6,c_601]) ).
tff(c_110,plain,
! [A_36,B_37,C_38] : axiom(or(not(or(A_36,or(B_37,C_38))),or(B_37,or(A_36,C_38)))),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_14,plain,
! [Y_14,X_13] :
( ~ theorem(Y_14)
| ~ axiom(or(not(Y_14),X_13))
| theorem(X_13) ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_114,plain,
! [A_36,B_37,C_38] :
( ~ theorem(or(A_36,or(B_37,C_38)))
| theorem(or(B_37,or(A_36,C_38))) ),
inference(resolution,[status(thm)],[c_110,c_14]) ).
tff(c_644,plain,
! [B_115,A_116] : theorem(or(B_115,or(not(B_115),A_116))),
inference(resolution,[status(thm)],[c_624,c_114]) ).
tff(c_36,plain,
! [A_25,B_26] : axiom(or(not(or(A_25,B_26)),or(B_26,A_25))),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_40,plain,
! [A_25,B_26] :
( ~ theorem(or(A_25,B_26))
| theorem(or(B_26,A_25)) ),
inference(resolution,[status(thm)],[c_36,c_14]) ).
tff(c_667,plain,
! [B_119,A_120] : theorem(or(or(not(B_119),A_120),B_119)),
inference(resolution,[status(thm)],[c_644,c_40]) ).
tff(c_970,plain,
! [B_166,C_167,A_168] : theorem(or(B_166,or(or(not(or(B_166,C_167)),A_168),C_167))),
inference(resolution,[status(thm)],[c_667,c_114]) ).
tff(c_1018,plain,
! [B_175,C_176,A_177] : theorem(or(or(or(not(or(B_175,C_176)),A_177),C_176),B_175)),
inference(resolution,[status(thm)],[c_970,c_40]) ).
tff(c_22,plain,
! [Y_22,X_23] :
( ~ theorem(Y_22)
| ~ axiom(or(not(Y_22),X_23))
| theorem(X_23) ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_30,plain,
! [A_2,B_3] :
( ~ theorem(A_2)
| theorem(or(B_3,A_2)) ),
inference(resolution,[status(thm)],[c_4,c_22]) ).
tff(c_128,plain,
! [A_42,B_43,C_44] :
( ~ theorem(or(A_42,or(B_43,C_44)))
| theorem(or(B_43,or(A_42,C_44))) ),
inference(resolution,[status(thm)],[c_110,c_14]) ).
tff(c_195,plain,
! [B_54,B_55,C_56] :
( theorem(or(B_54,or(B_55,C_56)))
| ~ theorem(or(B_54,C_56)) ),
inference(resolution,[status(thm)],[c_30,c_128]) ).
tff(c_2,plain,
! [A_1] : axiom(or(not(or(A_1,A_1)),A_1)),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_29,plain,
! [A_1] :
( ~ theorem(or(A_1,A_1))
| theorem(A_1) ),
inference(resolution,[status(thm)],[c_2,c_22]) ).
tff(c_214,plain,
! [B_55,C_56] :
( theorem(or(B_55,C_56))
| ~ theorem(or(or(B_55,C_56),C_56)) ),
inference(resolution,[status(thm)],[c_195,c_29]) ).
tff(c_1032,plain,
! [B_178,A_179] : theorem(or(or(not(or(B_178,B_178)),A_179),B_178)),
inference(resolution,[status(thm)],[c_1018,c_214]) ).
tff(c_1057,plain,
! [B_183,A_184] : theorem(or(B_183,or(not(or(B_183,B_183)),A_184))),
inference(resolution,[status(thm)],[c_1032,c_40]) ).
tff(c_1066,plain,
! [B_183,A_184] : theorem(or(not(or(B_183,B_183)),or(B_183,A_184))),
inference(resolution,[status(thm)],[c_1057,c_114]) ).
tff(c_8,plain,
! [A_6,B_7,C_8] : axiom(or(not(or(A_6,or(B_7,C_8))),or(B_7,or(A_6,C_8)))),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_123,plain,
! [A_39,B_40,C_41] : axiom(or(not(or(not(A_39),B_40)),or(not(or(C_41,A_39)),or(C_41,B_40)))),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_447,plain,
! [A_87,B_88,C_89] :
( ~ theorem(or(not(A_87),B_88))
| theorem(or(not(or(C_89,A_87)),or(C_89,B_88))) ),
inference(resolution,[status(thm)],[c_123,c_14]) ).
tff(c_16,plain,
! [Y_17,Z_16,X_15] :
( ~ theorem(or(not(Y_17),Z_16))
| ~ axiom(or(not(X_15),Y_17))
| theorem(or(not(X_15),Z_16)) ),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_1299,plain,
! [X_226,C_227,A_228,B_229] :
( ~ axiom(or(not(X_226),or(C_227,A_228)))
| theorem(or(not(X_226),or(C_227,B_229)))
| ~ theorem(or(not(A_228),B_229)) ),
inference(resolution,[status(thm)],[c_447,c_16]) ).
tff(c_5783,plain,
! [A_708,B_709,C_710,B_711] :
( theorem(or(not(or(A_708,or(B_709,C_710))),or(B_709,B_711)))
| ~ theorem(or(not(or(A_708,C_710)),B_711)) ),
inference(resolution,[status(thm)],[c_8,c_1299]) ).
tff(c_24537,plain,
! [B_2576,A_2573,X_2577,B_2574,C_2575] :
( ~ axiom(or(not(X_2577),or(A_2573,or(B_2574,C_2575))))
| theorem(or(not(X_2577),or(B_2574,B_2576)))
| ~ theorem(or(not(or(A_2573,C_2575)),B_2576)) ),
inference(resolution,[status(thm)],[c_5783,c_16]) ).
tff(c_24559,plain,
! [B_2578,C_2579,B_2580,B_2581] :
( theorem(or(not(or(B_2578,C_2579)),or(B_2578,B_2580)))
| ~ theorem(or(not(or(B_2581,C_2579)),B_2580)) ),
inference(resolution,[status(thm)],[c_4,c_24537]) ).
tff(c_26084,plain,
! [B_2582,B_2583,A_2584] : theorem(or(not(or(B_2582,B_2583)),or(B_2582,or(B_2583,A_2584)))),
inference(resolution,[status(thm)],[c_1066,c_24559]) ).
tff(c_26134,plain,
! [B_2588,B_2589,A_2590] : theorem(or(or(B_2588,or(B_2589,A_2590)),not(or(B_2588,B_2589)))),
inference(resolution,[status(thm)],[c_26084,c_40]) ).
tff(c_143,plain,
! [B_43,B_3,C_44] :
( theorem(or(B_43,or(B_3,C_44)))
| ~ theorem(or(B_43,C_44)) ),
inference(resolution,[status(thm)],[c_30,c_128]) ).
tff(c_244,plain,
! [B_60,C_61] :
( theorem(or(B_60,C_61))
| ~ theorem(or(or(B_60,C_61),C_61)) ),
inference(resolution,[status(thm)],[c_195,c_29]) ).
tff(c_277,plain,
! [B_60,B_3,C_44] :
( theorem(or(B_60,or(B_3,C_44)))
| ~ theorem(or(or(B_60,or(B_3,C_44)),C_44)) ),
inference(resolution,[status(thm)],[c_143,c_244]) ).
tff(c_26144,plain,
! [B_2591,B_2592] : theorem(or(B_2591,or(B_2592,not(or(B_2591,B_2592))))),
inference(resolution,[status(thm)],[c_26134,c_277]) ).
tff(c_26165,plain,
! [B_2592,B_2591] : theorem(or(B_2592,or(B_2591,not(or(B_2591,B_2592))))),
inference(resolution,[status(thm)],[c_26144,c_114]) ).
tff(c_18,plain,
~ theorem(or(not(q),or(not(p),not(or(not(p),not(q)))))),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_26176,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_26165,c_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : LCL237-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% 0.00/0.15 % 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.15/0.37 % Computer : n031.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 14:42:14 EDT 2023
% 0.22/0.37 % CPUTime :
% 18.77/10.01 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 18.77/10.02
% 18.77/10.02 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 18.86/10.05
% 18.86/10.05 Inference rules
% 18.86/10.05 ----------------------
% 18.86/10.05 #Ref : 0
% 18.86/10.05 #Sup : 5832
% 18.86/10.05 #Fact : 0
% 18.86/10.05 #Define : 0
% 18.86/10.05 #Split : 0
% 18.86/10.05 #Chain : 0
% 18.86/10.05 #Close : 0
% 18.86/10.05
% 18.86/10.05 Ordering : KBO
% 18.86/10.05
% 18.86/10.05 Simplification rules
% 18.86/10.05 ----------------------
% 18.86/10.05 #Subsume : 477
% 18.86/10.05 #Demod : 2313
% 18.86/10.05 #Tautology : 2317
% 18.86/10.05 #SimpNegUnit : 0
% 18.86/10.05 #BackRed : 1
% 18.86/10.05
% 18.86/10.05 #Partial instantiations: 0
% 18.86/10.05 #Strategies tried : 1
% 18.86/10.05
% 18.86/10.05 Timing (in seconds)
% 18.86/10.05 ----------------------
% 18.86/10.06 Preprocessing : 0.42
% 18.86/10.06 Parsing : 0.23
% 18.86/10.06 CNF conversion : 0.02
% 18.86/10.06 Main loop : 8.55
% 18.86/10.06 Inferencing : 1.69
% 18.86/10.06 Reduction : 3.20
% 18.86/10.06 Demodulation : 2.64
% 18.86/10.06 BG Simplification : 0.05
% 18.86/10.06 Subsumption : 3.26
% 18.86/10.06 Abstraction : 0.08
% 18.86/10.06 MUC search : 0.00
% 18.86/10.06 Cooper : 0.00
% 18.86/10.06 Total : 9.03
% 18.86/10.06 Index Insertion : 0.00
% 18.86/10.06 Index Deletion : 0.00
% 18.86/10.06 Index Matching : 0.00
% 18.86/10.06 BG Taut test : 0.00
%------------------------------------------------------------------------------