TSTP Solution File: LCL202-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL202-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 : n001.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.21s 2.97s
% Output : CNFRefutation 7.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 16
% Syntax : Number of formulae : 63 ( 27 unt; 7 typ; 0 def)
% Number of atoms : 94 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 80 ( 42 ~; 38 |; 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 : 116 (; 116 !; 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_61,axiom,
! [X] :
( theorem(X)
| ~ axiom(X) ),
file(unknown,unknown) ).
tff(f_56,axiom,
! [X,Y] : ( implies(X,Y) = or(not(X),Y) ),
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(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_14,plain,
! [X_14] :
( ~ axiom(X_14)
| theorem(X_14) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
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_129,plain,
! [A_40,B_41,C_42] : axiom(implies(or(A_40,or(B_41,C_42)),or(B_41,or(A_40,C_42)))),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_139,plain,
! [X_12,B_41,C_42] : axiom(implies(implies(X_12,or(B_41,C_42)),or(B_41,or(not(X_12),C_42)))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_129]) ).
tff(c_409,plain,
! [X_83,B_84,C_85] : axiom(implies(implies(X_83,or(B_84,C_85)),or(B_84,implies(X_83,C_85)))),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_139]) ).
tff(c_39,plain,
! [Y_25,X_26] :
( ~ theorem(Y_25)
| ~ theorem(implies(Y_25,X_26))
| theorem(X_26) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_43,plain,
! [Y_25,X_26] :
( ~ theorem(Y_25)
| theorem(X_26)
| ~ axiom(implies(Y_25,X_26)) ),
inference(resolution,[status(thm)],[c_14,c_39]) ).
tff(c_420,plain,
! [X_83,B_84,C_85] :
( ~ theorem(implies(X_83,or(B_84,C_85)))
| theorem(or(B_84,implies(X_83,C_85))) ),
inference(resolution,[status(thm)],[c_409,c_43]) ).
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_52,plain,
! [Y_30,X_31] :
( ~ theorem(Y_30)
| theorem(X_31)
| ~ axiom(implies(Y_30,X_31)) ),
inference(resolution,[status(thm)],[c_14,c_39]) ).
tff(c_72,plain,
! [A_2,B_3] :
( ~ theorem(A_2)
| theorem(or(B_3,A_2)) ),
inference(resolution,[status(thm)],[c_4,c_52]) ).
tff(c_135,plain,
! [A_40,X_12,Y_13] : axiom(implies(or(A_40,implies(X_12,Y_13)),or(not(X_12),or(A_40,Y_13)))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_129]) ).
tff(c_423,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_135]) ).
tff(c_445,plain,
! [A_92,X_93,Y_94] :
( ~ theorem(or(A_92,implies(X_93,Y_94)))
| theorem(implies(X_93,or(A_92,Y_94))) ),
inference(resolution,[status(thm)],[c_423,c_43]) ).
tff(c_487,plain,
! [X_101,B_102,Y_103] :
( theorem(implies(X_101,or(B_102,Y_103)))
| ~ theorem(implies(X_101,Y_103)) ),
inference(resolution,[status(thm)],[c_72,c_445]) ).
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_521,plain,
! [X_107,B_108,Y_109] :
( ~ theorem(X_107)
| theorem(or(B_108,Y_109))
| ~ theorem(implies(X_107,Y_109)) ),
inference(resolution,[status(thm)],[c_487,c_16]) ).
tff(c_754,plain,
! [X_132,B_133,Y_134] :
( ~ theorem(X_132)
| theorem(or(B_133,Y_134))
| ~ axiom(implies(X_132,Y_134)) ),
inference(resolution,[status(thm)],[c_14,c_521]) ).
tff(c_793,plain,
! [A_4,B_5,B_133] :
( ~ theorem(or(A_4,B_5))
| theorem(or(B_133,or(B_5,A_4))) ),
inference(resolution,[status(thm)],[c_6,c_754]) ).
tff(c_998,plain,
! [A_162,B_163,C_164] :
( ~ theorem(or(A_162,or(B_163,C_164)))
| theorem(or(B_163,or(A_162,C_164))) ),
inference(resolution,[status(thm)],[c_129,c_43]) ).
tff(c_1560,plain,
! [B_210,B_211,A_212] :
( theorem(or(B_210,or(B_211,A_212)))
| ~ theorem(or(A_212,B_210)) ),
inference(resolution,[status(thm)],[c_793,c_998]) ).
tff(c_2,plain,
! [A_1] : axiom(implies(or(A_1,A_1),A_1)),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_71,plain,
! [A_1] :
( ~ theorem(or(A_1,A_1))
| theorem(A_1) ),
inference(resolution,[status(thm)],[c_2,c_52]) ).
tff(c_1810,plain,
! [B_233,A_234] :
( theorem(or(B_233,A_234))
| ~ theorem(or(A_234,or(B_233,A_234))) ),
inference(resolution,[status(thm)],[c_1560,c_71]) ).
tff(c_1881,plain,
! [X_12,Y_13] :
( theorem(or(not(X_12),Y_13))
| ~ theorem(or(Y_13,implies(X_12,Y_13))) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_1810]) ).
tff(c_2133,plain,
! [X_262,Y_263] :
( theorem(implies(X_262,Y_263))
| ~ theorem(or(Y_263,implies(X_262,Y_263))) ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_1881]) ).
tff(c_2327,plain,
! [X_272,C_273] :
( theorem(implies(X_272,C_273))
| ~ theorem(implies(X_272,or(C_273,C_273))) ),
inference(resolution,[status(thm)],[c_420,c_2133]) ).
tff(c_2457,plain,
! [X_278,C_279] :
( theorem(implies(X_278,C_279))
| ~ axiom(implies(X_278,or(C_279,C_279))) ),
inference(resolution,[status(thm)],[c_14,c_2327]) ).
tff(c_2492,plain,
! [A_280] : theorem(implies(A_280,A_280)),
inference(resolution,[status(thm)],[c_4,c_2457]) ).
tff(c_44,plain,
! [A_27,B_28] : axiom(implies(or(A_27,B_28),or(B_28,A_27))),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_187,plain,
! [Y_48,X_49] : axiom(implies(or(Y_48,not(X_49)),implies(X_49,Y_48))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_44]) ).
tff(c_288,plain,
! [Y_62,X_63] :
( ~ theorem(or(Y_62,not(X_63)))
| theorem(implies(X_63,Y_62)) ),
inference(resolution,[status(thm)],[c_187,c_43]) ).
tff(c_307,plain,
! [X_12,X_63] :
( ~ theorem(implies(X_12,not(X_63)))
| theorem(implies(X_63,not(X_12))) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_288]) ).
tff(c_2517,plain,
! [X_63] : theorem(implies(X_63,not(not(X_63)))),
inference(resolution,[status(thm)],[c_2492,c_307]) ).
tff(c_102,plain,
! [A_36,B_37,C_38] : axiom(implies(implies(A_36,B_37),implies(or(C_38,A_36),or(C_38,B_37)))),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_111,plain,
! [A_36,Y_13,X_12] : axiom(implies(implies(A_36,Y_13),implies(or(not(X_12),A_36),implies(X_12,Y_13)))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_102]) ).
tff(c_370,plain,
! [A_75,Y_76,X_77] : axiom(implies(implies(A_75,Y_76),implies(implies(X_77,A_75),implies(X_77,Y_76)))),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_111]) ).
tff(c_724,plain,
! [A_126,Y_127,X_128] :
( ~ theorem(implies(A_126,Y_127))
| theorem(implies(implies(X_128,A_126),implies(X_128,Y_127))) ),
inference(resolution,[status(thm)],[c_370,c_43]) ).
tff(c_1722,plain,
! [X_227,A_228,Y_229] :
( ~ theorem(implies(X_227,A_228))
| theorem(implies(X_227,Y_229))
| ~ theorem(implies(A_228,Y_229)) ),
inference(resolution,[status(thm)],[c_724,c_16]) ).
tff(c_6131,plain,
! [X_490,Y_491,A_492] :
( theorem(implies(X_490,Y_491))
| ~ theorem(implies(A_492,Y_491))
| ~ axiom(implies(X_490,A_492)) ),
inference(resolution,[status(thm)],[c_14,c_1722]) ).
tff(c_6456,plain,
! [X_519,X_520] :
( theorem(implies(X_519,not(not(X_520))))
| ~ axiom(implies(X_519,X_520)) ),
inference(resolution,[status(thm)],[c_2517,c_6131]) ).
tff(c_6584,plain,
! [X_527,X_528] :
( theorem(implies(not(X_527),not(X_528)))
| ~ axiom(implies(X_528,X_527)) ),
inference(resolution,[status(thm)],[c_6456,c_307]) ).
tff(c_18,plain,
~ theorem(implies(not(or(p,q)),or(p,not(q)))),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_497,plain,
~ theorem(implies(not(or(p,q)),not(q))),
inference(resolution,[status(thm)],[c_487,c_18]) ).
tff(c_6620,plain,
~ axiom(implies(q,or(p,q))),
inference(resolution,[status(thm)],[c_6584,c_497]) ).
tff(c_6649,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_6620]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL202-3 : TPTP v8.1.2. Released v2.3.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.17/0.35 % Computer : n001.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Thu Aug 3 14:34:10 EDT 2023
% 0.17/0.35 % CPUTime :
% 7.21/2.97 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.21/2.98
% 7.21/2.98 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.21/3.02
% 7.21/3.02 Inference rules
% 7.21/3.02 ----------------------
% 7.21/3.02 #Ref : 0
% 7.21/3.02 #Sup : 1592
% 7.21/3.02 #Fact : 0
% 7.21/3.02 #Define : 0
% 7.21/3.02 #Split : 2
% 7.21/3.02 #Chain : 0
% 7.21/3.02 #Close : 0
% 7.21/3.02
% 7.21/3.02 Ordering : KBO
% 7.21/3.02
% 7.21/3.02 Simplification rules
% 7.21/3.02 ----------------------
% 7.21/3.02 #Subsume : 714
% 7.21/3.02 #Demod : 111
% 7.21/3.02 #Tautology : 73
% 7.21/3.02 #SimpNegUnit : 43
% 7.21/3.02 #BackRed : 20
% 7.21/3.02
% 7.21/3.02 #Partial instantiations: 0
% 7.21/3.02 #Strategies tried : 1
% 7.21/3.02
% 7.21/3.02 Timing (in seconds)
% 7.21/3.02 ----------------------
% 7.21/3.02 Preprocessing : 0.43
% 7.21/3.02 Parsing : 0.23
% 7.21/3.02 CNF conversion : 0.02
% 7.21/3.02 Main loop : 1.53
% 7.21/3.02 Inferencing : 0.59
% 7.21/3.02 Reduction : 0.37
% 7.21/3.02 Demodulation : 0.24
% 7.21/3.02 BG Simplification : 0.03
% 7.21/3.02 Subsumption : 0.43
% 7.21/3.02 Abstraction : 0.04
% 7.21/3.02 MUC search : 0.00
% 7.21/3.02 Cooper : 0.00
% 7.21/3.02 Total : 2.02
% 7.21/3.02 Index Insertion : 0.00
% 7.21/3.02 Index Deletion : 0.00
% 7.21/3.02 Index Matching : 0.00
% 7.21/3.03 BG Taut test : 0.00
%------------------------------------------------------------------------------