TSTP Solution File: LCL226-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL226-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 : n029.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:43 EDT 2023
% Result : Unsatisfiable 8.41s 3.11s
% Output : CNFRefutation 8.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of formulae : 30 ( 13 unt; 8 typ; 0 def)
% Number of atoms : 34 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 28 ( 16 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 42 (; 42 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ theorem > axiom > or > implies > #nlpp > not > s > r > q
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(r,type,
r: $i ).
tff(s,type,
s: $i ).
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(implies,type,
implies: ( $i * $i ) > $i ).
tff(f_54,axiom,
! [A,B,C] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
file(unknown,unknown) ).
tff(f_61,axiom,
! [X] :
( theorem(X)
| ~ axiom(X) ),
file(unknown,unknown) ).
tff(f_56,axiom,
! [X,Y] : ( implies(X,Y) = or(not(X),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_69,axiom,
! [X,Y] :
( theorem(X)
| ~ theorem(implies(Y,X))
| ~ theorem(Y) ),
file(unknown,unknown) ).
tff(f_77,axiom,
~ theorem(implies(or(q,r),implies(or(not(r),s),or(q,s)))),
file(unknown,unknown) ).
tff(c_10,plain,
! [A_9,B_10,C_11] : axiom(implies(implies(A_9,B_10),implies(or(C_11,A_9),or(C_11,B_10)))),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_14,plain,
! [X_14] :
( ~ axiom(X_14)
| theorem(X_14) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
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_115,plain,
! [A_41,B_42,C_43] : axiom(implies(or(A_41,or(B_42,C_43)),or(B_42,or(A_41,C_43)))),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_132,plain,
! [A_41,X_12,C_43] : axiom(implies(or(A_41,or(not(X_12),C_43)),implies(X_12,or(A_41,C_43)))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_115]) ).
tff(c_469,plain,
! [A_89,X_90,C_91] : axiom(implies(or(A_89,implies(X_90,C_91)),implies(X_90,or(A_89,C_91)))),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_132]) ).
tff(c_47,plain,
! [Y_27,X_28] :
( ~ theorem(Y_27)
| ~ theorem(implies(Y_27,X_28))
| theorem(X_28) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_51,plain,
! [Y_27,X_28] :
( ~ theorem(Y_27)
| theorem(X_28)
| ~ axiom(implies(Y_27,X_28)) ),
inference(resolution,[status(thm)],[c_14,c_47]) ).
tff(c_1264,plain,
! [A_181,X_182,C_183] :
( ~ theorem(or(A_181,implies(X_182,C_183)))
| theorem(implies(X_182,or(A_181,C_183))) ),
inference(resolution,[status(thm)],[c_469,c_51]) ).
tff(c_1313,plain,
! [X_12,X_182,C_183] :
( ~ theorem(implies(X_12,implies(X_182,C_183)))
| theorem(implies(X_182,or(not(X_12),C_183))) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_1264]) ).
tff(c_4110,plain,
! [X_349,X_350,C_351] :
( ~ theorem(implies(X_349,implies(X_350,C_351)))
| theorem(implies(X_350,implies(X_349,C_351))) ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_1313]) ).
tff(c_6412,plain,
! [X_471,X_472,C_473] :
( theorem(implies(X_471,implies(X_472,C_473)))
| ~ axiom(implies(X_472,implies(X_471,C_473))) ),
inference(resolution,[status(thm)],[c_14,c_4110]) ).
tff(c_18,plain,
~ theorem(implies(or(q,r),implies(or(not(r),s),or(q,s)))),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_19,plain,
~ theorem(implies(or(q,r),implies(implies(r,s),or(q,s)))),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_18]) ).
tff(c_6452,plain,
~ axiom(implies(implies(r,s),implies(or(q,r),or(q,s)))),
inference(resolution,[status(thm)],[c_6412,c_19]) ).
tff(c_6469,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_10,c_6452]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL226-3 : TPTP v8.1.2. Released v2.3.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.13/0.35 % Computer : n029.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:52 EDT 2023
% 0.13/0.35 % CPUTime :
% 8.41/3.11 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.41/3.12
% 8.41/3.12 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 8.41/3.15
% 8.41/3.15 Inference rules
% 8.41/3.15 ----------------------
% 8.41/3.15 #Ref : 0
% 8.41/3.15 #Sup : 1536
% 8.41/3.15 #Fact : 0
% 8.41/3.15 #Define : 0
% 8.41/3.15 #Split : 2
% 8.41/3.15 #Chain : 0
% 8.41/3.15 #Close : 0
% 8.41/3.15
% 8.41/3.15 Ordering : KBO
% 8.41/3.15
% 8.41/3.15 Simplification rules
% 8.41/3.15 ----------------------
% 8.41/3.15 #Subsume : 712
% 8.41/3.15 #Demod : 98
% 8.41/3.15 #Tautology : 83
% 8.41/3.15 #SimpNegUnit : 0
% 8.41/3.15 #BackRed : 0
% 8.41/3.15
% 8.41/3.15 #Partial instantiations: 0
% 8.41/3.15 #Strategies tried : 1
% 8.41/3.15
% 8.41/3.15 Timing (in seconds)
% 8.41/3.15 ----------------------
% 8.41/3.16 Preprocessing : 0.44
% 8.41/3.16 Parsing : 0.23
% 8.41/3.16 CNF conversion : 0.02
% 8.41/3.16 Main loop : 1.56
% 8.41/3.16 Inferencing : 0.59
% 8.41/3.16 Reduction : 0.38
% 8.41/3.16 Demodulation : 0.24
% 8.41/3.16 BG Simplification : 0.03
% 8.41/3.16 Subsumption : 0.45
% 8.41/3.16 Abstraction : 0.04
% 8.41/3.16 MUC search : 0.00
% 8.41/3.16 Cooper : 0.00
% 8.41/3.16 Total : 2.05
% 8.41/3.16 Index Insertion : 0.00
% 8.41/3.16 Index Deletion : 0.00
% 8.41/3.16 Index Matching : 0.00
% 8.41/3.16 BG Taut test : 0.00
%------------------------------------------------------------------------------