TSTP Solution File: LCL185-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL185-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/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 : n012.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:35 EDT 2023
% Result : Unsatisfiable 13.18s 4.73s
% Output : CNFRefutation 13.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of formulae : 32 ( 14 unt; 7 typ; 0 def)
% Number of atoms : 43 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 20 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 51 (; 51 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ theorem > axiom > or > implies > #nlpp > not > q > p
%Foreground sorts:
%Background operators:
%Foreground operators:
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(p,type,
p: $i ).
tff(implies,type,
implies: ( $i * $i ) > $i ).
tff(f_50,axiom,
! [A,B] : axiom(implies(or(A,B),or(B,A))),
file(unknown,unknown) ).
tff(f_48,axiom,
! [A,B] : axiom(implies(A,or(B,A))),
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_54,axiom,
! [A,B,C] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
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(p,or(p,q))),
file(unknown,unknown) ).
tff(c_6,plain,
! [A_4,B_5] : axiom(implies(or(A_4,B_5),or(B_5,A_4))),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_4,plain,
! [A_2,B_3] : axiom(implies(A_2,or(B_3,A_2))),
inference(cnfTransformation,[status(thm)],[f_48]) ).
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_113,plain,
! [A_37,B_38,C_39] : axiom(implies(implies(A_37,B_38),implies(or(C_39,A_37),or(C_39,B_38)))),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_122,plain,
! [A_37,Y_13,X_12] : axiom(implies(implies(A_37,Y_13),implies(or(not(X_12),A_37),implies(X_12,Y_13)))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_113]) ).
tff(c_310,plain,
! [A_68,Y_69,X_70] : axiom(implies(implies(A_68,Y_69),implies(implies(X_70,A_68),implies(X_70,Y_69)))),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_122]) ).
tff(c_50,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_54,plain,
! [Y_27,X_28] :
( ~ theorem(Y_27)
| theorem(X_28)
| ~ axiom(implies(Y_27,X_28)) ),
inference(resolution,[status(thm)],[c_14,c_50]) ).
tff(c_1154,plain,
! [A_175,Y_176,X_177] :
( ~ theorem(implies(A_175,Y_176))
| theorem(implies(implies(X_177,A_175),implies(X_177,Y_176))) ),
inference(resolution,[status(thm)],[c_310,c_54]) ).
tff(c_16,plain,
! [Y_16,X_15] :
( ~ theorem(Y_16)
| ~ theorem(implies(Y_16,X_15))
| theorem(X_15) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_4839,plain,
! [X_401,A_402,Y_403] :
( ~ theorem(implies(X_401,A_402))
| theorem(implies(X_401,Y_403))
| ~ theorem(implies(A_402,Y_403)) ),
inference(resolution,[status(thm)],[c_1154,c_16]) ).
tff(c_6457,plain,
! [X_504,Y_505,A_506] :
( theorem(implies(X_504,Y_505))
| ~ theorem(implies(A_506,Y_505))
| ~ axiom(implies(X_504,A_506)) ),
inference(resolution,[status(thm)],[c_14,c_4839]) ).
tff(c_16931,plain,
! [X_888,Y_889,A_890] :
( theorem(implies(X_888,Y_889))
| ~ axiom(implies(X_888,A_890))
| ~ axiom(implies(A_890,Y_889)) ),
inference(resolution,[status(thm)],[c_14,c_6457]) ).
tff(c_18116,plain,
! [A_917,Y_918,B_919] :
( theorem(implies(A_917,Y_918))
| ~ axiom(implies(or(B_919,A_917),Y_918)) ),
inference(resolution,[status(thm)],[c_4,c_16931]) ).
tff(c_18146,plain,
! [B_5,A_4] : theorem(implies(B_5,or(B_5,A_4))),
inference(resolution,[status(thm)],[c_6,c_18116]) ).
tff(c_18,plain,
~ theorem(implies(p,or(p,q))),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_18154,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_18146,c_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL185-3 : TPTP v8.1.2. Released v2.3.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.32 % Computer : n012.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Thu Aug 3 13:51:07 EDT 2023
% 0.12/0.32 % CPUTime :
% 13.18/4.73 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.18/4.74
% 13.18/4.74 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 13.18/4.77
% 13.18/4.77 Inference rules
% 13.18/4.77 ----------------------
% 13.18/4.77 #Ref : 0
% 13.18/4.77 #Sup : 4415
% 13.18/4.77 #Fact : 0
% 13.18/4.77 #Define : 0
% 13.18/4.77 #Split : 2
% 13.18/4.77 #Chain : 0
% 13.18/4.77 #Close : 0
% 13.18/4.77
% 13.18/4.77 Ordering : KBO
% 13.18/4.77
% 13.18/4.77 Simplification rules
% 13.18/4.77 ----------------------
% 13.18/4.77 #Subsume : 2165
% 13.18/4.77 #Demod : 374
% 13.18/4.77 #Tautology : 190
% 13.18/4.77 #SimpNegUnit : 276
% 13.18/4.77 #BackRed : 85
% 13.18/4.77
% 13.18/4.77 #Partial instantiations: 0
% 13.18/4.77 #Strategies tried : 1
% 13.18/4.77
% 13.18/4.77 Timing (in seconds)
% 13.18/4.77 ----------------------
% 13.18/4.77 Preprocessing : 0.43
% 13.18/4.77 Parsing : 0.23
% 13.18/4.77 CNF conversion : 0.02
% 13.18/4.77 Main loop : 3.30
% 13.18/4.77 Inferencing : 0.90
% 13.18/4.77 Reduction : 0.79
% 13.18/4.77 Demodulation : 0.54
% 13.18/4.77 BG Simplification : 0.05
% 13.18/4.77 Subsumption : 1.32
% 13.18/4.77 Abstraction : 0.06
% 13.18/4.77 MUC search : 0.00
% 13.18/4.77 Cooper : 0.00
% 13.18/4.77 Total : 3.77
% 13.18/4.77 Index Insertion : 0.00
% 13.18/4.77 Index Deletion : 0.00
% 13.18/4.77 Index Matching : 0.00
% 13.18/4.78 BG Taut test : 0.00
%------------------------------------------------------------------------------