TSTP Solution File: LCL225-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL225-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/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 : n031.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 230.12s 212.58s
% Output : CNFRefutation 230.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 16
% Syntax : Number of formulae : 66 ( 28 unt; 7 typ; 0 def)
% Number of atoms : 100 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 85 ( 44 ~; 41 |; 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 144 (; 144 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ theorem > axiom > or > #nlpp > not > r > q > p
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(r,type,
r: $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(p,type,
p: $i ).
tff(f_57,axiom,
! [A,B] : axiom(or(not(or(A,B)),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_53,axiom,
! [A] : axiom(or(not(or(A,A)),A)),
file(unknown,unknown) ).
tff(f_55,axiom,
! [A,B] : axiom(or(not(A),or(B,A))),
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_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),or(not(q),r))),or(not(or(not(p),q)),or(not(p),r)))),
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_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_2,plain,
! [A_1] : axiom(or(not(or(A_1,A_1)),A_1)),
inference(cnfTransformation,[status(thm)],[f_53]) ).
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_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_413,plain,
! [X_81,Y_82,Z_83] :
( ~ axiom(or(not(X_81),Y_82))
| theorem(or(not(X_81),Z_83))
| ~ axiom(or(not(Y_82),Z_83)) ),
inference(resolution,[status(thm)],[c_12,c_121]) ).
tff(c_445,plain,
! [A_84,Z_85,B_86] :
( theorem(or(not(A_84),Z_85))
| ~ axiom(or(not(or(B_86,A_84)),Z_85)) ),
inference(resolution,[status(thm)],[c_4,c_413]) ).
tff(c_467,plain,
! [A_87] : theorem(or(not(A_87),A_87)),
inference(resolution,[status(thm)],[c_2,c_445]) ).
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_545,plain,
! [B_100,C_101] : theorem(or(B_100,or(not(or(B_100,C_101)),C_101))),
inference(resolution,[status(thm)],[c_467,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_556,plain,
! [B_100,C_101] : theorem(or(or(not(or(B_100,C_101)),C_101),B_100)),
inference(resolution,[status(thm)],[c_545,c_40]) ).
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_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_29,plain,
! [A_1] :
( ~ theorem(or(A_1,A_1))
| theorem(A_1) ),
inference(resolution,[status(thm)],[c_2,c_22]) ).
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_8442,plain,
! [B_1048,B_1049,C_1050] :
( theorem(or(B_1048,or(B_1049,C_1050)))
| ~ theorem(or(or(B_1048,or(B_1049,C_1050)),C_1050)) ),
inference(resolution,[status(thm)],[c_94,c_171]) ).
tff(c_9358,plain,
! [B_1051,B_1052] : theorem(or(not(or(B_1051,or(B_1052,B_1051))),or(B_1052,B_1051))),
inference(resolution,[status(thm)],[c_556,c_8442]) ).
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_17297,plain,
! [X_1824,B_1825,B_1826] :
( ~ axiom(or(not(X_1824),or(B_1825,or(B_1826,B_1825))))
| theorem(or(not(X_1824),or(B_1826,B_1825))) ),
inference(resolution,[status(thm)],[c_9358,c_16]) ).
tff(c_17325,plain,
! [A_1827,C_1828] : theorem(or(not(or(A_1827,or(C_1828,C_1828))),or(A_1827,C_1828))),
inference(resolution,[status(thm)],[c_8,c_17297]) ).
tff(c_19129,plain,
! [X_2028,A_2029,C_2030] :
( ~ axiom(or(not(X_2028),or(A_2029,or(C_2030,C_2030))))
| theorem(or(not(X_2028),or(A_2029,C_2030))) ),
inference(resolution,[status(thm)],[c_17325,c_16]) ).
tff(c_19153,plain,
! [C_2030,B_5] : theorem(or(not(or(or(C_2030,C_2030),B_5)),or(B_5,C_2030))),
inference(resolution,[status(thm)],[c_6,c_19129]) ).
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_359,plain,
! [A_78,B_79,C_80] :
( ~ theorem(or(not(A_78),B_79))
| theorem(or(not(or(C_80,A_78)),or(C_80,B_79))) ),
inference(resolution,[status(thm)],[c_211,c_14]) ).
tff(c_1433,plain,
! [X_232,C_233,A_234,B_235] :
( ~ axiom(or(not(X_232),or(C_233,A_234)))
| theorem(or(not(X_232),or(C_233,B_235)))
| ~ theorem(or(not(A_234),B_235)) ),
inference(resolution,[status(thm)],[c_359,c_16]) ).
tff(c_5077,plain,
! [A_604,B_605,C_606,B_607] :
( theorem(or(not(or(A_604,or(B_605,C_606))),or(B_605,B_607)))
| ~ theorem(or(not(or(A_604,C_606)),B_607)) ),
inference(resolution,[status(thm)],[c_8,c_1433]) ).
tff(c_26418,plain,
! [X_2679,C_2678,B_2676,B_2677,A_2680] :
( ~ axiom(or(not(X_2679),or(A_2680,or(B_2677,C_2678))))
| theorem(or(not(X_2679),or(B_2677,B_2676)))
| ~ theorem(or(not(or(A_2680,C_2678)),B_2676)) ),
inference(resolution,[status(thm)],[c_5077,c_16]) ).
tff(c_26495,plain,
! [B_2685,C_2686,B_2687,B_2688] :
( theorem(or(not(or(B_2685,C_2686)),or(B_2685,B_2687)))
| ~ theorem(or(not(or(B_2688,C_2686)),B_2687)) ),
inference(resolution,[status(thm)],[c_4,c_26418]) ).
tff(c_28066,plain,
! [B_2689,B_2690,C_2691] : theorem(or(not(or(B_2689,B_2690)),or(B_2689,or(B_2690,C_2691)))),
inference(resolution,[status(thm)],[c_19153,c_26495]) ).
tff(c_28089,plain,
! [B_2692,B_2693,C_2694] : theorem(or(B_2692,or(not(or(B_2692,B_2693)),or(B_2693,C_2694)))),
inference(resolution,[status(thm)],[c_28066,c_60]) ).
tff(c_28227,plain,
! [B_2714,B_2715,C_2716] : theorem(or(or(not(or(B_2714,B_2715)),or(B_2715,C_2716)),B_2714)),
inference(resolution,[status(thm)],[c_28089,c_40]) ).
tff(c_157,plain,
! [B_52,C_53] :
( theorem(or(B_52,C_53))
| ~ theorem(or(or(B_52,C_53),C_53)) ),
inference(resolution,[status(thm)],[c_142,c_29]) ).
tff(c_28251,plain,
! [B_2717,C_2718] : theorem(or(not(or(or(B_2717,C_2718),B_2717)),or(B_2717,C_2718))),
inference(resolution,[status(thm)],[c_28227,c_157]) ).
tff(c_32960,plain,
! [X_3248,B_3249,C_3250] :
( ~ axiom(or(not(X_3248),or(or(B_3249,C_3250),B_3249)))
| theorem(or(not(X_3248),or(B_3249,C_3250))) ),
inference(resolution,[status(thm)],[c_28251,c_16]) ).
tff(c_32978,plain,
! [A_4,C_3250] : theorem(or(not(or(A_4,or(A_4,C_3250))),or(A_4,C_3250))),
inference(resolution,[status(thm)],[c_6,c_32960]) ).
tff(c_10,plain,
! [A_9,B_10,C_11] : axiom(or(not(or(not(A_9),B_10)),or(not(or(C_11,A_9)),or(C_11,B_10)))),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_6242,plain,
! [A_741,B_742,C_743,B_744] :
( theorem(or(not(or(not(A_741),B_742)),or(not(or(C_743,A_741)),B_744)))
| ~ theorem(or(not(or(C_743,B_742)),B_744)) ),
inference(resolution,[status(thm)],[c_10,c_1433]) ).
tff(c_29738,plain,
! [B_2933,X_2932,C_2929,A_2931,B_2930] :
( ~ axiom(or(not(X_2932),or(not(A_2931),B_2930)))
| theorem(or(not(X_2932),or(not(or(C_2929,A_2931)),B_2933)))
| ~ theorem(or(not(or(C_2929,B_2930)),B_2933)) ),
inference(resolution,[status(thm)],[c_6242,c_16]) ).
tff(c_206740,plain,
! [C_10214,B_10213,A_10217,C_10215,A_10216] :
( theorem(or(not(or(A_10216,or(not(A_10217),C_10214))),or(not(or(C_10215,A_10217)),B_10213)))
| ~ theorem(or(not(or(C_10215,or(A_10216,C_10214))),B_10213)) ),
inference(resolution,[status(thm)],[c_8,c_29738]) ).
tff(c_18,plain,
~ theorem(or(not(or(not(p),or(not(q),r))),or(not(or(not(p),q)),or(not(p),r)))),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_206785,plain,
~ theorem(or(not(or(not(p),or(not(p),r))),or(not(p),r))),
inference(resolution,[status(thm)],[c_206740,c_18]) ).
tff(c_206811,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_32978,c_206785]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : LCL225-1 : TPTP v8.1.2. Released v1.1.0.
% 0.12/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.35 % Computer : n031.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 13:57:44 EDT 2023
% 0.14/0.36 % CPUTime :
% 230.12/212.58 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 230.12/212.59
% 230.12/212.59 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 230.22/212.63
% 230.22/212.63 Inference rules
% 230.22/212.63 ----------------------
% 230.22/212.63 #Ref : 0
% 230.22/212.63 #Sup : 46687
% 230.22/212.63 #Fact : 0
% 230.22/212.63 #Define : 0
% 230.22/212.63 #Split : 3
% 230.22/212.63 #Chain : 0
% 230.22/212.63 #Close : 0
% 230.22/212.63
% 230.22/212.63 Ordering : KBO
% 230.22/212.63
% 230.22/212.63 Simplification rules
% 230.22/212.63 ----------------------
% 230.22/212.63 #Subsume : 2140
% 230.22/212.63 #Demod : 14654
% 230.22/212.63 #Tautology : 14663
% 230.22/212.63 #SimpNegUnit : 0
% 230.22/212.63 #BackRed : 0
% 230.22/212.63
% 230.22/212.63 #Partial instantiations: 0
% 230.22/212.63 #Strategies tried : 1
% 230.22/212.63
% 230.22/212.63 Timing (in seconds)
% 230.22/212.63 ----------------------
% 230.22/212.63 Preprocessing : 0.43
% 230.22/212.63 Parsing : 0.24
% 230.22/212.63 CNF conversion : 0.02
% 230.22/212.63 Main loop : 211.04
% 230.22/212.63 Inferencing : 16.51
% 230.22/212.63 Reduction : 79.80
% 230.22/212.63 Demodulation : 69.38
% 230.22/212.63 BG Simplification : 0.25
% 230.22/212.63 Subsumption : 105.45
% 230.22/212.63 Abstraction : 0.45
% 230.22/212.63 MUC search : 0.00
% 230.22/212.63 Cooper : 0.00
% 230.22/212.63 Total : 211.54
% 230.22/212.63 Index Insertion : 0.00
% 230.22/212.63 Index Deletion : 0.00
% 230.22/212.63 Index Matching : 0.00
% 230.22/212.63 BG Taut test : 0.00
%------------------------------------------------------------------------------