TSTP Solution File: LCL239-10 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL239-10 : TPTP v8.1.2. Released v7.5.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 : n024.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:47 EDT 2023
% Result : Unsatisfiable 14.81s 5.01s
% Output : CNFRefutation 14.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 19
% Syntax : Number of formulae : 61 ( 52 unt; 9 typ; 0 def)
% Number of atoms : 52 ( 51 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 13 ( 7 >; 6 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-4 aty)
% Number of variables : 90 (; 90 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ ifeq > or > implies > and > #nlpp > theorem > not > axiom > true > p
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(axiom,type,
axiom: $i > $i ).
tff(or,type,
or: ( $i * $i ) > $i ).
tff(not,type,
not: $i > $i ).
tff(theorem,type,
theorem: $i > $i ).
tff(true,type,
true: $i ).
tff(and,type,
and: ( $i * $i ) > $i ).
tff(p,type,
p: $i ).
tff(implies,type,
implies: ( $i * $i ) > $i ).
tff(ifeq,type,
ifeq: ( $i * $i * $i * $i ) > $i ).
tff(f_24,axiom,
! [A,B,C] : ( ifeq(A,A,B,C) = B ),
file(unknown,unknown) ).
tff(f_36,axiom,
! [X,Y] : ( implies(X,Y) = or(not(X),Y) ),
file(unknown,unknown) ).
tff(f_42,axiom,
! [P,Q] : ( and(P,Q) = not(or(not(P),not(Q))) ),
file(unknown,unknown) ).
tff(f_30,axiom,
! [A,B] : ( axiom(implies(or(A,B),or(B,A))) = true ),
file(unknown,unknown) ).
tff(f_38,axiom,
! [X] : ( ifeq(axiom(X),true,theorem(X),true) = true ),
file(unknown,unknown) ).
tff(f_32,axiom,
! [A,B,C] : ( axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true ),
file(unknown,unknown) ).
tff(f_28,axiom,
! [A,B] : ( axiom(implies(A,or(B,A))) = true ),
file(unknown,unknown) ).
tff(f_40,axiom,
! [Y,X] : ( ifeq(theorem(implies(Y,X)),true,ifeq(theorem(Y),true,theorem(X),true),true) = true ),
file(unknown,unknown) ).
tff(f_26,axiom,
! [A] : ( axiom(implies(or(A,A),A)) = true ),
file(unknown,unknown) ).
tff(f_44,axiom,
theorem(not(and(p,not(p)))) != true,
file(unknown,unknown) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( ifeq(A_1,A_1,B_2,C_3) = B_2 ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_14,plain,
! [X_15,Y_16] : ( or(not(X_15),Y_16) = implies(X_15,Y_16) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_20,plain,
! [P_20,Q_21] : ( not(or(not(P_20),not(Q_21))) = and(P_20,Q_21) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_23,plain,
! [P_20,Q_21] : ( not(implies(P_20,not(Q_21))) = and(P_20,Q_21) ),
inference(demodulation,[status(thm),theory(equality)],[c_14,c_20]) ).
tff(c_104,plain,
! [A_35,B_36] : ( axiom(implies(or(A_35,B_36),or(B_36,A_35))) = true ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_16,plain,
! [X_17] : ( ifeq(axiom(X_17),true,theorem(X_17),true) = true ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_705,plain,
! [A_87,B_88] : ( ifeq(true,true,theorem(implies(or(A_87,B_88),or(B_88,A_87))),true) = true ),
inference(superposition,[status(thm),theory(equality)],[c_104,c_16]) ).
tff(c_726,plain,
! [A_89,B_90] : ( theorem(implies(or(A_89,B_90),or(B_90,A_89))) = true ),
inference(superposition,[status(thm),theory(equality)],[c_705,c_2]) ).
tff(c_745,plain,
! [X_15,Y_16] : ( theorem(implies(implies(X_15,Y_16),or(Y_16,not(X_15)))) = true ),
inference(superposition,[status(thm),theory(equality)],[c_14,c_726]) ).
tff(c_224,plain,
! [A_47,B_48,C_49] : ( axiom(implies(or(A_47,or(B_48,C_49)),or(B_48,or(A_47,C_49)))) = true ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_928,plain,
! [A_103,B_104,C_105] : ( ifeq(true,true,theorem(implies(or(A_103,or(B_104,C_105)),or(B_104,or(A_103,C_105)))),true) = true ),
inference(superposition,[status(thm),theory(equality)],[c_224,c_16]) ).
tff(c_945,plain,
! [X_15,B_104,Y_16] : ( ifeq(true,true,theorem(implies(or(not(X_15),or(B_104,Y_16)),or(B_104,implies(X_15,Y_16)))),true) = true ),
inference(superposition,[status(thm),theory(equality)],[c_14,c_928]) ).
tff(c_957,plain,
! [X_15,B_104,Y_16] : ( theorem(implies(implies(X_15,or(B_104,Y_16)),or(B_104,implies(X_15,Y_16)))) = true ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_14,c_945]) ).
tff(c_6,plain,
! [A_5,B_6] : ( axiom(implies(A_5,or(B_6,A_5))) = true ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_63,plain,
! [X_30] : ( ifeq(axiom(X_30),true,theorem(X_30),true) = true ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_272,plain,
! [A_51,B_52] : ( ifeq(true,true,theorem(implies(A_51,or(B_52,A_51))),true) = true ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_63]) ).
tff(c_317,plain,
! [A_55,B_56] : ( theorem(implies(A_55,or(B_56,A_55))) = true ),
inference(superposition,[status(thm),theory(equality)],[c_272,c_2]) ).
tff(c_18,plain,
! [Y_18,X_19] : ( ifeq(theorem(implies(Y_18,X_19)),true,ifeq(theorem(Y_18),true,theorem(X_19),true),true) = true ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_325,plain,
! [A_55,B_56,X_19] : ( ifeq(theorem(implies(implies(A_55,or(B_56,A_55)),X_19)),true,ifeq(true,true,theorem(X_19),true),true) = true ),
inference(superposition,[status(thm),theory(equality)],[c_317,c_18]) ).
tff(c_7669,plain,
! [A_331,B_332,X_333] : ( ifeq(theorem(implies(implies(A_331,or(B_332,A_331)),X_333)),true,theorem(X_333),true) = true ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_325]) ).
tff(c_8139,plain,
! [B_338,Y_339] : ( ifeq(true,true,theorem(or(B_338,implies(Y_339,Y_339))),true) = true ),
inference(superposition,[status(thm),theory(equality)],[c_957,c_7669]) ).
tff(c_8202,plain,
! [B_340,Y_341] : ( theorem(or(B_340,implies(Y_341,Y_341))) = true ),
inference(superposition,[status(thm),theory(equality)],[c_8139,c_2]) ).
tff(c_4,plain,
! [A_4] : ( axiom(implies(or(A_4,A_4),A_4)) = true ),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_190,plain,
! [A_45] : ( ifeq(true,true,theorem(implies(or(A_45,A_45),A_45)),true) = true ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_63]) ).
tff(c_195,plain,
! [A_45] : ( theorem(implies(or(A_45,A_45),A_45)) = true ),
inference(superposition,[status(thm),theory(equality)],[c_190,c_2]) ).
tff(c_288,plain,
! [Y_53,X_54] : ( ifeq(theorem(implies(Y_53,X_54)),true,ifeq(theorem(Y_53),true,theorem(X_54),true),true) = true ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_1471,plain,
! [A_142] : ( ifeq(true,true,ifeq(theorem(or(A_142,A_142)),true,theorem(A_142),true),true) = true ),
inference(superposition,[status(thm),theory(equality)],[c_195,c_288]) ).
tff(c_1476,plain,
! [A_142] : ( ifeq(theorem(or(A_142,A_142)),true,theorem(A_142),true) = true ),
inference(superposition,[status(thm),theory(equality)],[c_1471,c_2]) ).
tff(c_8517,plain,
! [Y_344] : ( ifeq(true,true,theorem(implies(Y_344,Y_344)),true) = true ),
inference(superposition,[status(thm),theory(equality)],[c_8202,c_1476]) ).
tff(c_8632,plain,
! [Y_345] : ( theorem(implies(Y_345,Y_345)) = true ),
inference(superposition,[status(thm),theory(equality)],[c_8517,c_2]) ).
tff(c_8747,plain,
! [Y_345,X_19] : ( ifeq(theorem(implies(implies(Y_345,Y_345),X_19)),true,ifeq(true,true,theorem(X_19),true),true) = true ),
inference(superposition,[status(thm),theory(equality)],[c_8632,c_18]) ).
tff(c_11219,plain,
! [Y_386,X_387] : ( ifeq(theorem(implies(implies(Y_386,Y_386),X_387)),true,theorem(X_387),true) = true ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_8747]) ).
tff(c_11691,plain,
! [Y_388] : ( ifeq(true,true,theorem(or(Y_388,not(Y_388))),true) = true ),
inference(superposition,[status(thm),theory(equality)],[c_745,c_11219]) ).
tff(c_11723,plain,
! [Y_389] : ( theorem(or(Y_389,not(Y_389))) = true ),
inference(superposition,[status(thm),theory(equality)],[c_11691,c_2]) ).
tff(c_11789,plain,
! [X_15] : ( theorem(implies(X_15,not(not(X_15)))) = true ),
inference(superposition,[status(thm),theory(equality)],[c_14,c_11723]) ).
tff(c_11764,plain,
! [Y_389,X_19] : ( ifeq(theorem(implies(or(Y_389,not(Y_389)),X_19)),true,ifeq(true,true,theorem(X_19),true),true) = true ),
inference(superposition,[status(thm),theory(equality)],[c_11723,c_18]) ).
tff(c_34126,plain,
! [Y_633,X_634] : ( ifeq(theorem(implies(or(Y_633,not(Y_633)),X_634)),true,theorem(X_634),true) = true ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_11764]) ).
tff(c_34906,plain,
! [Y_635] : ( ifeq(true,true,theorem(not(not(or(Y_635,not(Y_635))))),true) = true ),
inference(superposition,[status(thm),theory(equality)],[c_11789,c_34126]) ).
tff(c_34934,plain,
! [X_15] : ( ifeq(true,true,theorem(not(not(implies(X_15,not(not(X_15)))))),true) = true ),
inference(superposition,[status(thm),theory(equality)],[c_14,c_34906]) ).
tff(c_34941,plain,
! [X_15] : ( theorem(not(and(X_15,not(X_15)))) = true ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_23,c_34934]) ).
tff(c_22,plain,
theorem(not(and(p,not(p)))) != true,
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_34944,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_34941,c_22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL239-10 : TPTP v8.1.2. Released v7.5.0.
% 0.07/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.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 14:13:15 EDT 2023
% 0.13/0.36 % CPUTime :
% 14.81/5.01 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.81/5.02
% 14.81/5.02 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 14.81/5.05
% 14.81/5.05 Inference rules
% 14.81/5.05 ----------------------
% 14.81/5.05 #Ref : 0
% 14.81/5.05 #Sup : 8810
% 14.81/5.05 #Fact : 0
% 14.81/5.05 #Define : 0
% 14.81/5.05 #Split : 0
% 14.81/5.05 #Chain : 0
% 14.81/5.05 #Close : 0
% 14.81/5.05
% 14.81/5.05 Ordering : KBO
% 14.81/5.05
% 14.81/5.05 Simplification rules
% 14.81/5.05 ----------------------
% 14.81/5.05 #Subsume : 0
% 14.81/5.05 #Demod : 6364
% 14.81/5.05 #Tautology : 7353
% 14.81/5.05 #SimpNegUnit : 0
% 14.81/5.05 #BackRed : 30
% 14.81/5.05
% 14.81/5.05 #Partial instantiations: 0
% 14.81/5.05 #Strategies tried : 1
% 14.81/5.05
% 14.81/5.05 Timing (in seconds)
% 14.81/5.05 ----------------------
% 14.81/5.05 Preprocessing : 0.44
% 14.81/5.05 Parsing : 0.25
% 14.81/5.05 CNF conversion : 0.02
% 14.81/5.05 Main loop : 3.52
% 14.81/5.05 Inferencing : 0.80
% 14.81/5.05 Reduction : 1.85
% 14.81/5.05 Demodulation : 1.61
% 14.81/5.05 BG Simplification : 0.06
% 14.81/5.06 Subsumption : 0.62
% 14.81/5.06 Abstraction : 0.06
% 14.81/5.06 MUC search : 0.00
% 14.81/5.06 Cooper : 0.00
% 14.81/5.06 Total : 4.02
% 14.81/5.06 Index Insertion : 0.00
% 14.81/5.06 Index Deletion : 0.00
% 14.81/5.06 Index Matching : 0.00
% 14.81/5.06 BG Taut test : 0.00
%------------------------------------------------------------------------------