TSTP Solution File: LCL178-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL178-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 : n010.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:33 EDT 2023
% Result : Unsatisfiable 5.05s 2.24s
% Output : CNFRefutation 5.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 14
% Syntax : Number of formulae : 52 ( 20 unt; 6 typ; 0 def)
% Number of atoms : 79 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 68 ( 35 ~; 33 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 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 : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 94 (; 94 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ theorem > axiom > or > implies > #nlpp > not > 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(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_77,axiom,
~ theorem(implies(p,not(not(p)))),
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_55,plain,
! [A_29,B_30,C_31] : axiom(implies(or(A_29,or(B_30,C_31)),or(B_30,or(A_29,C_31)))),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_65,plain,
! [X_12,B_30,Y_13] : axiom(implies(or(not(X_12),or(B_30,Y_13)),or(B_30,implies(X_12,Y_13)))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_55]) ).
tff(c_378,plain,
! [X_83,B_84,Y_85] : axiom(implies(implies(X_83,or(B_84,Y_85)),or(B_84,implies(X_83,Y_85)))),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_65]) ).
tff(c_50,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_54,plain,
! [Y_27,X_28] :
( ~ theorem(Y_27)
| theorem(X_28)
| ~ axiom(implies(Y_27,X_28)) ),
inference(resolution,[status(thm)],[c_14,c_50]) ).
tff(c_389,plain,
! [X_83,B_84,Y_85] :
( ~ theorem(implies(X_83,or(B_84,Y_85)))
| theorem(or(B_84,implies(X_83,Y_85))) ),
inference(resolution,[status(thm)],[c_378,c_54]) ).
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_75,plain,
! [Y_33,X_34] :
( ~ theorem(Y_33)
| theorem(X_34)
| ~ axiom(implies(Y_33,X_34)) ),
inference(resolution,[status(thm)],[c_14,c_50]) ).
tff(c_99,plain,
! [A_2,B_3] :
( ~ theorem(A_2)
| theorem(or(B_3,A_2)) ),
inference(resolution,[status(thm)],[c_4,c_75]) ).
tff(c_8,plain,
! [A_6,B_7,C_8] : axiom(implies(or(A_6,or(B_7,C_8)),or(B_7,or(A_6,C_8)))),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_394,plain,
! [A_86,B_87,C_88] :
( ~ theorem(or(A_86,or(B_87,C_88)))
| theorem(or(B_87,or(A_86,C_88))) ),
inference(resolution,[status(thm)],[c_8,c_75]) ).
tff(c_507,plain,
! [B_110,B_111,C_112] :
( theorem(or(B_110,or(B_111,C_112)))
| ~ theorem(or(B_110,C_112)) ),
inference(resolution,[status(thm)],[c_99,c_394]) ).
tff(c_522,plain,
! [X_12,B_111,C_112] :
( theorem(implies(X_12,or(B_111,C_112)))
| ~ theorem(or(not(X_12),C_112)) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_507]) ).
tff(c_656,plain,
! [X_122,B_123,C_124] :
( theorem(implies(X_122,or(B_123,C_124)))
| ~ theorem(implies(X_122,C_124)) ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_522]) ).
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_692,plain,
! [X_131,B_132,C_133] :
( ~ theorem(X_131)
| theorem(or(B_132,C_133))
| ~ theorem(implies(X_131,C_133)) ),
inference(resolution,[status(thm)],[c_656,c_16]) ).
tff(c_942,plain,
! [X_154,B_155,C_156] :
( ~ theorem(X_154)
| theorem(or(B_155,C_156))
| ~ axiom(implies(X_154,C_156)) ),
inference(resolution,[status(thm)],[c_14,c_692]) ).
tff(c_1395,plain,
! [A_205,B_206,B_207] :
( ~ theorem(or(A_205,B_206))
| theorem(or(B_207,or(B_206,A_205))) ),
inference(resolution,[status(thm)],[c_6,c_942]) ).
tff(c_95,plain,
! [A_6,B_7,C_8] :
( ~ theorem(or(A_6,or(B_7,C_8)))
| theorem(or(B_7,or(A_6,C_8))) ),
inference(resolution,[status(thm)],[c_8,c_75]) ).
tff(c_1497,plain,
! [B_219,B_220,A_221] :
( theorem(or(B_219,or(B_220,A_221)))
| ~ theorem(or(A_221,B_219)) ),
inference(resolution,[status(thm)],[c_1395,c_95]) ).
tff(c_2,plain,
! [A_1] : axiom(implies(or(A_1,A_1),A_1)),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_98,plain,
! [A_1] :
( ~ theorem(or(A_1,A_1))
| theorem(A_1) ),
inference(resolution,[status(thm)],[c_2,c_75]) ).
tff(c_1603,plain,
! [B_229,A_230] :
( theorem(or(B_229,A_230))
| ~ theorem(or(A_230,or(B_229,A_230))) ),
inference(resolution,[status(thm)],[c_1497,c_98]) ).
tff(c_1678,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_1603]) ).
tff(c_1817,plain,
! [X_246,Y_247] :
( theorem(implies(X_246,Y_247))
| ~ theorem(or(Y_247,implies(X_246,Y_247))) ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_1678]) ).
tff(c_2092,plain,
! [X_261,Y_262] :
( theorem(implies(X_261,Y_262))
| ~ theorem(implies(X_261,or(Y_262,Y_262))) ),
inference(resolution,[status(thm)],[c_389,c_1817]) ).
tff(c_2204,plain,
! [X_268,Y_269] :
( theorem(implies(X_268,Y_269))
| ~ axiom(implies(X_268,or(Y_269,Y_269))) ),
inference(resolution,[status(thm)],[c_14,c_2092]) ).
tff(c_2239,plain,
! [A_270] : theorem(implies(A_270,A_270)),
inference(resolution,[status(thm)],[c_4,c_2204]) ).
tff(c_43,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_228,plain,
! [X_58,Y_59] : axiom(implies(implies(X_58,Y_59),or(Y_59,not(X_58)))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_43]) ).
tff(c_276,plain,
! [X_65,Y_66] :
( ~ theorem(implies(X_65,Y_66))
| theorem(or(Y_66,not(X_65))) ),
inference(resolution,[status(thm)],[c_228,c_54]) ).
tff(c_289,plain,
! [X_65,X_12] :
( ~ theorem(implies(X_65,not(X_12)))
| theorem(implies(X_12,not(X_65))) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_276]) ).
tff(c_2261,plain,
! [X_12] : theorem(implies(X_12,not(not(X_12)))),
inference(resolution,[status(thm)],[c_2239,c_289]) ).
tff(c_18,plain,
~ theorem(implies(p,not(not(p)))),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_2294,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2261,c_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL178-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.15/0.35 % Computer : n010.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 14:00:58 EDT 2023
% 0.15/0.35 % CPUTime :
% 5.05/2.24 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.05/2.24
% 5.05/2.24 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.05/2.28
% 5.05/2.28 Inference rules
% 5.05/2.28 ----------------------
% 5.05/2.28 #Ref : 0
% 5.05/2.28 #Sup : 526
% 5.05/2.28 #Fact : 0
% 5.05/2.28 #Define : 0
% 5.05/2.28 #Split : 1
% 5.05/2.28 #Chain : 0
% 5.05/2.28 #Close : 0
% 5.05/2.28
% 5.05/2.28 Ordering : KBO
% 5.05/2.28
% 5.05/2.28 Simplification rules
% 5.05/2.28 ----------------------
% 5.05/2.28 #Subsume : 264
% 5.05/2.28 #Demod : 37
% 5.05/2.28 #Tautology : 25
% 5.05/2.28 #SimpNegUnit : 0
% 5.05/2.28 #BackRed : 1
% 5.05/2.28
% 5.05/2.28 #Partial instantiations: 0
% 5.05/2.28 #Strategies tried : 1
% 5.05/2.28
% 5.05/2.28 Timing (in seconds)
% 5.05/2.28 ----------------------
% 5.05/2.29 Preprocessing : 0.41
% 5.05/2.29 Parsing : 0.22
% 5.05/2.29 CNF conversion : 0.02
% 5.05/2.29 Main loop : 0.80
% 5.05/2.29 Inferencing : 0.33
% 5.05/2.29 Reduction : 0.19
% 5.05/2.29 Demodulation : 0.13
% 5.05/2.29 BG Simplification : 0.02
% 5.05/2.29 Subsumption : 0.20
% 5.05/2.29 Abstraction : 0.02
% 5.05/2.29 MUC search : 0.00
% 5.05/2.29 Cooper : 0.00
% 5.05/2.29 Total : 1.27
% 5.05/2.29 Index Insertion : 0.00
% 5.05/2.29 Index Deletion : 0.00
% 5.05/2.29 Index Matching : 0.00
% 5.05/2.29 BG Taut test : 0.00
%------------------------------------------------------------------------------