TSTP Solution File: LCL217-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL217-1 : TPTP v8.1.2. Released v1.1.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 : n017.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:42 EDT 2023
% Result : Unsatisfiable 36.12s 26.80s
% Output : CNFRefutation 36.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 15
% Syntax : Number of formulae : 53 ( 22 unt; 6 typ; 0 def)
% Number of atoms : 80 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 69 ( 36 ~; 33 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 4 >; 1 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 110 (; 110 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ theorem > axiom > or > #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(f_57,axiom,
! [A,B] : axiom(or(not(or(A,B)),or(B,A))),
file(unknown,unknown) ).
tff(f_55,axiom,
! [A,B] : axiom(or(not(A),or(B,A))),
file(unknown,unknown) ).
tff(f_59,axiom,
! [A,B,C] : axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
file(unknown,unknown) ).
tff(f_66,axiom,
! [X] :
( theorem(X)
| ~ axiom(X) ),
file(unknown,unknown) ).
tff(f_82,axiom,
! [X,Z,Y] :
( theorem(or(not(X),Z))
| ~ axiom(or(not(X),Y))
| ~ theorem(or(not(Y),Z)) ),
file(unknown,unknown) ).
tff(f_74,axiom,
! [X,Y] :
( theorem(X)
| ~ axiom(or(not(Y),X))
| ~ theorem(Y) ),
file(unknown,unknown) ).
tff(f_53,axiom,
! [A] : axiom(or(not(or(A,A)),A)),
file(unknown,unknown) ).
tff(f_61,axiom,
! [A,B,C] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
file(unknown,unknown) ).
tff(f_86,axiom,
~ theorem(or(not(or(not(p),q)),or(not(or(not(p),not(q))),not(p)))),
file(unknown,unknown) ).
tff(c_6,plain,
! [A_4,B_5] : axiom(or(not(or(A_4,B_5)),or(B_5,A_4))),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_4,plain,
! [A_2,B_3] : axiom(or(not(A_2),or(B_3,A_2))),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_8,plain,
! [A_6,B_7,C_8] : axiom(or(not(or(A_6,or(B_7,C_8))),or(B_7,or(A_6,C_8)))),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_12,plain,
! [X_12] :
( ~ axiom(X_12)
| theorem(X_12) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_121,plain,
! [Y_48,Z_49,X_50] :
( ~ theorem(or(not(Y_48),Z_49))
| ~ axiom(or(not(X_50),Y_48))
| theorem(or(not(X_50),Z_49)) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_449,plain,
! [X_89,Y_90,Z_91] :
( ~ axiom(or(not(X_89),Y_90))
| theorem(or(not(X_89),Z_91))
| ~ axiom(or(not(Y_90),Z_91)) ),
inference(resolution,[status(thm)],[c_12,c_121]) ).
tff(c_1290,plain,
! [A_220,B_221,C_222,Z_223] :
( theorem(or(not(or(A_220,or(B_221,C_222))),Z_223))
| ~ axiom(or(not(or(B_221,or(A_220,C_222))),Z_223)) ),
inference(resolution,[status(thm)],[c_8,c_449]) ).
tff(c_16,plain,
! [Y_17,Z_16,X_15] :
( ~ theorem(or(not(Y_17),Z_16))
| ~ axiom(or(not(X_15),Y_17))
| theorem(or(not(X_15),Z_16)) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_7563,plain,
! [Z_932,B_936,A_935,C_933,X_934] :
( ~ axiom(or(not(X_934),or(A_935,or(B_936,C_933))))
| theorem(or(not(X_934),Z_932))
| ~ axiom(or(not(or(B_936,or(A_935,C_933))),Z_932)) ),
inference(resolution,[status(thm)],[c_1290,c_16]) ).
tff(c_13859,plain,
! [B_1507,C_1508,Z_1509,B_1510] :
( theorem(or(not(or(B_1507,C_1508)),Z_1509))
| ~ axiom(or(not(or(B_1507,or(B_1510,C_1508))),Z_1509)) ),
inference(resolution,[status(thm)],[c_4,c_7563]) ).
tff(c_13887,plain,
! [A_1511,C_1512,B_1513] : theorem(or(not(or(A_1511,C_1512)),or(or(B_1513,C_1512),A_1511))),
inference(resolution,[status(thm)],[c_6,c_13859]) ).
tff(c_56,plain,
! [A_32,B_33,C_34] : axiom(or(not(or(A_32,or(B_33,C_34))),or(B_33,or(A_32,C_34)))),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_14,plain,
! [Y_14,X_13] :
( ~ theorem(Y_14)
| ~ axiom(or(not(Y_14),X_13))
| theorem(X_13) ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_60,plain,
! [A_32,B_33,C_34] :
( ~ theorem(or(A_32,or(B_33,C_34)))
| theorem(or(B_33,or(A_32,C_34))) ),
inference(resolution,[status(thm)],[c_56,c_14]) ).
tff(c_13901,plain,
! [B_1514,C_1515,A_1516] : theorem(or(or(B_1514,C_1515),or(not(or(A_1516,C_1515)),A_1516))),
inference(resolution,[status(thm)],[c_13887,c_60]) ).
tff(c_36,plain,
! [A_25,B_26] : axiom(or(not(or(A_25,B_26)),or(B_26,A_25))),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_40,plain,
! [A_25,B_26] :
( ~ theorem(or(A_25,B_26))
| theorem(or(B_26,A_25)) ),
inference(resolution,[status(thm)],[c_36,c_14]) ).
tff(c_13935,plain,
! [A_1520,C_1521,B_1522] : theorem(or(or(not(or(A_1520,C_1521)),A_1520),or(B_1522,C_1521))),
inference(resolution,[status(thm)],[c_13901,c_40]) ).
tff(c_13975,plain,
! [B_1523,A_1524,C_1525] : theorem(or(B_1523,or(or(not(or(A_1524,C_1525)),A_1524),C_1525))),
inference(resolution,[status(thm)],[c_13935,c_60]) ).
tff(c_2,plain,
! [A_1] : axiom(or(not(or(A_1,A_1)),A_1)),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_22,plain,
! [Y_22,X_23] :
( ~ theorem(Y_22)
| ~ axiom(or(not(Y_22),X_23))
| theorem(X_23) ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_29,plain,
! [A_1] :
( ~ theorem(or(A_1,A_1))
| theorem(A_1) ),
inference(resolution,[status(thm)],[c_2,c_22]) ).
tff(c_14026,plain,
! [A_1526,C_1527] : theorem(or(or(not(or(A_1526,C_1527)),A_1526),C_1527)),
inference(resolution,[status(thm)],[c_13975,c_29]) ).
tff(c_14050,plain,
! [C_1527,A_1526] : theorem(or(C_1527,or(not(or(A_1526,C_1527)),A_1526))),
inference(resolution,[status(thm)],[c_14026,c_40]) ).
tff(c_211,plain,
! [A_59,B_60,C_61] : axiom(or(not(or(not(A_59),B_60)),or(not(or(C_61,A_59)),or(C_61,B_60)))),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_304,plain,
! [A_70,B_71,C_72] :
( ~ theorem(or(not(A_70),B_71))
| theorem(or(not(or(C_72,A_70)),or(C_72,B_71))) ),
inference(resolution,[status(thm)],[c_211,c_14]) ).
tff(c_1128,plain,
! [C_194,A_195,B_196] :
( theorem(or(C_194,or(not(or(C_194,A_195)),B_196)))
| ~ theorem(or(not(A_195),B_196)) ),
inference(resolution,[status(thm)],[c_304,c_60]) ).
tff(c_1138,plain,
! [C_194,A_195,B_196] :
( theorem(or(or(not(or(C_194,A_195)),B_196),C_194))
| ~ theorem(or(not(A_195),B_196)) ),
inference(resolution,[status(thm)],[c_1128,c_40]) ).
tff(c_30,plain,
! [A_2,B_3] :
( ~ theorem(A_2)
| theorem(or(B_3,A_2)) ),
inference(resolution,[status(thm)],[c_4,c_22]) ).
tff(c_79,plain,
! [A_39,B_40,C_41] :
( ~ theorem(or(A_39,or(B_40,C_41)))
| theorem(or(B_40,or(A_39,C_41))) ),
inference(resolution,[status(thm)],[c_56,c_14]) ).
tff(c_94,plain,
! [B_40,B_3,C_41] :
( theorem(or(B_40,or(B_3,C_41)))
| ~ theorem(or(B_40,C_41)) ),
inference(resolution,[status(thm)],[c_30,c_79]) ).
tff(c_142,plain,
! [B_51,B_52,C_53] :
( theorem(or(B_51,or(B_52,C_53)))
| ~ theorem(or(B_51,C_53)) ),
inference(resolution,[status(thm)],[c_30,c_79]) ).
tff(c_171,plain,
! [B_57,C_58] :
( theorem(or(B_57,C_58))
| ~ theorem(or(or(B_57,C_58),C_58)) ),
inference(resolution,[status(thm)],[c_142,c_29]) ).
tff(c_7928,plain,
! [B_990,B_991,C_992] :
( theorem(or(B_990,or(B_991,C_992)))
| ~ theorem(or(or(B_990,or(B_991,C_992)),C_992)) ),
inference(resolution,[status(thm)],[c_94,c_171]) ).
tff(c_58337,plain,
! [C_4388,A_4389,B_4390] :
( theorem(or(not(or(C_4388,A_4389)),or(B_4390,C_4388)))
| ~ theorem(or(not(A_4389),or(B_4390,C_4388))) ),
inference(resolution,[status(thm)],[c_1138,c_7928]) ).
tff(c_18,plain,
~ theorem(or(not(or(not(p),q)),or(not(or(not(p),not(q))),not(p)))),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_58349,plain,
~ theorem(or(not(q),or(not(or(not(p),not(q))),not(p)))),
inference(resolution,[status(thm)],[c_58337,c_18]) ).
tff(c_58364,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_14050,c_58349]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL217-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.14 % 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.15/0.36 % Computer : n017.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 13:21:51 EDT 2023
% 0.15/0.36 % CPUTime :
% 36.12/26.80 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 36.25/26.80
% 36.25/26.80 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 36.25/26.84
% 36.25/26.84 Inference rules
% 36.25/26.84 ----------------------
% 36.25/26.84 #Ref : 0
% 36.25/26.84 #Sup : 12769
% 36.25/26.84 #Fact : 0
% 36.25/26.84 #Define : 0
% 36.25/26.84 #Split : 0
% 36.25/26.84 #Chain : 0
% 36.25/26.84 #Close : 0
% 36.25/26.84
% 36.25/26.84 Ordering : KBO
% 36.25/26.84
% 36.25/26.84 Simplification rules
% 36.25/26.84 ----------------------
% 36.25/26.84 #Subsume : 1041
% 36.25/26.84 #Demod : 5388
% 36.25/26.84 #Tautology : 5395
% 36.25/26.84 #SimpNegUnit : 0
% 36.25/26.84 #BackRed : 0
% 36.25/26.84
% 36.25/26.84 #Partial instantiations: 0
% 36.25/26.84 #Strategies tried : 1
% 36.25/26.84
% 36.25/26.84 Timing (in seconds)
% 36.25/26.84 ----------------------
% 36.25/26.85 Preprocessing : 0.44
% 36.25/26.85 Parsing : 0.24
% 36.25/26.85 CNF conversion : 0.03
% 36.25/26.85 Main loop : 25.33
% 36.25/26.85 Inferencing : 3.67
% 36.25/26.85 Reduction : 10.60
% 36.25/26.85 Demodulation : 8.96
% 36.25/26.85 BG Simplification : 0.07
% 36.25/26.85 Subsumption : 10.00
% 36.25/26.85 Abstraction : 0.13
% 36.25/26.85 MUC search : 0.00
% 36.25/26.85 Cooper : 0.00
% 36.25/26.85 Total : 25.83
% 36.25/26.85 Index Insertion : 0.00
% 36.25/26.85 Index Deletion : 0.00
% 36.25/26.85 Index Matching : 0.00
% 36.25/26.85 BG Taut test : 0.00
%------------------------------------------------------------------------------