TSTP Solution File: LCL197-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL197-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 : n019.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:37 EDT 2023
% Result : Unsatisfiable 7.20s 2.88s
% Output : CNFRefutation 7.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of formulae : 45 ( 19 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 : 8 ( 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 : 81 (; 81 !; 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_53,axiom,
! [A] : axiom(or(not(or(A,A)),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_57,axiom,
! [A,B] : axiom(or(not(or(A,B)),or(B,A))),
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_86,axiom,
~ theorem(or(not(or(q,or(p,q))),or(p,q))),
file(unknown,unknown) ).
tff(c_2,plain,
! [A_1] : axiom(or(not(or(A_1,A_1)),A_1)),
inference(cnfTransformation,[status(thm)],[f_53]) ).
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_128,plain,
! [Y_42,Z_43,X_44] :
( ~ theorem(or(not(Y_42),Z_43))
| ~ axiom(or(not(X_44),Y_42))
| theorem(or(not(X_44),Z_43)) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_406,plain,
! [X_84,Y_85,Z_86] :
( ~ axiom(or(not(X_84),Y_85))
| theorem(or(not(X_84),Z_86))
| ~ axiom(or(not(Y_85),Z_86)) ),
inference(resolution,[status(thm)],[c_12,c_128]) ).
tff(c_442,plain,
! [A_89,Z_90,B_91] :
( theorem(or(not(A_89),Z_90))
| ~ axiom(or(not(or(B_91,A_89)),Z_90)) ),
inference(resolution,[status(thm)],[c_4,c_406]) ).
tff(c_464,plain,
! [A_92] : theorem(or(not(A_92),A_92)),
inference(resolution,[status(thm)],[c_2,c_442]) ).
tff(c_93,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_97,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_93,c_14]) ).
tff(c_553,plain,
! [B_108,C_109] : theorem(or(B_108,or(not(or(B_108,C_109)),C_109))),
inference(resolution,[status(thm)],[c_464,c_97]) ).
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_680,plain,
! [B_127,C_128] : theorem(or(or(not(or(B_127,C_128)),C_128),B_127)),
inference(resolution,[status(thm)],[c_553,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_145,plain,
! [A_45,B_46,C_47] :
( ~ theorem(or(A_45,or(B_46,C_47)))
| theorem(or(B_46,or(A_45,C_47))) ),
inference(resolution,[status(thm)],[c_93,c_14]) ).
tff(c_215,plain,
! [B_57,B_58,C_59] :
( theorem(or(B_57,or(B_58,C_59)))
| ~ theorem(or(B_57,C_59)) ),
inference(resolution,[status(thm)],[c_30,c_145]) ).
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_234,plain,
! [B_58,C_59] :
( theorem(or(B_58,C_59))
| ~ theorem(or(or(B_58,C_59),C_59)) ),
inference(resolution,[status(thm)],[c_215,c_29]) ).
tff(c_690,plain,
! [B_127] : theorem(or(not(or(B_127,B_127)),B_127)),
inference(resolution,[status(thm)],[c_680,c_234]) ).
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_59]) ).
tff(c_106,plain,
! [A_37,B_38,C_39] : axiom(or(not(or(not(A_37),B_38)),or(not(or(C_39,A_37)),or(C_39,B_38)))),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_291,plain,
! [A_62,B_63,C_64] :
( ~ theorem(or(not(A_62),B_63))
| theorem(or(not(or(C_64,A_62)),or(C_64,B_63))) ),
inference(resolution,[status(thm)],[c_106,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_82]) ).
tff(c_1076,plain,
! [X_191,C_192,A_193,B_194] :
( ~ axiom(or(not(X_191),or(C_192,A_193)))
| theorem(or(not(X_191),or(C_192,B_194)))
| ~ theorem(or(not(A_193),B_194)) ),
inference(resolution,[status(thm)],[c_291,c_16]) ).
tff(c_4401,plain,
! [A_550,B_551,C_552,B_553] :
( theorem(or(not(or(A_550,or(B_551,C_552))),or(B_551,B_553)))
| ~ theorem(or(not(or(A_550,C_552)),B_553)) ),
inference(resolution,[status(thm)],[c_8,c_1076]) ).
tff(c_18,plain,
~ theorem(or(not(or(q,or(p,q))),or(p,q))),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_4410,plain,
~ theorem(or(not(or(q,q)),q)),
inference(resolution,[status(thm)],[c_4401,c_18]) ).
tff(c_4419,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_690,c_4410]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : LCL197-1 : TPTP v8.1.2. Released v1.1.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.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 13:40:16 EDT 2023
% 0.14/0.36 % CPUTime :
% 7.20/2.88 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.20/2.88
% 7.20/2.88 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.20/2.92
% 7.20/2.92 Inference rules
% 7.20/2.92 ----------------------
% 7.20/2.92 #Ref : 0
% 7.20/2.92 #Sup : 1004
% 7.20/2.92 #Fact : 0
% 7.20/2.92 #Define : 0
% 7.20/2.92 #Split : 0
% 7.20/2.92 #Chain : 0
% 7.20/2.92 #Close : 0
% 7.20/2.92
% 7.20/2.92 Ordering : KBO
% 7.20/2.92
% 7.20/2.92 Simplification rules
% 7.20/2.92 ----------------------
% 7.20/2.92 #Subsume : 133
% 7.20/2.92 #Demod : 318
% 7.20/2.92 #Tautology : 320
% 7.20/2.92 #SimpNegUnit : 0
% 7.20/2.92 #BackRed : 0
% 7.20/2.92
% 7.20/2.92 #Partial instantiations: 0
% 7.20/2.92 #Strategies tried : 1
% 7.20/2.92
% 7.20/2.92 Timing (in seconds)
% 7.20/2.92 ----------------------
% 7.20/2.92 Preprocessing : 0.43
% 7.20/2.92 Parsing : 0.23
% 7.20/2.92 CNF conversion : 0.02
% 7.20/2.92 Main loop : 1.40
% 7.20/2.92 Inferencing : 0.50
% 7.20/2.92 Reduction : 0.40
% 7.20/2.92 Demodulation : 0.29
% 7.20/2.92 BG Simplification : 0.03
% 7.20/2.92 Subsumption : 0.38
% 7.20/2.92 Abstraction : 0.03
% 7.20/2.92 MUC search : 0.00
% 7.20/2.92 Cooper : 0.00
% 7.20/2.92 Total : 1.88
% 7.20/2.92 Index Insertion : 0.00
% 7.20/2.92 Index Deletion : 0.00
% 7.20/2.92 Index Matching : 0.00
% 7.20/2.92 BG Taut test : 0.00
%------------------------------------------------------------------------------