TSTP Solution File: LCL258-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL258-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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n027.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:50 EDT 2023
% Result : Unsatisfiable 6.58s 2.70s
% Output : CNFRefutation 6.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 15
% Syntax : Number of formulae : 51 ( 19 unt; 7 typ; 0 def)
% Number of atoms : 76 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 66 ( 34 ~; 32 |; 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 93 (; 93 !; 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_77,axiom,
~ theorem(implies(p,implies(implies(p,q),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_120,plain,
! [A_39,B_40,C_41] : axiom(implies(or(A_39,or(B_40,C_41)),or(B_40,or(A_39,C_41)))),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_133,plain,
! [X_12,B_40,Y_13] : axiom(implies(or(not(X_12),or(B_40,Y_13)),or(B_40,implies(X_12,Y_13)))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_120]) ).
tff(c_307,plain,
! [X_68,B_69,Y_70] : axiom(implies(implies(X_68,or(B_69,Y_70)),or(B_69,implies(X_68,Y_70)))),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_133]) ).
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_318,plain,
! [X_68,B_69,Y_70] :
( ~ theorem(implies(X_68,or(B_69,Y_70)))
| theorem(or(B_69,implies(X_68,Y_70))) ),
inference(resolution,[status(thm)],[c_307,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_64,plain,
! [Y_32,X_33] :
( ~ theorem(Y_32)
| theorem(X_33)
| ~ axiom(implies(Y_32,X_33)) ),
inference(resolution,[status(thm)],[c_14,c_50]) ).
tff(c_84,plain,
! [A_2,B_3] :
( ~ theorem(A_2)
| theorem(or(B_3,A_2)) ),
inference(resolution,[status(thm)],[c_4,c_64]) ).
tff(c_399,plain,
! [A_83,B_84,C_85] :
( ~ theorem(or(A_83,or(B_84,C_85)))
| theorem(or(B_84,or(A_83,C_85))) ),
inference(resolution,[status(thm)],[c_120,c_54]) ).
tff(c_512,plain,
! [B_104,B_105,C_106] :
( theorem(or(B_104,or(B_105,C_106)))
| ~ theorem(or(B_104,C_106)) ),
inference(resolution,[status(thm)],[c_84,c_399]) ).
tff(c_527,plain,
! [X_12,B_105,C_106] :
( theorem(implies(X_12,or(B_105,C_106)))
| ~ theorem(or(not(X_12),C_106)) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_512]) ).
tff(c_665,plain,
! [X_119,B_120,C_121] :
( theorem(implies(X_119,or(B_120,C_121)))
| ~ theorem(implies(X_119,C_121)) ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_527]) ).
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_696,plain,
! [X_125,B_126,C_127] :
( ~ theorem(X_125)
| theorem(or(B_126,C_127))
| ~ theorem(implies(X_125,C_127)) ),
inference(resolution,[status(thm)],[c_665,c_16]) ).
tff(c_977,plain,
! [X_156,B_157,C_158] :
( ~ theorem(X_156)
| theorem(or(B_157,C_158))
| ~ axiom(implies(X_156,C_158)) ),
inference(resolution,[status(thm)],[c_14,c_696]) ).
tff(c_1258,plain,
! [A_183,B_184,B_185] :
( ~ theorem(or(A_183,B_184))
| theorem(or(B_185,or(B_184,A_183))) ),
inference(resolution,[status(thm)],[c_6,c_977]) ).
tff(c_138,plain,
! [A_39,B_40,C_41] :
( ~ theorem(or(A_39,or(B_40,C_41)))
| theorem(or(B_40,or(A_39,C_41))) ),
inference(resolution,[status(thm)],[c_120,c_54]) ).
tff(c_1502,plain,
! [B_213,B_214,A_215] :
( theorem(or(B_213,or(B_214,A_215)))
| ~ theorem(or(A_215,B_213)) ),
inference(resolution,[status(thm)],[c_1258,c_138]) ).
tff(c_2,plain,
! [A_1] : axiom(implies(or(A_1,A_1),A_1)),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_83,plain,
! [A_1] :
( ~ theorem(or(A_1,A_1))
| theorem(A_1) ),
inference(resolution,[status(thm)],[c_2,c_64]) ).
tff(c_1575,plain,
! [B_219,A_220] :
( theorem(or(B_219,A_220))
| ~ theorem(or(A_220,or(B_219,A_220))) ),
inference(resolution,[status(thm)],[c_1502,c_83]) ).
tff(c_1646,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_1575]) ).
tff(c_1999,plain,
! [X_258,Y_259] :
( theorem(implies(X_258,Y_259))
| ~ theorem(or(Y_259,implies(X_258,Y_259))) ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_1646]) ).
tff(c_2127,plain,
! [X_263,Y_264] :
( theorem(implies(X_263,Y_264))
| ~ theorem(implies(X_263,or(Y_264,Y_264))) ),
inference(resolution,[status(thm)],[c_318,c_1999]) ).
tff(c_2186,plain,
! [X_265,Y_266] :
( theorem(implies(X_265,Y_266))
| ~ axiom(implies(X_265,or(Y_266,Y_266))) ),
inference(resolution,[status(thm)],[c_14,c_2127]) ).
tff(c_2220,plain,
! [A_2] : theorem(implies(A_2,A_2)),
inference(resolution,[status(thm)],[c_4,c_2186]) ).
tff(c_313,plain,
! [X_68,X_12,Y_13] : axiom(implies(implies(X_68,implies(X_12,Y_13)),or(not(X_12),implies(X_68,Y_13)))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_307]) ).
tff(c_1017,plain,
! [X_159,X_160,Y_161] : axiom(implies(implies(X_159,implies(X_160,Y_161)),implies(X_160,implies(X_159,Y_161)))),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_313]) ).
tff(c_4420,plain,
! [X_368,X_369,Y_370] :
( ~ theorem(implies(X_368,implies(X_369,Y_370)))
| theorem(implies(X_369,implies(X_368,Y_370))) ),
inference(resolution,[status(thm)],[c_1017,c_54]) ).
tff(c_4461,plain,
! [X_369,Y_370] : theorem(implies(X_369,implies(implies(X_369,Y_370),Y_370))),
inference(resolution,[status(thm)],[c_2220,c_4420]) ).
tff(c_18,plain,
~ theorem(implies(p,implies(implies(p,q),q))),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_4471,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4461,c_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL258-3 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 14:30:38 EDT 2023
% 0.14/0.34 % CPUTime :
% 6.58/2.70 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.58/2.71
% 6.58/2.71 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.82/2.74
% 6.82/2.74 Inference rules
% 6.82/2.74 ----------------------
% 6.82/2.74 #Ref : 0
% 6.82/2.74 #Sup : 1050
% 6.82/2.74 #Fact : 0
% 6.82/2.74 #Define : 0
% 6.82/2.74 #Split : 1
% 6.82/2.74 #Chain : 0
% 6.82/2.74 #Close : 0
% 6.82/2.74
% 6.82/2.74 Ordering : KBO
% 6.82/2.74
% 6.82/2.74 Simplification rules
% 6.82/2.74 ----------------------
% 6.82/2.74 #Subsume : 525
% 6.82/2.74 #Demod : 70
% 6.82/2.74 #Tautology : 53
% 6.82/2.74 #SimpNegUnit : 0
% 6.82/2.74 #BackRed : 1
% 6.82/2.74
% 6.82/2.74 #Partial instantiations: 0
% 6.82/2.74 #Strategies tried : 1
% 6.82/2.74
% 6.82/2.74 Timing (in seconds)
% 6.82/2.74 ----------------------
% 6.82/2.75 Preprocessing : 0.42
% 6.82/2.75 Parsing : 0.23
% 6.82/2.75 CNF conversion : 0.02
% 6.82/2.75 Main loop : 1.12
% 6.82/2.75 Inferencing : 0.44
% 6.82/2.75 Reduction : 0.26
% 6.82/2.75 Demodulation : 0.18
% 6.82/2.75 BG Simplification : 0.03
% 6.82/2.75 Subsumption : 0.31
% 6.82/2.75 Abstraction : 0.03
% 6.82/2.75 MUC search : 0.00
% 6.82/2.75 Cooper : 0.00
% 6.82/2.75 Total : 1.60
% 6.82/2.75 Index Insertion : 0.00
% 6.82/2.75 Index Deletion : 0.00
% 6.82/2.75 Index Matching : 0.00
% 6.82/2.75 BG Taut test : 0.00
%------------------------------------------------------------------------------