TSTP Solution File: LCL138-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL138-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:27 EDT 2023
% Result : Unsatisfiable 17.66s 8.31s
% Output : CNFRefutation 17.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 25 ( 19 unt; 6 typ; 0 def)
% Number of atoms : 19 ( 18 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 44 (; 44 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ implies > #nlpp > not > z > y > x > truth
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(truth,type,
truth: $i ).
tff(x,type,
x: $i ).
tff(y,type,
y: $i ).
tff(not,type,
not: $i > $i ).
tff(z,type,
z: $i ).
tff(implies,type,
implies: ( $i * $i ) > $i ).
tff(f_47,axiom,
! [X] : ( implies(truth,X) = X ),
file(unknown,unknown) ).
tff(f_49,axiom,
! [X,Y,Z] : ( implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))) = truth ),
file(unknown,unknown) ).
tff(f_51,axiom,
! [X,Y] : ( implies(implies(X,Y),Y) = implies(implies(Y,X),X) ),
file(unknown,unknown) ).
tff(f_57,axiom,
implies(x,implies(y,z)) != implies(y,implies(x,z)),
file(unknown,unknown) ).
tff(c_2,plain,
! [X_1] : ( implies(truth,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_187,plain,
! [X_17,Y_18,Z_19] : ( implies(implies(X_17,Y_18),implies(implies(Y_18,Z_19),implies(X_17,Z_19))) = truth ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_4,plain,
! [X_2,Y_3,Z_4] : ( implies(implies(X_2,Y_3),implies(implies(Y_3,Z_4),implies(X_2,Z_4))) = truth ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_21190,plain,
! [Y_150,Z_151,X_152,Z_153] : ( implies(truth,implies(implies(implies(implies(Y_150,Z_151),implies(X_152,Z_151)),Z_153),implies(implies(X_152,Y_150),Z_153))) = truth ),
inference(superposition,[status(thm),theory(equality)],[c_187,c_4]) ).
tff(c_22066,plain,
! [Y_150,X_1,Z_153] : ( implies(truth,implies(implies(implies(implies(Y_150,X_1),X_1),Z_153),implies(implies(truth,Y_150),Z_153))) = truth ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_21190]) ).
tff(c_56244,plain,
! [Y_253,X_254,Z_255] : ( implies(implies(implies(implies(Y_253,X_254),X_254),Z_255),implies(Y_253,Z_255)) = truth ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_22066]) ).
tff(c_190,plain,
! [Y_18,Z_19,X_17,Z_4] : ( implies(truth,implies(implies(implies(implies(Y_18,Z_19),implies(X_17,Z_19)),Z_4),implies(implies(X_17,Y_18),Z_4))) = truth ),
inference(superposition,[status(thm),theory(equality)],[c_187,c_4]) ).
tff(c_56435,plain,
! [X_17,Y_253,X_254] : ( implies(truth,implies(truth,implies(implies(X_17,implies(Y_253,X_254)),implies(Y_253,implies(X_17,X_254))))) = truth ),
inference(superposition,[status(thm),theory(equality)],[c_56244,c_190]) ).
tff(c_57405,plain,
! [X_17,Y_253,X_254] : ( implies(implies(X_17,implies(Y_253,X_254)),implies(Y_253,implies(X_17,X_254))) = truth ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_56435]) ).
tff(c_90188,plain,
! [X_323,Y_324,X_325] : ( implies(implies(X_323,implies(Y_324,X_325)),implies(Y_324,implies(X_323,X_325))) = truth ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_56435]) ).
tff(c_6,plain,
! [Y_6,X_5] : ( implies(implies(Y_6,X_5),X_5) = implies(implies(X_5,Y_6),Y_6) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_90693,plain,
! [Y_324,X_323,X_325] : ( implies(implies(implies(Y_324,implies(X_323,X_325)),implies(X_323,implies(Y_324,X_325))),implies(X_323,implies(Y_324,X_325))) = implies(truth,implies(Y_324,implies(X_323,X_325))) ),
inference(superposition,[status(thm),theory(equality)],[c_90188,c_6]) ).
tff(c_92067,plain,
! [Y_324,X_323,X_325] : ( implies(Y_324,implies(X_323,X_325)) = implies(X_323,implies(Y_324,X_325)) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_57405,c_2,c_90693]) ).
tff(c_10,plain,
implies(y,implies(x,z)) != implies(x,implies(y,z)),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_92438,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_92067,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL138-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.14/0.34 % Computer : n009.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 13:37:53 EDT 2023
% 0.14/0.34 % CPUTime :
% 17.66/8.31 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 17.71/8.31
% 17.71/8.31 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 17.71/8.34
% 17.71/8.34 Inference rules
% 17.71/8.34 ----------------------
% 17.71/8.34 #Ref : 0
% 17.71/8.34 #Sup : 22814
% 17.71/8.34 #Fact : 0
% 17.71/8.34 #Define : 0
% 17.71/8.34 #Split : 0
% 17.71/8.34 #Chain : 0
% 17.71/8.34 #Close : 0
% 17.71/8.34
% 17.71/8.34 Ordering : KBO
% 17.71/8.34
% 17.71/8.34 Simplification rules
% 17.71/8.34 ----------------------
% 17.71/8.34 #Subsume : 12
% 17.71/8.34 #Demod : 33073
% 17.71/8.34 #Tautology : 17295
% 17.71/8.34 #SimpNegUnit : 0
% 17.71/8.34 #BackRed : 27
% 17.71/8.34
% 17.71/8.34 #Partial instantiations: 0
% 17.71/8.34 #Strategies tried : 1
% 17.71/8.34
% 17.71/8.34 Timing (in seconds)
% 17.71/8.34 ----------------------
% 17.71/8.34 Preprocessing : 0.42
% 17.71/8.34 Parsing : 0.22
% 17.71/8.34 CNF conversion : 0.02
% 17.71/8.34 Main loop : 6.78
% 17.71/8.34 Inferencing : 0.97
% 17.71/8.34 Reduction : 4.43
% 17.71/8.34 Demodulation : 4.16
% 17.71/8.34 BG Simplification : 0.08
% 17.71/8.34 Subsumption : 0.98
% 17.78/8.34 Abstraction : 0.14
% 17.78/8.34 MUC search : 0.00
% 17.78/8.34 Cooper : 0.00
% 17.78/8.34 Total : 7.24
% 17.78/8.34 Index Insertion : 0.00
% 17.78/8.34 Index Deletion : 0.00
% 17.78/8.34 Index Matching : 0.00
% 17.78/8.34 BG Taut test : 0.00
%------------------------------------------------------------------------------