TSTP Solution File: LCL135-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL135-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/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 : n015.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 3.12s 1.82s
% Output : CNFRefutation 3.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 25 ( 20 unt; 5 typ; 0 def)
% Number of atoms : 20 ( 19 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 : 4 ( 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 30 (; 30 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ implies > #nlpp > not > 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(implies,type,
implies: ( $i * $i ) > $i ).
tff(f_51,axiom,
! [X] : ( implies(truth,X) = X ),
file(unknown,unknown) ).
tff(f_53,axiom,
! [X,Y,Z] : ( implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))) = truth ),
file(unknown,unknown) ).
tff(f_55,axiom,
! [X,Y] : ( implies(implies(X,Y),Y) = implies(implies(Y,X),X) ),
file(unknown,unknown) ).
tff(f_61,axiom,
implies(x,implies(y,x)) != truth,
file(unknown,unknown) ).
tff(c_2,plain,
! [X_1] : ( implies(truth,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_91,plain,
! [X_15,Y_16,Z_17] : ( implies(implies(X_15,Y_16),implies(implies(Y_16,Z_17),implies(X_15,Z_17))) = truth ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_183,plain,
! [Y_16,X_1] : ( implies(implies(truth,Y_16),implies(implies(Y_16,X_1),X_1)) = truth ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_91]) ).
tff(c_327,plain,
! [Y_20,X_21] : ( implies(Y_20,implies(implies(Y_20,X_21),X_21)) = truth ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_183]) ).
tff(c_358,plain,
! [X_21] : ( implies(implies(truth,X_21),X_21) = truth ),
inference(superposition,[status(thm),theory(equality)],[c_327,c_2]) ).
tff(c_416,plain,
! [X_21] : ( implies(X_21,X_21) = truth ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_358]) ).
tff(c_46,plain,
! [Y_13,X_14] : ( implies(implies(Y_13,X_14),X_14) = implies(implies(X_14,Y_13),Y_13) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_79,plain,
! [X_1] : ( implies(implies(X_1,truth),truth) = implies(X_1,X_1) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_46]) ).
tff(c_480,plain,
! [X_23] : ( implies(implies(X_23,truth),truth) = truth ),
inference(demodulation,[status(thm),theory(equality)],[c_416,c_79]) ).
tff(c_193,plain,
! [Y_16,X_1] : ( implies(Y_16,implies(implies(Y_16,X_1),X_1)) = truth ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_183]) ).
tff(c_566,plain,
! [X_24] : ( implies(X_24,truth) = truth ),
inference(superposition,[status(thm),theory(equality)],[c_480,c_193]) ).
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_53]) ).
tff(c_580,plain,
! [Z_4,X_24] : ( implies(truth,implies(implies(truth,Z_4),implies(X_24,Z_4))) = truth ),
inference(superposition,[status(thm),theory(equality)],[c_566,c_4]) ).
tff(c_635,plain,
! [Z_4,X_24] : ( implies(Z_4,implies(X_24,Z_4)) = truth ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_580]) ).
tff(c_10,plain,
implies(x,implies(y,x)) != truth,
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_654,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_635,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL135-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14 % 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 : n015.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:54:29 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.12/1.82 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.12/1.83
% 3.12/1.83 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.34/1.86
% 3.34/1.86 Inference rules
% 3.34/1.86 ----------------------
% 3.34/1.86 #Ref : 0
% 3.34/1.86 #Sup : 168
% 3.34/1.86 #Fact : 0
% 3.34/1.86 #Define : 0
% 3.34/1.86 #Split : 0
% 3.34/1.86 #Chain : 0
% 3.34/1.86 #Close : 0
% 3.34/1.86
% 3.34/1.86 Ordering : KBO
% 3.34/1.86
% 3.34/1.86 Simplification rules
% 3.34/1.86 ----------------------
% 3.34/1.86 #Subsume : 1
% 3.34/1.86 #Demod : 122
% 3.34/1.86 #Tautology : 93
% 3.34/1.86 #SimpNegUnit : 0
% 3.34/1.86 #BackRed : 2
% 3.34/1.86
% 3.34/1.86 #Partial instantiations: 0
% 3.34/1.86 #Strategies tried : 1
% 3.34/1.86
% 3.34/1.86 Timing (in seconds)
% 3.34/1.86 ----------------------
% 3.34/1.87 Preprocessing : 0.41
% 3.34/1.87 Parsing : 0.22
% 3.34/1.87 CNF conversion : 0.02
% 3.34/1.87 Main loop : 0.37
% 3.34/1.87 Inferencing : 0.14
% 3.34/1.87 Reduction : 0.13
% 3.34/1.87 Demodulation : 0.10
% 3.34/1.87 BG Simplification : 0.02
% 3.34/1.87 Subsumption : 0.06
% 3.34/1.87 Abstraction : 0.02
% 3.34/1.87 MUC search : 0.00
% 3.34/1.87 Cooper : 0.00
% 3.34/1.87 Total : 0.84
% 3.34/1.87 Index Insertion : 0.00
% 3.34/1.87 Index Deletion : 0.00
% 3.34/1.87 Index Matching : 0.00
% 3.34/1.87 BG Taut test : 0.00
%------------------------------------------------------------------------------