TSTP Solution File: LCL259-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL259-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 : n005.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 35.73s 23.95s
% Output : CNFRefutation 35.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 16
% Syntax : Number of formulae : 57 ( 24 unt; 7 typ; 0 def)
% Number of atoms : 87 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 76 ( 39 ~; 37 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 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 : 115 (; 115 !; 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_56,axiom,
! [X,Y] : ( implies(X,Y) = or(not(X),Y) ),
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_50,axiom,
! [A,B] : axiom(implies(or(A,B),or(B,A))),
file(unknown,unknown) ).
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_69,axiom,
! [X,Y] :
( theorem(X)
| ~ theorem(implies(Y,X))
| ~ theorem(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_46,axiom,
! [A] : axiom(implies(or(A,A),A)),
file(unknown,unknown) ).
tff(f_77,axiom,
~ theorem(implies(implies(p,implies(p,q)),implies(p,q))),
file(unknown,unknown) ).
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_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_114,plain,
! [A_36,Y_13,X_12] : axiom(implies(implies(A_36,Y_13),implies(implies(X_12,A_36),implies(X_12,Y_13)))),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_111]) ).
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_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_383,plain,
! [A_79,Y_80,X_81] : axiom(implies(implies(A_79,Y_80),implies(implies(X_81,A_79),implies(X_81,Y_80)))),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_111]) ).
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_982,plain,
! [A_157,Y_158,X_159] :
( ~ theorem(implies(A_157,Y_158))
| theorem(implies(implies(X_159,A_157),implies(X_159,Y_158))) ),
inference(resolution,[status(thm)],[c_383,c_43]) ).
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_3160,plain,
! [X_308,A_309,Y_310] :
( ~ theorem(implies(X_308,A_309))
| theorem(implies(X_308,Y_310))
| ~ theorem(implies(A_309,Y_310)) ),
inference(resolution,[status(thm)],[c_982,c_16]) ).
tff(c_6692,plain,
! [X_488,Y_489,A_490] :
( theorem(implies(X_488,Y_489))
| ~ theorem(implies(A_490,Y_489))
| ~ axiom(implies(X_488,A_490)) ),
inference(resolution,[status(thm)],[c_14,c_3160]) ).
tff(c_16093,plain,
! [X_869,Y_870,A_871] :
( theorem(implies(X_869,Y_870))
| ~ axiom(implies(X_869,A_871))
| ~ axiom(implies(A_871,Y_870)) ),
inference(resolution,[status(thm)],[c_14,c_6692]) ).
tff(c_17859,plain,
! [A_910,Y_911,B_912] :
( theorem(implies(A_910,Y_911))
| ~ axiom(implies(or(B_912,A_910),Y_911)) ),
inference(resolution,[status(thm)],[c_4,c_16093]) ).
tff(c_17889,plain,
! [B_5,A_4] : theorem(implies(B_5,or(B_5,A_4))),
inference(resolution,[status(thm)],[c_6,c_17859]) ).
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_306,plain,
! [X_68,B_69,C_70] : axiom(implies(implies(X_68,or(B_69,C_70)),or(B_69,implies(X_68,C_70)))),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_139]) ).
tff(c_317,plain,
! [X_68,B_69,C_70] :
( ~ theorem(implies(X_68,or(B_69,C_70)))
| theorem(or(B_69,implies(X_68,C_70))) ),
inference(resolution,[status(thm)],[c_306,c_43]) ).
tff(c_2039,plain,
! [A_252,B_253,C_254] :
( ~ theorem(implies(A_252,B_253))
| theorem(implies(or(C_254,A_252),or(C_254,B_253))) ),
inference(resolution,[status(thm)],[c_102,c_43]) ).
tff(c_2375,plain,
! [C_276,A_277,B_278] :
( ~ theorem(or(C_276,A_277))
| theorem(or(C_276,B_278))
| ~ theorem(implies(A_277,B_278)) ),
inference(resolution,[status(thm)],[c_2039,c_16]) ).
tff(c_11181,plain,
! [B_660,B_661,X_662,C_663] :
( theorem(or(B_660,B_661))
| ~ theorem(implies(implies(X_662,C_663),B_661))
| ~ theorem(implies(X_662,or(B_660,C_663))) ),
inference(resolution,[status(thm)],[c_317,c_2375]) ).
tff(c_74456,plain,
! [B_2424,B_2425,X_2426,C_2427] :
( theorem(or(B_2424,B_2425))
| ~ theorem(implies(X_2426,or(B_2424,C_2427)))
| ~ axiom(implies(implies(X_2426,C_2427),B_2425)) ),
inference(resolution,[status(thm)],[c_14,c_11181]) ).
tff(c_74834,plain,
! [B_2428,B_2429,A_2430] :
( theorem(or(B_2428,B_2429))
| ~ axiom(implies(implies(B_2428,A_2430),B_2429)) ),
inference(resolution,[status(thm)],[c_17889,c_74456]) ).
tff(c_74880,plain,
! [A_2431,X_2432,Y_2433] : theorem(or(A_2431,implies(implies(X_2432,A_2431),implies(X_2432,Y_2433)))),
inference(resolution,[status(thm)],[c_114,c_74834]) ).
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_69,plain,
! [A_4,B_5] :
( ~ theorem(or(A_4,B_5))
| theorem(or(B_5,A_4)) ),
inference(resolution,[status(thm)],[c_6,c_52]) ).
tff(c_75562,plain,
! [X_2450,A_2451,Y_2452] : theorem(or(implies(implies(X_2450,A_2451),implies(X_2450,Y_2452)),A_2451)),
inference(resolution,[status(thm)],[c_74880,c_69]) ).
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_389,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_129,c_43]) ).
tff(c_515,plain,
! [B_107,B_108,C_109] :
( theorem(or(B_107,or(B_108,C_109)))
| ~ theorem(or(B_107,C_109)) ),
inference(resolution,[status(thm)],[c_72,c_389]) ).
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_557,plain,
! [B_113,C_114] :
( theorem(or(B_113,C_114))
| ~ theorem(or(or(B_113,C_114),C_114)) ),
inference(resolution,[status(thm)],[c_515,c_71]) ).
tff(c_596,plain,
! [X_12,Y_13] :
( theorem(or(not(X_12),Y_13))
| ~ theorem(or(implies(X_12,Y_13),Y_13)) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_557]) ).
tff(c_609,plain,
! [X_12,Y_13] :
( theorem(implies(X_12,Y_13))
| ~ theorem(or(implies(X_12,Y_13),Y_13)) ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_596]) ).
tff(c_75614,plain,
! [X_2450,Y_2452] : theorem(implies(implies(X_2450,implies(X_2450,Y_2452)),implies(X_2450,Y_2452))),
inference(resolution,[status(thm)],[c_75562,c_609]) ).
tff(c_18,plain,
~ theorem(implies(implies(p,implies(p,q)),implies(p,q))),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_85766,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_75614,c_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : LCL259-3 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.15 % 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.36 % Computer : n005.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:33:57 EDT 2023
% 0.14/0.36 % CPUTime :
% 35.73/23.95 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 35.73/23.96
% 35.73/23.96 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 35.87/24.00
% 35.87/24.00 Inference rules
% 35.87/24.00 ----------------------
% 35.87/24.00 #Ref : 0
% 35.87/24.00 #Sup : 21033
% 35.87/24.00 #Fact : 0
% 35.87/24.00 #Define : 0
% 35.87/24.00 #Split : 4
% 35.87/24.00 #Chain : 0
% 35.87/24.00 #Close : 0
% 35.87/24.00
% 35.87/24.00 Ordering : KBO
% 35.87/24.00
% 35.87/24.00 Simplification rules
% 35.87/24.00 ----------------------
% 35.87/24.00 #Subsume : 5373
% 35.87/24.00 #Demod : 4432
% 35.87/24.00 #Tautology : 3633
% 35.87/24.00 #SimpNegUnit : 604
% 35.87/24.00 #BackRed : 201
% 35.87/24.00
% 35.87/24.00 #Partial instantiations: 0
% 35.87/24.00 #Strategies tried : 1
% 35.87/24.00
% 35.87/24.00 Timing (in seconds)
% 35.87/24.00 ----------------------
% 35.87/24.00 Preprocessing : 0.42
% 35.87/24.00 Parsing : 0.22
% 35.87/24.00 CNF conversion : 0.02
% 35.87/24.00 Main loop : 22.48
% 35.87/24.00 Inferencing : 2.44
% 35.87/24.00 Reduction : 7.85
% 35.87/24.00 Demodulation : 5.90
% 35.87/24.00 BG Simplification : 0.11
% 35.87/24.00 Subsumption : 10.90
% 35.87/24.00 Abstraction : 0.15
% 35.87/24.00 MUC search : 0.00
% 35.87/24.00 Cooper : 0.00
% 35.87/24.00 Total : 22.96
% 35.87/24.00 Index Insertion : 0.00
% 35.87/24.00 Index Deletion : 0.00
% 35.87/24.00 Index Matching : 0.00
% 35.87/24.00 BG Taut test : 0.00
%------------------------------------------------------------------------------