TSTP Solution File: LCL182-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL182-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 : n014.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:34 EDT 2023
% Result : Unsatisfiable 36.29s 26.88s
% Output : CNFRefutation 36.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of formulae : 45 ( 17 unt; 6 typ; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 59 ( 31 ~; 28 |; 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 : 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 : 82 (; 82 !; 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_57,axiom,
! [A,B] : axiom(or(not(or(A,B)),or(B,A))),
file(unknown,unknown) ).
tff(f_55,axiom,
! [A,B] : axiom(or(not(A),or(B,A))),
file(unknown,unknown) ).
tff(f_66,axiom,
! [X] :
( theorem(X)
| ~ axiom(X) ),
file(unknown,unknown) ).
tff(f_82,axiom,
! [X,Z,Y] :
( theorem(or(not(X),Z))
| ~ axiom(or(not(X),Y))
| ~ theorem(or(not(Y),Z)) ),
file(unknown,unknown) ).
tff(f_59,axiom,
! [A,B,C] : axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
file(unknown,unknown) ).
tff(f_74,axiom,
! [X,Y] :
( theorem(X)
| ~ axiom(or(not(Y),X))
| ~ theorem(Y) ),
file(unknown,unknown) ).
tff(f_61,axiom,
! [A,B,C] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
file(unknown,unknown) ).
tff(f_53,axiom,
! [A] : axiom(or(not(or(A,A)),A)),
file(unknown,unknown) ).
tff(f_86,axiom,
~ theorem(or(not(or(not(p),q)),or(not(not(q)),not(p)))),
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_57]) ).
tff(c_4,plain,
! [A_2,B_3] : axiom(or(not(A_2),or(B_3,A_2))),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_12,plain,
! [X_12] :
( ~ axiom(X_12)
| theorem(X_12) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_106,plain,
! [Y_37,Z_38,X_39] :
( ~ theorem(or(not(Y_37),Z_38))
| ~ axiom(or(not(X_39),Y_37))
| theorem(or(not(X_39),Z_38)) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
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_106]) ).
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_97,plain,
! [A_34,B_35,C_36] : axiom(or(not(or(A_34,or(B_35,C_36))),or(B_35,or(A_34,C_36)))),
inference(cnfTransformation,[status(thm)],[f_59]) ).
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_74]) ).
tff(c_101,plain,
! [A_34,B_35,C_36] :
( ~ theorem(or(A_34,or(B_35,C_36)))
| theorem(or(B_35,or(A_34,C_36))) ),
inference(resolution,[status(thm)],[c_97,c_14]) ).
tff(c_631,plain,
! [B_110,A_111] : theorem(or(B_110,or(not(B_110),A_111))),
inference(resolution,[status(thm)],[c_624,c_101]) ).
tff(c_177,plain,
! [A_48,B_49,C_50] : axiom(or(not(or(not(A_48),B_49)),or(not(or(C_50,A_48)),or(C_50,B_49)))),
inference(cnfTransformation,[status(thm)],[f_61]) ).
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_177,c_14]) ).
tff(c_1038,plain,
! [C_177,A_178,B_179] :
( theorem(or(C_177,or(not(or(C_177,A_178)),B_179)))
| ~ theorem(or(not(A_178),B_179)) ),
inference(resolution,[status(thm)],[c_447,c_101]) ).
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_57]) ).
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_1048,plain,
! [C_177,A_178,B_179] :
( theorem(or(or(not(or(C_177,A_178)),B_179),C_177))
| ~ theorem(or(not(A_178),B_179)) ),
inference(resolution,[status(thm)],[c_1038,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_74]) ).
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_140,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_97,c_14]) ).
tff(c_155,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_140]) ).
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_140]) ).
tff(c_2,plain,
! [A_1] : axiom(or(not(or(A_1,A_1)),A_1)),
inference(cnfTransformation,[status(thm)],[f_53]) ).
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_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_7728,plain,
! [B_970,B_971,C_972] :
( theorem(or(B_970,or(B_971,C_972)))
| ~ theorem(or(or(B_970,or(B_971,C_972)),C_972)) ),
inference(resolution,[status(thm)],[c_155,c_244]) ).
tff(c_59597,plain,
! [C_4350,A_4351,B_4352] :
( theorem(or(not(or(C_4350,A_4351)),or(B_4352,C_4350)))
| ~ theorem(or(not(A_4351),or(B_4352,C_4350))) ),
inference(resolution,[status(thm)],[c_1048,c_7728]) ).
tff(c_18,plain,
~ theorem(or(not(or(not(p),q)),or(not(not(q)),not(p)))),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_59615,plain,
~ theorem(or(not(q),or(not(not(q)),not(p)))),
inference(resolution,[status(thm)],[c_59597,c_18]) ).
tff(c_59629,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_631,c_59615]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL182-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/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 : n014.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 14:10:48 EDT 2023
% 0.13/0.34 % CPUTime :
% 36.29/26.88 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 36.29/26.89
% 36.29/26.89 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 36.29/26.93
% 36.29/26.93 Inference rules
% 36.29/26.93 ----------------------
% 36.29/26.93 #Ref : 0
% 36.29/26.93 #Sup : 13139
% 36.29/26.93 #Fact : 0
% 36.29/26.93 #Define : 0
% 36.29/26.93 #Split : 0
% 36.29/26.93 #Chain : 0
% 36.29/26.93 #Close : 0
% 36.29/26.93
% 36.29/26.93 Ordering : KBO
% 36.29/26.93
% 36.29/26.93 Simplification rules
% 36.29/26.93 ----------------------
% 36.29/26.93 #Subsume : 1012
% 36.29/26.93 #Demod : 5371
% 36.29/26.93 #Tautology : 5378
% 36.29/26.93 #SimpNegUnit : 0
% 36.29/26.93 #BackRed : 0
% 36.29/26.93
% 36.29/26.93 #Partial instantiations: 0
% 36.29/26.93 #Strategies tried : 1
% 36.29/26.93
% 36.29/26.93 Timing (in seconds)
% 36.29/26.93 ----------------------
% 36.29/26.93 Preprocessing : 0.43
% 36.29/26.93 Parsing : 0.23
% 36.29/26.93 CNF conversion : 0.02
% 36.29/26.93 Main loop : 25.44
% 36.29/26.93 Inferencing : 3.61
% 36.29/26.93 Reduction : 10.39
% 36.29/26.93 Demodulation : 8.94
% 36.29/26.93 BG Simplification : 0.07
% 36.29/26.93 Subsumption : 10.43
% 36.29/26.93 Abstraction : 0.13
% 36.29/26.93 MUC search : 0.00
% 36.29/26.93 Cooper : 0.00
% 36.29/26.93 Total : 25.92
% 36.29/26.93 Index Insertion : 0.00
% 36.29/26.93 Index Deletion : 0.00
% 36.29/26.93 Index Matching : 0.00
% 36.29/26.93 BG Taut test : 0.00
%------------------------------------------------------------------------------