TSTP Solution File: LCL155-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL155-1 : TPTP v8.1.2. Released v1.0.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 : n009.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:29 EDT 2023
% Result : Unsatisfiable 4.81s 2.21s
% Output : CNFRefutation 4.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 18
% Syntax : Number of formulae : 52 ( 43 unt; 9 typ; 0 def)
% Number of atoms : 43 ( 42 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 11 ( 6 >; 5 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 55 (; 55 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ xor > or > implies > and_star > and > #nlpp > not > x > truth > falsehood
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(truth,type,
truth: $i ).
tff(x,type,
x: $i ).
tff(falsehood,type,
falsehood: $i ).
tff(xor,type,
xor: ( $i * $i ) > $i ).
tff(or,type,
or: ( $i * $i ) > $i ).
tff(not,type,
not: $i > $i ).
tff(and_star,type,
and_star: ( $i * $i ) > $i ).
tff(and,type,
and: ( $i * $i ) > $i ).
tff(implies,type,
implies: ( $i * $i ) > $i ).
tff(f_48,axiom,
! [X] : ( implies(truth,X) = X ),
file(unknown,unknown) ).
tff(f_81,axiom,
! [X,Y] : ( or(X,Y) = implies(not(X),Y) ),
file(unknown,unknown) ).
tff(f_50,axiom,
! [X,Y,Z] : ( implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))) = truth ),
file(unknown,unknown) ).
tff(f_85,axiom,
! [X,Y] : ( or(X,Y) = or(Y,X) ),
file(unknown,unknown) ).
tff(f_129,axiom,
not(truth) = falsehood,
file(unknown,unknown) ).
tff(f_54,axiom,
! [X,Y] : ( implies(implies(not(X),not(Y)),implies(Y,X)) = truth ),
file(unknown,unknown) ).
tff(f_87,axiom,
! [X,Y] : ( and(X,Y) = not(or(not(X),not(Y))) ),
file(unknown,unknown) ).
tff(f_118,axiom,
! [X,Y] : ( xor(X,Y) = or(and(X,not(Y)),and(not(X),Y)) ),
file(unknown,unknown) ).
tff(f_133,axiom,
xor(x,x) != falsehood,
file(unknown,unknown) ).
tff(c_2,plain,
! [X_1] : ( implies(truth,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_10,plain,
! [X_9,Y_10] : ( implies(not(X_9),Y_10) = or(X_9,Y_10) ),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_917,plain,
! [X_68,Y_69,Z_70] : ( implies(implies(X_68,Y_69),implies(implies(Y_69,Z_70),implies(X_68,Z_70))) = truth ),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_1068,plain,
! [X_1,Z_70] : ( implies(X_1,implies(implies(X_1,Z_70),implies(truth,Z_70))) = truth ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_917]) ).
tff(c_1096,plain,
! [X_71,Z_72] : ( implies(X_71,implies(implies(X_71,Z_72),Z_72)) = truth ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_1068]) ).
tff(c_1134,plain,
! [Z_72] : ( implies(implies(truth,Z_72),Z_72) = truth ),
inference(superposition,[status(thm),theory(equality)],[c_1096,c_2]) ).
tff(c_1218,plain,
! [Z_73] : ( implies(Z_73,Z_73) = truth ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_1134]) ).
tff(c_1345,plain,
! [X_76] : ( or(X_76,not(X_76)) = truth ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_1218]) ).
tff(c_14,plain,
! [Y_15,X_14] : ( or(Y_15,X_14) = or(X_14,Y_15) ),
inference(cnfTransformation,[status(thm)],[f_85]) ).
tff(c_32,plain,
not(truth) = falsehood,
inference(cnfTransformation,[status(thm)],[f_129]) ).
tff(c_8,plain,
! [X_7,Y_8] : ( implies(implies(not(X_7),not(Y_8)),implies(Y_8,X_7)) = truth ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_303,plain,
! [X_50,Y_51] : ( implies(or(X_50,not(Y_51)),implies(Y_51,X_50)) = truth ),
inference(demodulation,[status(thm),theory(equality)],[c_10,c_8]) ).
tff(c_337,plain,
! [X_1] : ( implies(or(X_1,not(truth)),X_1) = truth ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_303]) ).
tff(c_345,plain,
! [X_52] : ( implies(or(X_52,falsehood),X_52) = truth ),
inference(demodulation,[status(thm),theory(equality)],[c_32,c_337]) ).
tff(c_360,plain,
! [X_14] : ( implies(or(falsehood,X_14),X_14) = truth ),
inference(superposition,[status(thm),theory(equality)],[c_14,c_345]) ).
tff(c_1370,plain,
implies(truth,not(falsehood)) = truth,
inference(superposition,[status(thm),theory(equality)],[c_1345,c_360]) ).
tff(c_1094,plain,
! [X_1,Z_70] : ( implies(X_1,implies(implies(X_1,Z_70),Z_70)) = truth ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_1068]) ).
tff(c_1615,plain,
implies(truth,implies(truth,not(falsehood))) = truth,
inference(superposition,[status(thm),theory(equality)],[c_1370,c_1094]) ).
tff(c_1645,plain,
not(falsehood) = truth,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_1615]) ).
tff(c_1698,plain,
! [Y_10] : ( or(falsehood,Y_10) = implies(truth,Y_10) ),
inference(superposition,[status(thm),theory(equality)],[c_1645,c_10]) ).
tff(c_1713,plain,
! [Y_10] : ( or(falsehood,Y_10) = Y_10 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_1698]) ).
tff(c_16,plain,
! [X_16,Y_17] : ( not(or(not(X_16),not(Y_17))) = and(X_16,Y_17) ),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_1381,plain,
! [X_16] : ( and(X_16,not(X_16)) = not(truth) ),
inference(superposition,[status(thm),theory(equality)],[c_1345,c_16]) ).
tff(c_1420,plain,
! [X_16] : ( and(X_16,not(X_16)) = falsehood ),
inference(demodulation,[status(thm),theory(equality)],[c_32,c_1381]) ).
tff(c_196,plain,
! [X_46,Y_47] : ( not(or(not(X_46),not(Y_47))) = and(X_46,Y_47) ),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_220,plain,
! [Y_47,X_46] : ( not(or(not(Y_47),not(X_46))) = and(X_46,Y_47) ),
inference(superposition,[status(thm),theory(equality)],[c_14,c_196]) ).
tff(c_1355,plain,
! [Y_47] : ( and(not(Y_47),Y_47) = not(truth) ),
inference(superposition,[status(thm),theory(equality)],[c_1345,c_220]) ).
tff(c_1556,plain,
! [Y_78] : ( and(not(Y_78),Y_78) = falsehood ),
inference(demodulation,[status(thm),theory(equality)],[c_32,c_1355]) ).
tff(c_22,plain,
! [X_23,Y_24] : ( or(and(X_23,not(Y_24)),and(not(X_23),Y_24)) = xor(X_23,Y_24) ),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_1565,plain,
! [Y_78] : ( or(and(Y_78,not(Y_78)),falsehood) = xor(Y_78,Y_78) ),
inference(superposition,[status(thm),theory(equality)],[c_1556,c_22]) ).
tff(c_1605,plain,
! [Y_78] : ( xor(Y_78,Y_78) = or(falsehood,falsehood) ),
inference(demodulation,[status(thm),theory(equality)],[c_1420,c_1565]) ).
tff(c_3144,plain,
! [Y_78] : ( xor(Y_78,Y_78) = falsehood ),
inference(demodulation,[status(thm),theory(equality)],[c_1713,c_1605]) ).
tff(c_34,plain,
xor(x,x) != falsehood,
inference(cnfTransformation,[status(thm)],[f_133]) ).
tff(c_3147,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_3144,c_34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL155-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % 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.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 3 13:54:23 EDT 2023
% 0.12/0.34 % CPUTime :
% 4.81/2.21 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.81/2.22
% 4.81/2.22 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.81/2.25
% 4.81/2.25 Inference rules
% 4.81/2.25 ----------------------
% 4.81/2.25 #Ref : 0
% 4.81/2.25 #Sup : 800
% 4.81/2.25 #Fact : 0
% 4.81/2.25 #Define : 0
% 4.81/2.25 #Split : 0
% 4.81/2.25 #Chain : 0
% 4.81/2.25 #Close : 0
% 4.81/2.25
% 4.81/2.25 Ordering : KBO
% 4.81/2.25
% 4.81/2.25 Simplification rules
% 4.81/2.25 ----------------------
% 4.81/2.25 #Subsume : 12
% 4.81/2.25 #Demod : 597
% 4.81/2.25 #Tautology : 437
% 4.81/2.25 #SimpNegUnit : 0
% 4.81/2.25 #BackRed : 11
% 4.81/2.25
% 4.81/2.25 #Partial instantiations: 0
% 4.81/2.25 #Strategies tried : 1
% 4.81/2.25
% 4.81/2.25 Timing (in seconds)
% 4.81/2.25 ----------------------
% 4.81/2.25 Preprocessing : 0.46
% 4.81/2.25 Parsing : 0.24
% 4.81/2.25 CNF conversion : 0.02
% 4.81/2.25 Main loop : 0.74
% 4.81/2.25 Inferencing : 0.22
% 4.81/2.25 Reduction : 0.31
% 4.81/2.25 Demodulation : 0.26
% 4.81/2.25 BG Simplification : 0.03
% 4.81/2.25 Subsumption : 0.12
% 4.81/2.25 Abstraction : 0.03
% 4.81/2.25 MUC search : 0.00
% 4.81/2.25 Cooper : 0.00
% 4.81/2.26 Total : 1.25
% 4.81/2.26 Index Insertion : 0.00
% 4.81/2.26 Index Deletion : 0.00
% 4.81/2.26 Index Matching : 0.00
% 4.81/2.26 BG Taut test : 0.00
%------------------------------------------------------------------------------